TSTP Solution File: SYN986+1.001 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SYN986+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n013.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 20:27:43 EDT 2023

% Result   : Theorem 0.18s 0.50s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   14 (   6 unt;   0 def)
%            Number of atoms       :   25 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   23 (  12   ~;   7   |;   2   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   27 (   3 sgn;  12   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ck,conjecture,
    ? [X4,X5] :
      ( r(zero,zero,X4)
      & r(zero,X4,X5) ),
    file('/export/starexec/sandbox2/tmp/tmp.k6EUqdIRtF/E---3.1_31509.p',ck) ).

fof(hyp1,axiom,
    ! [X1] : r(X1,zero,succ(X1)),
    file('/export/starexec/sandbox2/tmp/tmp.k6EUqdIRtF/E---3.1_31509.p',hyp1) ).

fof(hyp2,axiom,
    ! [X1,X2,X3,X4] :
      ( r(X1,X2,X3)
     => ( r(X3,X2,X4)
       => r(X1,succ(X2),X4) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.k6EUqdIRtF/E---3.1_31509.p',hyp2) ).

fof(c_0_3,negated_conjecture,
    ~ ? [X4,X5] :
        ( r(zero,zero,X4)
        & r(zero,X4,X5) ),
    inference(assume_negation,[status(cth)],[ck]) ).

fof(c_0_4,negated_conjecture,
    ! [X6,X7] :
      ( ~ r(zero,zero,X6)
      | ~ r(zero,X6,X7) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).

fof(c_0_5,plain,
    ! [X8] : r(X8,zero,succ(X8)),
    inference(variable_rename,[status(thm)],[hyp1]) ).

fof(c_0_6,plain,
    ! [X9,X10,X11,X12] :
      ( ~ r(X9,X10,X11)
      | ~ r(X11,X10,X12)
      | r(X9,succ(X10),X12) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[hyp2])]) ).

cnf(c_0_7,negated_conjecture,
    ( ~ r(zero,zero,X1)
    | ~ r(zero,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    r(X1,zero,succ(X1)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( r(X1,succ(X2),X4)
    | ~ r(X1,X2,X3)
    | ~ r(X3,X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    ~ r(zero,succ(zero),X1),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,plain,
    ( r(X1,succ(zero),succ(X2))
    | ~ r(X1,zero,X2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    ~ r(zero,zero,X1),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_12,c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15  % Problem    : SYN986+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n013.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 2400
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon Oct  2 18:24:29 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 0.18/0.49  Running first-order theorem proving
% 0.18/0.49  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.k6EUqdIRtF/E---3.1_31509.p
% 0.18/0.50  # Version: 3.1pre001
% 0.18/0.50  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.50  # Starting sh5l with 300s (1) cores
% 0.18/0.50  # new_bool_1 with pid 31589 completed with status 0
% 0.18/0.50  # Result found by new_bool_1
% 0.18/0.50  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.50  # Search class: FHHNF-FFSF11-SFFFFFNN
% 0.18/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.50  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.50  # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 31591 completed with status 0
% 0.18/0.50  # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.50  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.50  # Search class: FHHNF-FFSF11-SFFFFFNN
% 0.18/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.50  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.50  # Preprocessing time       : 0.001 s
% 0.18/0.50  # Presaturation interreduction done
% 0.18/0.50  
% 0.18/0.50  # Proof found!
% 0.18/0.50  # SZS status Theorem
% 0.18/0.50  # SZS output start CNFRefutation
% See solution above
% 0.18/0.50  # Parsed axioms                        : 3
% 0.18/0.50  # Removed by relevancy pruning/SinE    : 0
% 0.18/0.50  # Initial clauses                      : 3
% 0.18/0.50  # Removed in clause preprocessing      : 0
% 0.18/0.50  # Initial clauses in saturation        : 3
% 0.18/0.50  # Processed clauses                    : 9
% 0.18/0.50  # ...of these trivial                  : 0
% 0.18/0.50  # ...subsumed                          : 0
% 0.18/0.50  # ...remaining for further processing  : 9
% 0.18/0.50  # Other redundant clauses eliminated   : 0
% 0.18/0.50  # Clauses deleted for lack of memory   : 0
% 0.18/0.50  # Backward-subsumed                    : 1
% 0.18/0.50  # Backward-rewritten                   : 0
% 0.18/0.50  # Generated clauses                    : 5
% 0.18/0.50  # ...of the previous two non-redundant : 4
% 0.18/0.50  # ...aggressively subsumed             : 0
% 0.18/0.50  # Contextual simplify-reflections      : 0
% 0.18/0.50  # Paramodulations                      : 5
% 0.18/0.50  # Factorizations                       : 0
% 0.18/0.50  # NegExts                              : 0
% 0.18/0.50  # Equation resolutions                 : 0
% 0.18/0.50  # Total rewrite steps                  : 0
% 0.18/0.50  # Propositional unsat checks           : 0
% 0.18/0.50  #    Propositional check models        : 0
% 0.18/0.50  #    Propositional check unsatisfiable : 0
% 0.18/0.50  #    Propositional clauses             : 0
% 0.18/0.50  #    Propositional clauses after purity: 0
% 0.18/0.50  #    Propositional unsat core size     : 0
% 0.18/0.50  #    Propositional preprocessing time  : 0.000
% 0.18/0.50  #    Propositional encoding time       : 0.000
% 0.18/0.50  #    Propositional solver time         : 0.000
% 0.18/0.50  #    Success case prop preproc time    : 0.000
% 0.18/0.50  #    Success case prop encoding time   : 0.000
% 0.18/0.50  #    Success case prop solver time     : 0.000
% 0.18/0.50  # Current number of processed clauses  : 5
% 0.18/0.50  #    Positive orientable unit clauses  : 1
% 0.18/0.50  #    Positive unorientable unit clauses: 0
% 0.18/0.50  #    Negative unit clauses             : 2
% 0.18/0.50  #    Non-unit-clauses                  : 2
% 0.18/0.50  # Current number of unprocessed clauses: 1
% 0.18/0.50  # ...number of literals in the above   : 3
% 0.18/0.50  # Current number of archived formulas  : 0
% 0.18/0.50  # Current number of archived clauses   : 4
% 0.18/0.50  # Clause-clause subsumption calls (NU) : 0
% 0.18/0.50  # Rec. Clause-clause subsumption calls : 0
% 0.18/0.50  # Non-unit clause-clause subsumptions  : 0
% 0.18/0.50  # Unit Clause-clause subsumption calls : 3
% 0.18/0.50  # Rewrite failures with RHS unbound    : 0
% 0.18/0.50  # BW rewrite match attempts            : 1
% 0.18/0.50  # BW rewrite match successes           : 0
% 0.18/0.50  # Condensation attempts                : 0
% 0.18/0.50  # Condensation successes               : 0
% 0.18/0.50  # Termbank termtop insertions          : 283
% 0.18/0.50  
% 0.18/0.50  # -------------------------------------------------
% 0.18/0.50  # User time                : 0.003 s
% 0.18/0.50  # System time              : 0.001 s
% 0.18/0.50  # Total time               : 0.004 s
% 0.18/0.50  # Maximum resident set size: 1596 pages
% 0.18/0.50  
% 0.18/0.50  # -------------------------------------------------
% 0.18/0.50  # User time                : 0.004 s
% 0.18/0.50  # System time              : 0.003 s
% 0.18/0.50  # Total time               : 0.007 s
% 0.18/0.50  # Maximum resident set size: 1676 pages
% 0.18/0.50  % E---3.1 exiting
% 0.18/0.51  % E---3.1 exiting
%------------------------------------------------------------------------------