TSTP Solution File: NUM004-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM004-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:58:10 EDT 2023
% Result : Timeout 0.32s 300.13s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of clauses : 42 ( 21 unt; 0 nHn; 24 RR)
% Number of literals : 72 ( 0 equ; 35 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 103 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity,axiom,
( equalish(X1,X3)
| ~ equalish(X1,X2)
| ~ equalish(X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.SclDy4jegS/E---3.1_23798.p',transitivity) ).
cnf(addition_inverts_subtraction1,axiom,
equalish(subtract(add(X1,X2),X2),X1),
file('/export/starexec/sandbox2/tmp/tmp.SclDy4jegS/E---3.1_23798.p',addition_inverts_subtraction1) ).
cnf(commutativity1,axiom,
equalish(add(subtract(X1,X2),X3),subtract(add(X1,X3),X2)),
file('/export/starexec/sandbox2/tmp/tmp.SclDy4jegS/E---3.1_23798.p',commutativity1) ).
cnf(subtract_substitution1,axiom,
( equalish(X3,subtract(X2,X4))
| ~ equalish(X1,X2)
| ~ equalish(X3,subtract(X1,X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.SclDy4jegS/E---3.1_23798.p',subtract_substitution1) ).
cnf(addition_inverts_subtraction2,axiom,
equalish(X1,subtract(add(X1,X2),X2)),
file('/export/starexec/sandbox2/tmp/tmp.SclDy4jegS/E---3.1_23798.p',addition_inverts_subtraction2) ).
cnf(subtract_substitution2,axiom,
( equalish(X3,subtract(X4,X2))
| ~ equalish(X1,X2)
| ~ equalish(X3,subtract(X4,X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.SclDy4jegS/E---3.1_23798.p',subtract_substitution2) ).
cnf(commutativity_of_addition,axiom,
equalish(add(X1,X2),add(X2,X1)),
file('/export/starexec/sandbox2/tmp/tmp.SclDy4jegS/E---3.1_23798.p',commutativity_of_addition) ).
cnf(reflexivity,axiom,
equalish(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.SclDy4jegS/E---3.1_23798.p',reflexivity) ).
cnf(prove_equation,negated_conjecture,
~ equalish(subtract(add(a,b),c),add(a,subtract(b,c))),
file('/export/starexec/sandbox2/tmp/tmp.SclDy4jegS/E---3.1_23798.p',prove_equation) ).
cnf(associativity_of_addition,axiom,
equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)),
file('/export/starexec/sandbox2/tmp/tmp.SclDy4jegS/E---3.1_23798.p',associativity_of_addition) ).
cnf(add_substitution2,axiom,
( equalish(X3,add(X4,X2))
| ~ equalish(X1,X2)
| ~ equalish(X3,add(X4,X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.SclDy4jegS/E---3.1_23798.p',add_substitution2) ).
cnf(c_0_11,axiom,
( equalish(X1,X3)
| ~ equalish(X1,X2)
| ~ equalish(X2,X3) ),
transitivity ).
cnf(c_0_12,axiom,
equalish(subtract(add(X1,X2),X2),X1),
addition_inverts_subtraction1 ).
cnf(c_0_13,plain,
( equalish(X1,X2)
| ~ equalish(X1,subtract(add(X2,X3),X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
equalish(add(subtract(X1,X2),X3),subtract(add(X1,X3),X2)),
commutativity1 ).
cnf(c_0_15,axiom,
( equalish(X3,subtract(X2,X4))
| ~ equalish(X1,X2)
| ~ equalish(X3,subtract(X1,X4)) ),
subtract_substitution1 ).
cnf(c_0_16,axiom,
equalish(X1,subtract(add(X1,X2),X2)),
addition_inverts_subtraction2 ).
cnf(c_0_17,plain,
equalish(add(subtract(X1,X2),X2),X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,axiom,
( equalish(X3,subtract(X4,X2))
| ~ equalish(X1,X2)
| ~ equalish(X3,subtract(X4,X1)) ),
subtract_substitution2 ).
cnf(c_0_19,plain,
( equalish(X1,subtract(X2,X3))
| ~ equalish(add(X1,X3),X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( equalish(X1,X2)
| ~ equalish(X1,add(subtract(X2,X3),X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_21,axiom,
equalish(add(X1,X2),add(X2,X1)),
commutativity_of_addition ).
cnf(c_0_22,axiom,
equalish(X1,X1),
reflexivity ).
cnf(c_0_23,plain,
( equalish(X1,subtract(X2,X3))
| ~ equalish(add(X1,X4),X2)
| ~ equalish(X4,X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
equalish(add(X1,subtract(X2,X1)),X2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( equalish(subtract(X1,X2),subtract(X3,X2))
| ~ equalish(X1,X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_26,plain,
( equalish(X1,subtract(X2,X3))
| ~ equalish(subtract(X2,X1),X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( equalish(subtract(X1,X2),X3)
| ~ equalish(X1,add(X3,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
~ equalish(subtract(add(a,b),c),add(a,subtract(b,c))),
prove_equation ).
cnf(c_0_29,axiom,
equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)),
associativity_of_addition ).
cnf(c_0_30,plain,
( equalish(X1,subtract(X2,X3))
| ~ equalish(X2,add(X3,X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,axiom,
( equalish(X3,add(X4,X2))
| ~ equalish(X1,X2)
| ~ equalish(X3,add(X4,X1)) ),
add_substitution2 ).
cnf(c_0_32,negated_conjecture,
~ equalish(add(a,b),add(add(a,subtract(b,c)),c)),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_33,plain,
( equalish(X1,add(add(X2,X3),X4))
| ~ equalish(X1,add(X2,add(X3,X4))) ),
inference(spm,[status(thm)],[c_0_11,c_0_29]) ).
cnf(c_0_34,plain,
( equalish(X1,X2)
| ~ equalish(add(X2,X3),add(X3,X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_30]) ).
cnf(c_0_35,plain,
( equalish(add(X1,add(X2,X3)),add(add(X1,X2),X4))
| ~ equalish(X3,X4) ),
inference(spm,[status(thm)],[c_0_31,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
~ equalish(add(a,b),add(a,add(subtract(b,c),c))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
( equalish(add(X1,X2),add(X1,X3))
| ~ equalish(X2,X3) ),
inference(spm,[status(thm)],[c_0_31,c_0_22]) ).
cnf(c_0_38,plain,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
~ equalish(b,add(subtract(b,c),c)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
equalish(X1,add(subtract(X1,X2),X2)),
inference(spm,[status(thm)],[c_0_38,c_0_17]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : NUM004-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n012.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 13:39:20 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.SclDy4jegS/E---3.1_23798.p
% 0.32/300.13 # Version: 3.1pre001
% 0.32/300.13 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.32/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/300.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.32/300.13 # Starting new_bool_3 with 300s (1) cores
% 0.32/300.13 # Starting new_bool_1 with 300s (1) cores
% 0.32/300.13 # Starting sh5l with 300s (1) cores
% 0.32/300.13 # new_bool_3 with pid 23893 completed with status 0
% 0.32/300.13 # Result found by new_bool_3
% 0.32/300.13 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.32/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/300.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.32/300.13 # Starting new_bool_3 with 300s (1) cores
% 0.32/300.13 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.32/300.13 # Search class: FHUNM-FFSF22-SFFFFFNN
% 0.32/300.13 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.32/300.13 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.32/300.13 # SAT001_MinMin_p005000_rr_RG with pid 23897 completed with status 0
% 0.32/300.13 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.32/300.13 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.32/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/300.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.32/300.13 # Starting new_bool_3 with 300s (1) cores
% 0.32/300.13 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.32/300.13 # Search class: FHUNM-FFSF22-SFFFFFNN
% 0.32/300.13 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.32/300.13 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.32/300.13 # Preprocessing time : 0.001 s
% 0.32/300.13 # Presaturation interreduction done
% 0.32/300.13
% 0.32/300.13 # Proof found!
% 0.32/300.13 # SZS status Unsatisfiable
% 0.32/300.13 # SZS output start CNFRefutation
% See solution above
% 0.32/300.13 # Parsed axioms : 13
% 0.32/300.13 # Removed by relevancy pruning/SinE : 0
% 0.32/300.13 # Initial clauses : 13
% 0.32/300.13 # Removed in clause preprocessing : 0
% 0.32/300.13 # Initial clauses in saturation : 13
% 0.32/300.13 # Processed clauses : 106
% 0.32/300.13 # ...of these trivial : 0
% 0.32/300.13 # ...subsumed : 22
% 0.32/300.13 # ...remaining for further processing : 84
% 0.32/300.13 # Other redundant clauses eliminated : 0
% 0.32/300.13 # Clauses deleted for lack of memory : 0
% 0.32/300.13 # Backward-subsumed : 0
% 0.32/300.13 # Backward-rewritten : 1
% 0.32/300.13 # Generated clauses : 747
% 0.32/300.13 # ...of the previous two non-redundant : 659
% 0.32/300.13 # ...aggressively subsumed : 0
% 0.32/300.13 # Contextual simplify-reflections : 0
% 0.32/300.13 # Paramodulations : 747
% 0.32/300.13 # Factorizations : 0
% 0.32/300.13 # NegExts : 0
% 0.32/300.13 # Equation resolutions : 0
% 0.32/300.13 # Total rewrite steps : 53
% 0.32/300.13 # Propositional unsat checks : 0
% 0.32/300.13 # Propositional check models : 0
% 0.32/300.13 # Propositional check unsatisfiable : 0
% 0.32/300.13 # Propositional clauses : 0
% 0.32/300.13 # Propositional clauses after purity: 0
% 0.32/300.13 # Propositional unsat core size : 0
% 0.32/300.13 # Propositional preprocessing time : 0.000
% 0.32/300.13 # Propositional encoding time : 0.000
% 0.32/300.13 # Propositional solver time : 0.000
% 0.32/300.13 # Success case prop preproc time : 0.000
% 0.32/300.13 # Success case prop encoding time : 0.000
% 0.32/300.13 # Success case prop solver time : 0.000
% 0.32/300.13 # Current number of processed clauses : 70
% 0.32/300.13 # Positive orientable unit clauses : 12
% 0.32/300.13 # Positive unorientable unit clauses: 0
% 0.32/300.13 # Negative unit clauses : 3
% 0.32/300.13 # Non-unit-clauses : 55
% 0.32/300.13 # Current number of unprocessed clauses: 579
% 0.32/300.13 # ...number of literals in the above : 1371
% 0.32/300.13 # Current number of archived formulas : 0
% 0.32/300.13 # Current number of archived clauses : 14
% 0.32/300.13 # Clause-clause subsumption calls (NU) : 459
% 0.32/300.13 # Rec. Clause-clause subsumption calls : 459
% 0.32/300.13 # Non-unit clause-clause subsumptions : 22
% 0.32/300.13 # Unit Clause-clause subsumption calls : 19
% 0.32/300.13 # Rewrite failures with RHS unbound : 0
% 0.32/300.13 # BW rewrite match attempts : 10
% 0.32/300.13 # BW rewrite match successes : 1
% 0.32/300.13 # Condensation attempts : 0
% 0.32/300.13 # Condensation successes : 0
% 0.32/300.13 # Termbank termtop insertions : 7911
% 0.32/300.13
% 0.32/300.13 # -------------------------------------------------
% 0.32/300.13 # User time : 0.013 s
% 0.32/300.13 # System time : 0.000 s
% 0.32/300.13 # Total time : 0.013 s
% 0.32/300.13 # Maximum resident set size: 1708 pages
% 0.32/300.13
% 0.32/300.13 # -------------------------------------------------
% 0.32/300.13 # User time : 0.013 s
% 0.32/300.13 # System time : 0.002 s
% 0.32/300.13 # Total time : 0.015 s
% 0.32/300.13 # Maximum resident set size: 1684 pages
% 0.32/300.13 % E---3.1 exiting
%------------------------------------------------------------------------------