TSTP Solution File: NUM024-1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : NUM024-1 : TPTP v8.1.2. Bugfixed 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 18:45:48 EDT 2023

% Result   : Unsatisfiable 0.16s 0.45s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (  12 unt;   0 nHn;  17 RR)
%            Number of literals    :   36 (   0 equ;  16 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   37 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(transitivity,axiom,
    ( equalish(X1,X3)
    | ~ equalish(X1,X2)
    | ~ equalish(X2,X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.8EXbTgkiaf/E---3.1_16188.p',transitivity) ).

cnf(adding_zero,axiom,
    equalish(add(X1,n0),X1),
    file('/export/starexec/sandbox2/tmp/tmp.8EXbTgkiaf/E---3.1_16188.p',adding_zero) ).

cnf(commutativity_of_plus,axiom,
    equalish(add(X1,X2),add(X2,X1)),
    file('/export/starexec/sandbox2/tmp/tmp.8EXbTgkiaf/E---3.1_16188.p',commutativity_of_plus) ).

cnf(symmetry,axiom,
    ( equalish(X2,X1)
    | ~ equalish(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.8EXbTgkiaf/E---3.1_16188.p',symmetry) ).

cnf(plus_substitution,axiom,
    ( equalish(X1,X3)
    | ~ equalish(add(X1,X2),add(X3,X2)) ),
    file('/export/starexec/sandbox2/tmp/tmp.8EXbTgkiaf/E---3.1_16188.p',plus_substitution) ).

cnf(less_lemma,axiom,
    ( equalish(add(successor(predecessor_of_1st_minus_2nd(X2,X1)),X1),X2)
    | ~ less(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.8EXbTgkiaf/E---3.1_16188.p',less_lemma) ).

cnf(prove_a_contradiction,negated_conjecture,
    ~ equalish(successor(X1),n0),
    file('/export/starexec/sandbox2/tmp/tmp.8EXbTgkiaf/E---3.1_16188.p',prove_a_contradiction) ).

cnf(impossible_a_is_less_than_itself,hypothesis,
    less(a,a),
    file('/export/starexec/sandbox2/tmp/tmp.8EXbTgkiaf/E---3.1_16188.p',impossible_a_is_less_than_itself) ).

cnf(c_0_8,axiom,
    ( equalish(X1,X3)
    | ~ equalish(X1,X2)
    | ~ equalish(X2,X3) ),
    transitivity ).

cnf(c_0_9,axiom,
    equalish(add(X1,n0),X1),
    adding_zero ).

cnf(c_0_10,plain,
    ( equalish(X1,X2)
    | ~ equalish(X1,add(X2,n0)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_11,axiom,
    equalish(add(X1,X2),add(X2,X1)),
    commutativity_of_plus ).

cnf(c_0_12,axiom,
    ( equalish(X2,X1)
    | ~ equalish(X1,X2) ),
    symmetry ).

cnf(c_0_13,plain,
    equalish(add(n0,X1),X1),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,plain,
    equalish(X1,add(n0,X1)),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_15,axiom,
    ( equalish(X1,X3)
    | ~ equalish(add(X1,X2),add(X3,X2)) ),
    plus_substitution ).

cnf(c_0_16,plain,
    ( equalish(X1,add(n0,X2))
    | ~ equalish(X1,X2) ),
    inference(spm,[status(thm)],[c_0_8,c_0_14]) ).

cnf(c_0_17,plain,
    ( equalish(X1,n0)
    | ~ equalish(add(X1,X2),X2) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_18,axiom,
    ( equalish(add(successor(predecessor_of_1st_minus_2nd(X2,X1)),X1),X2)
    | ~ less(X1,X2) ),
    less_lemma ).

cnf(c_0_19,negated_conjecture,
    ~ equalish(successor(X1),n0),
    prove_a_contradiction ).

cnf(c_0_20,hypothesis,
    less(a,a),
    impossible_a_is_less_than_itself ).

cnf(c_0_21,plain,
    ~ less(X1,X1),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

cnf(c_0_22,hypothesis,
    $false,
    inference(sr,[status(thm)],[c_0_20,c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : NUM024-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.11/0.12  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n013.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 2400
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Mon Oct  2 13:54:59 EDT 2023
% 0.11/0.32  % CPUTime    : 
% 0.16/0.43  Running first-order theorem proving
% 0.16/0.43  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.8EXbTgkiaf/E---3.1_16188.p
% 0.16/0.45  # Version: 3.1pre001
% 0.16/0.45  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45  # Starting sh5l with 300s (1) cores
% 0.16/0.45  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16269 completed with status 0
% 0.16/0.45  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.45  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45  # No SInE strategy applied
% 0.16/0.45  # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.16/0.45  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45  # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.16/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.45  # Starting new_bool_3 with 136s (1) cores
% 0.16/0.45  # Starting new_bool_1 with 136s (1) cores
% 0.16/0.45  # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 0.16/0.45  # C12_02_nc_SAT001_MinMin_p005000_rr with pid 16280 completed with status 0
% 0.16/0.45  # Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 0.16/0.45  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45  # No SInE strategy applied
% 0.16/0.45  # Search class: FHUNM-FFSF21-MFFFFFNN
% 0.16/0.45  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.45  # Starting G----_Z1410__C12_02_nc_F1_AE_CS_SP_S2S with 811s (1) cores
% 0.16/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.45  # Starting new_bool_3 with 136s (1) cores
% 0.16/0.45  # Starting new_bool_1 with 136s (1) cores
% 0.16/0.45  # Starting C12_02_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 0.16/0.45  # Preprocessing time       : 0.001 s
% 0.16/0.45  # Presaturation interreduction done
% 0.16/0.45  
% 0.16/0.45  # Proof found!
% 0.16/0.45  # SZS status Unsatisfiable
% 0.16/0.45  # SZS output start CNFRefutation
% See solution above
% 0.16/0.45  # Parsed axioms                        : 16
% 0.16/0.45  # Removed by relevancy pruning/SinE    : 0
% 0.16/0.45  # Initial clauses                      : 16
% 0.16/0.45  # Removed in clause preprocessing      : 0
% 0.16/0.45  # Initial clauses in saturation        : 16
% 0.16/0.45  # Processed clauses                    : 152
% 0.16/0.45  # ...of these trivial                  : 20
% 0.16/0.45  # ...subsumed                          : 9
% 0.16/0.45  # ...remaining for further processing  : 123
% 0.16/0.45  # Other redundant clauses eliminated   : 0
% 0.16/0.45  # Clauses deleted for lack of memory   : 0
% 0.16/0.45  # Backward-subsumed                    : 0
% 0.16/0.45  # Backward-rewritten                   : 0
% 0.16/0.45  # Generated clauses                    : 710
% 0.16/0.45  # ...of the previous two non-redundant : 544
% 0.16/0.45  # ...aggressively subsumed             : 0
% 0.16/0.45  # Contextual simplify-reflections      : 0
% 0.16/0.45  # Paramodulations                      : 709
% 0.16/0.45  # Factorizations                       : 0
% 0.16/0.45  # NegExts                              : 0
% 0.16/0.45  # Equation resolutions                 : 0
% 0.16/0.45  # Total rewrite steps                  : 182
% 0.16/0.45  # Propositional unsat checks           : 0
% 0.16/0.45  #    Propositional check models        : 0
% 0.16/0.45  #    Propositional check unsatisfiable : 0
% 0.16/0.45  #    Propositional clauses             : 0
% 0.16/0.45  #    Propositional clauses after purity: 0
% 0.16/0.45  #    Propositional unsat core size     : 0
% 0.16/0.45  #    Propositional preprocessing time  : 0.000
% 0.16/0.45  #    Propositional encoding time       : 0.000
% 0.16/0.45  #    Propositional solver time         : 0.000
% 0.16/0.45  #    Success case prop preproc time    : 0.000
% 0.16/0.45  #    Success case prop encoding time   : 0.000
% 0.16/0.45  #    Success case prop solver time     : 0.000
% 0.16/0.45  # Current number of processed clauses  : 106
% 0.16/0.45  #    Positive orientable unit clauses  : 50
% 0.16/0.45  #    Positive unorientable unit clauses: 0
% 0.16/0.45  #    Negative unit clauses             : 7
% 0.16/0.45  #    Non-unit-clauses                  : 49
% 0.16/0.45  # Current number of unprocessed clauses: 424
% 0.16/0.45  # ...number of literals in the above   : 725
% 0.16/0.45  # Current number of archived formulas  : 0
% 0.16/0.45  # Current number of archived clauses   : 17
% 0.16/0.45  # Clause-clause subsumption calls (NU) : 249
% 0.16/0.45  # Rec. Clause-clause subsumption calls : 248
% 0.16/0.45  # Non-unit clause-clause subsumptions  : 9
% 0.16/0.45  # Unit Clause-clause subsumption calls : 19
% 0.16/0.45  # Rewrite failures with RHS unbound    : 0
% 0.16/0.45  # BW rewrite match attempts            : 85
% 0.16/0.45  # BW rewrite match successes           : 0
% 0.16/0.45  # Condensation attempts                : 0
% 0.16/0.45  # Condensation successes               : 0
% 0.16/0.45  # Termbank termtop insertions          : 8977
% 0.16/0.45  
% 0.16/0.45  # -------------------------------------------------
% 0.16/0.45  # User time                : 0.009 s
% 0.16/0.45  # System time              : 0.001 s
% 0.16/0.45  # Total time               : 0.010 s
% 0.16/0.45  # Maximum resident set size: 1652 pages
% 0.16/0.45  
% 0.16/0.45  # -------------------------------------------------
% 0.16/0.45  # User time                : 0.045 s
% 0.16/0.45  # System time              : 0.005 s
% 0.16/0.45  # Total time               : 0.051 s
% 0.16/0.45  # Maximum resident set size: 1684 pages
% 0.16/0.45  % E---3.1 exiting
% 0.16/0.45  % E---3.1 exiting
%------------------------------------------------------------------------------