TSTP Solution File: SYN367+1 by E-SAT---3.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.0
% Problem  : SYN367+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 29 22:02:22 EDT 2022

% Result   : Theorem 0.21s 0.48s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   15 (   5 unt;   5 typ;   0 def)
%            Number of atoms       :   31 (   0 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :   32 (  11   ~;  10   |;   9   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   2   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   2 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   10 (   3 sgn   7   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    p: $o ).

tff(decl_23,type,
    big_q: $i > $o ).

tff(decl_24,type,
    big_r: $i > $o ).

tff(decl_25,type,
    esk1_0: $i ).

tff(decl_26,type,
    esk2_0: $i ).

fof(x2118,conjecture,
    ( ! [X1] :
        ( ( p
          & big_q(X1) )
        | ( ~ p
          & big_r(X1) ) )
   => ( ! [X1] : big_q(X1)
      | ! [X1] : big_r(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2118) ).

fof(c_0_1,negated_conjecture,
    ~ ( ! [X1] :
          ( ( p
            & big_q(X1) )
          | ( ~ p
            & big_r(X1) ) )
     => ( ! [X1] : big_q(X1)
        | ! [X1] : big_r(X1) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[x2118])]) ).

fof(c_0_2,negated_conjecture,
    ! [X2] :
      ( ( ~ p
        | p )
      & ( big_r(X2)
        | p )
      & ( ~ p
        | big_q(X2) )
      & ( big_r(X2)
        | big_q(X2) )
      & ~ big_q(esk1_0)
      & ~ big_r(esk2_0) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).

cnf(c_0_3,negated_conjecture,
    ~ big_q(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( big_q(X1)
    | ~ p ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ( big_r(X1)
    | p ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    ~ p,
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ~ big_r(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_8,negated_conjecture,
    big_r(X1),
    inference(sr,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN367+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n016.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Mon Sep  5 03:18:54 EDT 2022
% 0.14/0.34  % CPUTime    : 
% 0.21/0.47  Running first-order on 8 cores model finding
% 0.21/0.47  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47  # Version: 3.0pre003
% 0.21/0.48  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48  # Starting sh5l with 300s (1) cores
% 0.21/0.48  # new_bool_3 with pid 1491 completed with status 0
% 0.21/0.48  # Result found by new_bool_3
% 0.21/0.48  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.48  # ...ProofStateSinE()=1/1
% 0.21/0.48  # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.21/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.48  # SAT001_MinMin_p005000_rr_RG with pid 1495 completed with status 0
% 0.21/0.48  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.48  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.48  # ...ProofStateSinE()=1/1
% 0.21/0.48  # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.21/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.48  # Preprocessing time       : 0.001 s
% 0.21/0.48  # Presaturation interreduction done
% 0.21/0.48  
% 0.21/0.48  # Proof found!
% 0.21/0.48  # SZS status Theorem
% 0.21/0.48  # SZS output start CNFRefutation
% See solution above
% 0.21/0.48  # Parsed axioms                        : 1
% 0.21/0.48  # Removed by relevancy pruning/SinE    : 0
% 0.21/0.48  # Initial clauses                      : 6
% 0.21/0.48  # Removed in clause preprocessing      : 1
% 0.21/0.48  # Initial clauses in saturation        : 5
% 0.21/0.48  # Processed clauses                    : 10
% 0.21/0.48  # ...of these trivial                  : 0
% 0.21/0.48  # ...subsumed                          : 0
% 0.21/0.48  # ...remaining for further processing  : 10
% 0.21/0.48  # Other redundant clauses eliminated   : 0
% 0.21/0.48  # Clauses deleted for lack of memory   : 0
% 0.21/0.48  # Backward-subsumed                    : 1
% 0.21/0.48  # Backward-rewritten                   : 1
% 0.21/0.48  # Generated clauses                    : 1
% 0.21/0.48  # ...of the previous two non-redundant : 1
% 0.21/0.48  # ...aggressively subsumed             : 0
% 0.21/0.48  # Contextual simplify-reflections      : 0
% 0.21/0.48  # Paramodulations                      : 1
% 0.21/0.48  # Factorizations                       : 0
% 0.21/0.48  # NegExts                              : 0
% 0.21/0.48  # Equation resolutions                 : 0
% 0.21/0.48  # Propositional unsat checks           : 0
% 0.21/0.48  #    Propositional check models        : 0
% 0.21/0.48  #    Propositional check unsatisfiable : 0
% 0.21/0.48  #    Propositional clauses             : 0
% 0.21/0.48  #    Propositional clauses after purity: 0
% 0.21/0.48  #    Propositional unsat core size     : 0
% 0.21/0.48  #    Propositional preprocessing time  : 0.000
% 0.21/0.48  #    Propositional encoding time       : 0.000
% 0.21/0.48  #    Propositional solver time         : 0.000
% 0.21/0.48  #    Success case prop preproc time    : 0.000
% 0.21/0.48  #    Success case prop encoding time   : 0.000
% 0.21/0.48  #    Success case prop solver time     : 0.000
% 0.21/0.48  # Current number of processed clauses  : 3
% 0.21/0.48  #    Positive orientable unit clauses  : 1
% 0.21/0.48  #    Positive unorientable unit clauses: 0
% 0.21/0.48  #    Negative unit clauses             : 2
% 0.21/0.48  #    Non-unit-clauses                  : 0
% 0.21/0.48  # Current number of unprocessed clauses: 1
% 0.21/0.48  # ...number of literals in the above   : 2
% 0.21/0.48  # Current number of archived formulas  : 0
% 0.21/0.48  # Current number of archived clauses   : 7
% 0.21/0.48  # Clause-clause subsumption calls (NU) : 0
% 0.21/0.48  # Rec. Clause-clause subsumption calls : 0
% 0.21/0.48  # Non-unit clause-clause subsumptions  : 0
% 0.21/0.48  # Unit Clause-clause subsumption calls : 1
% 0.21/0.48  # Rewrite failures with RHS unbound    : 0
% 0.21/0.48  # BW rewrite match attempts            : 1
% 0.21/0.48  # BW rewrite match successes           : 1
% 0.21/0.48  # Condensation attempts                : 0
% 0.21/0.48  # Condensation successes               : 0
% 0.21/0.48  # Termbank termtop insertions          : 238
% 0.21/0.48  
% 0.21/0.48  # -------------------------------------------------
% 0.21/0.48  # User time                : 0.003 s
% 0.21/0.48  # System time              : 0.001 s
% 0.21/0.48  # Total time               : 0.004 s
% 0.21/0.48  # Maximum resident set size: 1580 pages
% 0.21/0.48  
% 0.21/0.48  # -------------------------------------------------
% 0.21/0.48  # User time                : 0.006 s
% 0.21/0.48  # System time              : 0.001 s
% 0.21/0.48  # Total time               : 0.007 s
% 0.21/0.48  # Maximum resident set size: 1696 pages
%------------------------------------------------------------------------------