TSTP Solution File: NUM020-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM020-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:47 EDT 2023
% Result : Timeout 408.37s 300.16s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 10 unt; 0 nHn; 11 RR)
% Number of literals : 28 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(symmetry,axiom,
( equalish(X2,X1)
| ~ equalish(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.Ue7ZDsuvzo/E---3.1_17541.p',symmetry) ).
cnf(successor_substitution,axiom,
( equalish(successor(X1),successor(X2))
| ~ equalish(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.Ue7ZDsuvzo/E---3.1_17541.p',successor_substitution) ).
cnf(adding_zero,axiom,
equalish(add(X1,n0),X1),
file('/export/starexec/sandbox/tmp/tmp.Ue7ZDsuvzo/E---3.1_17541.p',adding_zero) ).
cnf(transitivity,axiom,
( equalish(X1,X3)
| ~ equalish(X1,X2)
| ~ equalish(X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.Ue7ZDsuvzo/E---3.1_17541.p',transitivity) ).
cnf(addition,axiom,
equalish(add(X1,successor(X2)),successor(add(X1,X2))),
file('/export/starexec/sandbox/tmp/tmp.Ue7ZDsuvzo/E---3.1_17541.p',addition) ).
cnf(deny_addition_lemma,negated_conjecture,
~ equalish(add(a,successor(n0)),successor(a)),
file('/export/starexec/sandbox/tmp/tmp.Ue7ZDsuvzo/E---3.1_17541.p',deny_addition_lemma) ).
cnf(c_0_6,axiom,
( equalish(X2,X1)
| ~ equalish(X1,X2) ),
symmetry ).
cnf(c_0_7,axiom,
( equalish(successor(X1),successor(X2))
| ~ equalish(X1,X2) ),
successor_substitution ).
cnf(c_0_8,axiom,
equalish(add(X1,n0),X1),
adding_zero ).
cnf(c_0_9,plain,
( equalish(successor(X1),successor(X2))
| ~ equalish(X2,X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
equalish(X1,add(X1,n0)),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_11,axiom,
( equalish(X1,X3)
| ~ equalish(X1,X2)
| ~ equalish(X2,X3) ),
transitivity ).
cnf(c_0_12,plain,
equalish(successor(add(X1,n0)),successor(X1)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( equalish(X1,successor(X2))
| ~ equalish(X1,successor(add(X2,n0))) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
equalish(add(X1,successor(X2)),successor(add(X1,X2))),
addition ).
cnf(c_0_15,negated_conjecture,
~ equalish(add(a,successor(n0)),successor(a)),
deny_addition_lemma ).
cnf(c_0_16,plain,
equalish(add(X1,successor(n0)),successor(X1)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : NUM020-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 15:10:59 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.Ue7ZDsuvzo/E---3.1_17541.p
% 408.37/300.16 # Version: 3.1pre001
% 408.37/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.37/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.37/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.37/300.16 # Starting new_bool_3 with 300s (1) cores
% 408.37/300.16 # Starting new_bool_1 with 300s (1) cores
% 408.37/300.16 # Starting sh5l with 300s (1) cores
% 408.37/300.16 # new_bool_3 with pid 17703 completed with status 0
% 408.37/300.16 # Result found by new_bool_3
% 408.37/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.37/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.37/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.37/300.16 # Starting new_bool_3 with 300s (1) cores
% 408.37/300.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.37/300.16 # Search class: FHUNS-FFSF21-SFFFFFNN
% 408.37/300.16 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.37/300.16 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 408.37/300.16 # G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with pid 17707 completed with status 0
% 408.37/300.16 # Result found by G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN
% 408.37/300.16 # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.37/300.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.37/300.16 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.37/300.16 # Starting new_bool_3 with 300s (1) cores
% 408.37/300.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.37/300.16 # Search class: FHUNS-FFSF21-SFFFFFNN
% 408.37/300.16 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.37/300.16 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 408.37/300.16 # Preprocessing time : 0.001 s
% 408.37/300.16 # Presaturation interreduction done
% 408.37/300.16
% 408.37/300.16 # Proof found!
% 408.37/300.16 # SZS status Unsatisfiable
% 408.37/300.16 # SZS output start CNFRefutation
% See solution above
% 408.37/300.16 # Parsed axioms : 12
% 408.37/300.16 # Removed by relevancy pruning/SinE : 3
% 408.37/300.16 # Initial clauses : 9
% 408.37/300.16 # Removed in clause preprocessing : 0
% 408.37/300.16 # Initial clauses in saturation : 9
% 408.37/300.16 # Processed clauses : 78
% 408.37/300.16 # ...of these trivial : 6
% 408.37/300.16 # ...subsumed : 16
% 408.37/300.16 # ...remaining for further processing : 56
% 408.37/300.16 # Other redundant clauses eliminated : 0
% 408.37/300.16 # Clauses deleted for lack of memory : 0
% 408.37/300.16 # Backward-subsumed : 0
% 408.37/300.16 # Backward-rewritten : 1
% 408.37/300.16 # Generated clauses : 347
% 408.37/300.16 # ...of the previous two non-redundant : 283
% 408.37/300.16 # ...aggressively subsumed : 0
% 408.37/300.16 # Contextual simplify-reflections : 0
% 408.37/300.16 # Paramodulations : 347
% 408.37/300.16 # Factorizations : 0
% 408.37/300.16 # NegExts : 0
% 408.37/300.16 # Equation resolutions : 0
% 408.37/300.16 # Total rewrite steps : 56
% 408.37/300.16 # Propositional unsat checks : 0
% 408.37/300.16 # Propositional check models : 0
% 408.37/300.16 # Propositional check unsatisfiable : 0
% 408.37/300.16 # Propositional clauses : 0
% 408.37/300.16 # Propositional clauses after purity: 0
% 408.37/300.16 # Propositional unsat core size : 0
% 408.37/300.16 # Propositional preprocessing time : 0.000
% 408.37/300.16 # Propositional encoding time : 0.000
% 408.37/300.16 # Propositional solver time : 0.000
% 408.37/300.16 # Success case prop preproc time : 0.000
% 408.37/300.16 # Success case prop encoding time : 0.000
% 408.37/300.16 # Success case prop solver time : 0.000
% 408.37/300.16 # Current number of processed clauses : 46
% 408.37/300.16 # Positive orientable unit clauses : 22
% 408.37/300.16 # Positive unorientable unit clauses: 0
% 408.37/300.16 # Negative unit clauses : 1
% 408.37/300.16 # Non-unit-clauses : 23
% 408.37/300.16 # Current number of unprocessed clauses: 223
% 408.37/300.16 # ...number of literals in the above : 422
% 408.37/300.16 # Current number of archived formulas : 0
% 408.37/300.16 # Current number of archived clauses : 10
% 408.37/300.16 # Clause-clause subsumption calls (NU) : 158
% 408.37/300.16 # Rec. Clause-clause subsumption calls : 158
% 408.37/300.16 # Non-unit clause-clause subsumptions : 16
% 408.37/300.16 # Unit Clause-clause subsumption calls : 2
% 408.37/300.16 # Rewrite failures with RHS unbound : 0
% 408.37/300.16 # BW rewrite match attempts : 27
% 408.37/300.16 # BW rewrite match successes : 1
% 408.37/300.16 # Condensation attempts : 0
% 408.37/300.16 # Condensation successes : 0
% 408.37/300.16 # Termbank termtop insertions : 4534
% 408.37/300.16
% 408.37/300.16 # -------------------------------------------------
% 408.37/300.16 # User time : 0.009 s
% 408.37/300.16 # System time : 0.000 s
% 408.37/300.16 # Total time : 0.009 s
% 408.37/300.16 # Maximum resident set size: 1644 pages
% 408.37/300.16
% 408.37/300.16 # -------------------------------------------------
% 408.37/300.16 # User time : 0.011 s
% 408.37/300.16 # System time : 0.001 s
% 408.37/300.16 # Total time : 0.012 s
% 408.37/300.16 # Maximum resident set size: 1680 pages
% 408.37/300.16 % E---3.1 exiting
% 408.37/300.16 % E---3.1 exiting
%------------------------------------------------------------------------------