TSTP Solution File: FLD014-3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD014-3 : TPTP v8.1.2. Bugfixed v2.1.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 17:29:56 EDT 2023
% Result : Timeout 1.63s 300.11s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 35 ( 15 unt; 0 nHn; 35 RR)
% Number of literals : 73 ( 0 equ; 41 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 57 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_addition_1,axiom,
( sum(X1,X2,X3)
| ~ sum(X1,X4,X5)
| ~ sum(X4,X6,X2)
| ~ sum(X5,X6,X3) ),
file('/export/starexec/sandbox/tmp/tmp.qPJoNJB3Xm/E---3.1_25598.p',associativity_addition_1) ).
cnf(existence_of_identity_addition,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.qPJoNJB3Xm/E---3.1_25598.p',existence_of_identity_addition) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox/tmp/tmp.qPJoNJB3Xm/E---3.1_25598.p',well_definedness_of_additive_identity) ).
cnf(commutativity_addition,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.qPJoNJB3Xm/E---3.1_25598.p',commutativity_addition) ).
cnf(sum_3,negated_conjecture,
sum(additive_identity,a,b),
file('/export/starexec/sandbox/tmp/tmp.qPJoNJB3Xm/E---3.1_25598.p',sum_3) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.qPJoNJB3Xm/E---3.1_25598.p',a_is_defined) ).
cnf(existence_of_inverse_addition,axiom,
( sum(additive_inverse(X1),X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.qPJoNJB3Xm/E---3.1_25598.p',existence_of_inverse_addition) ).
cnf(associativity_addition_2,axiom,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X6,X3) ),
file('/export/starexec/sandbox/tmp/tmp.qPJoNJB3Xm/E---3.1_25598.p',associativity_addition_2) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/tmp/tmp.qPJoNJB3Xm/E---3.1_25598.p',b_is_defined) ).
cnf(not_sum_4,negated_conjecture,
~ sum(additive_identity,additive_inverse(a),additive_inverse(b)),
file('/export/starexec/sandbox/tmp/tmp.qPJoNJB3Xm/E---3.1_25598.p',not_sum_4) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.qPJoNJB3Xm/E---3.1_25598.p',well_definedness_of_additive_inverse) ).
cnf(c_0_11,axiom,
( sum(X1,X2,X3)
| ~ sum(X1,X4,X5)
| ~ sum(X4,X6,X2)
| ~ sum(X5,X6,X3) ),
associativity_addition_1 ).
cnf(c_0_12,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
existence_of_identity_addition ).
cnf(c_0_13,plain,
( sum(X1,X2,X3)
| ~ defined(X3)
| ~ sum(X1,X4,additive_identity)
| ~ sum(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_15,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
commutativity_addition ).
cnf(c_0_16,plain,
( sum(additive_identity,X1,X2)
| ~ defined(X2)
| ~ sum(additive_identity,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_12]),c_0_14])]) ).
cnf(c_0_17,negated_conjecture,
sum(additive_identity,a,b),
sum_3 ).
cnf(c_0_18,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_19,axiom,
( sum(additive_inverse(X1),X1,additive_identity)
| ~ defined(X1) ),
existence_of_inverse_addition ).
cnf(c_0_20,plain,
( sum(X1,additive_identity,X1)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_21,negated_conjecture,
sum(additive_identity,b,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_22,axiom,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X6,X3) ),
associativity_addition_2 ).
cnf(c_0_23,plain,
( sum(X1,additive_inverse(X1),additive_identity)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_24,plain,
( sum(X1,X2,X3)
| ~ defined(X3)
| ~ sum(X4,additive_identity,X2)
| ~ sum(X1,X4,X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
sum(b,additive_identity,a),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_26,plain,
( sum(X1,additive_inverse(X2),X3)
| ~ defined(X2)
| ~ sum(X4,additive_identity,X3)
| ~ sum(X4,X2,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( sum(X1,a,X2)
| ~ defined(X2)
| ~ sum(X1,b,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_29,negated_conjecture,
~ sum(additive_identity,additive_inverse(a),additive_inverse(b)),
not_sum_4 ).
cnf(c_0_30,plain,
( sum(X1,additive_inverse(X2),X3)
| ~ defined(X2)
| ~ defined(X3)
| ~ sum(X3,X2,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_31,negated_conjecture,
sum(additive_inverse(b),a,additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_19]),c_0_14]),c_0_28])]) ).
cnf(c_0_32,negated_conjecture,
~ defined(additive_inverse(b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_18]),c_0_31])]) ).
cnf(c_0_33,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
well_definedness_of_additive_inverse ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.15 % Problem : FLD014-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.10/0.16 % Command : run_E %s %d THM
% 0.15/0.38 % Computer : n002.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 2400
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Mon Oct 2 23:26:29 EDT 2023
% 0.15/0.38 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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.qPJoNJB3Xm/E---3.1_25598.p
% 1.63/300.11 # Version: 3.1pre001
% 1.63/300.11 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.63/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.63/300.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.63/300.11 # Starting new_bool_3 with 300s (1) cores
% 1.63/300.11 # Starting new_bool_1 with 300s (1) cores
% 1.63/300.11 # Starting sh5l with 300s (1) cores
% 1.63/300.11 # new_bool_3 with pid 25685 completed with status 0
% 1.63/300.11 # Result found by new_bool_3
% 1.63/300.11 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.63/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.63/300.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.63/300.11 # Starting new_bool_3 with 300s (1) cores
% 1.63/300.11 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.63/300.11 # Search class: FHUNF-FFSS11-SFFFFFNN
% 1.63/300.11 # partial match(1): FHUNF-FFSF11-SFFFFFNN
% 1.63/300.11 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.63/300.11 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.63/300.11 # SAT001_MinMin_p005000_rr_RG with pid 25695 completed with status 0
% 1.63/300.11 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.63/300.11 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.63/300.11 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.63/300.11 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.63/300.11 # Starting new_bool_3 with 300s (1) cores
% 1.63/300.11 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.63/300.11 # Search class: FHUNF-FFSS11-SFFFFFNN
% 1.63/300.11 # partial match(1): FHUNF-FFSF11-SFFFFFNN
% 1.63/300.11 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.63/300.11 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.63/300.11 # Preprocessing time : 0.001 s
% 1.63/300.11 # Presaturation interreduction done
% 1.63/300.11
% 1.63/300.11 # Proof found!
% 1.63/300.11 # SZS status Unsatisfiable
% 1.63/300.11 # SZS output start CNFRefutation
% See solution above
% 1.63/300.11 # Parsed axioms : 30
% 1.63/300.11 # Removed by relevancy pruning/SinE : 19
% 1.63/300.11 # Initial clauses : 11
% 1.63/300.11 # Removed in clause preprocessing : 0
% 1.63/300.11 # Initial clauses in saturation : 11
% 1.63/300.11 # Processed clauses : 2043
% 1.63/300.11 # ...of these trivial : 8
% 1.63/300.11 # ...subsumed : 1537
% 1.63/300.11 # ...remaining for further processing : 498
% 1.63/300.11 # Other redundant clauses eliminated : 0
% 1.63/300.11 # Clauses deleted for lack of memory : 0
% 1.63/300.11 # Backward-subsumed : 34
% 1.63/300.11 # Backward-rewritten : 0
% 1.63/300.11 # Generated clauses : 8202
% 1.63/300.11 # ...of the previous two non-redundant : 6887
% 1.63/300.11 # ...aggressively subsumed : 0
% 1.63/300.11 # Contextual simplify-reflections : 11
% 1.63/300.11 # Paramodulations : 8202
% 1.63/300.11 # Factorizations : 0
% 1.63/300.11 # NegExts : 0
% 1.63/300.11 # Equation resolutions : 0
% 1.63/300.11 # Total rewrite steps : 4726
% 1.63/300.11 # Propositional unsat checks : 0
% 1.63/300.11 # Propositional check models : 0
% 1.63/300.11 # Propositional check unsatisfiable : 0
% 1.63/300.11 # Propositional clauses : 0
% 1.63/300.11 # Propositional clauses after purity: 0
% 1.63/300.11 # Propositional unsat core size : 0
% 1.63/300.11 # Propositional preprocessing time : 0.000
% 1.63/300.11 # Propositional encoding time : 0.000
% 1.63/300.11 # Propositional solver time : 0.000
% 1.63/300.11 # Success case prop preproc time : 0.000
% 1.63/300.11 # Success case prop encoding time : 0.000
% 1.63/300.11 # Success case prop solver time : 0.000
% 1.63/300.11 # Current number of processed clauses : 453
% 1.63/300.11 # Positive orientable unit clauses : 30
% 1.63/300.11 # Positive unorientable unit clauses: 0
% 1.63/300.11 # Negative unit clauses : 2
% 1.63/300.11 # Non-unit-clauses : 421
% 1.63/300.11 # Current number of unprocessed clauses: 4787
% 1.63/300.11 # ...number of literals in the above : 17635
% 1.63/300.11 # Current number of archived formulas : 0
% 1.63/300.11 # Current number of archived clauses : 45
% 1.63/300.11 # Clause-clause subsumption calls (NU) : 17584
% 1.63/300.11 # Rec. Clause-clause subsumption calls : 16825
% 1.63/300.11 # Non-unit clause-clause subsumptions : 1575
% 1.63/300.11 # Unit Clause-clause subsumption calls : 93
% 1.63/300.11 # Rewrite failures with RHS unbound : 0
% 1.63/300.11 # BW rewrite match attempts : 17
% 1.63/300.11 # BW rewrite match successes : 6
% 1.63/300.11 # Condensation attempts : 0
% 1.63/300.11 # Condensation successes : 0
% 1.63/300.11 # Termbank termtop insertions : 99631
% 1.63/300.11
% 1.63/300.11 # -------------------------------------------------
% 1.63/300.11 # User time : 0.110 s
% 1.63/300.11 # System time : 0.003 s
% 1.63/300.11 # Total time : 0.113 s
% 1.63/300.11 # Maximum resident set size: 1636 pages
% 1.63/300.11
% 1.63/300.11 # -------------------------------------------------
% 1.63/300.11 # User time : 0.112 s
% 1.63/300.11 # System time : 0.004 s
% 1.63/300.11 # Total time : 0.117 s
% 1.63/300.11 # Maximum resident set size: 1700 pages
% 1.63/300.11 % E---3.1 exiting
% 1.63/300.11 % E---3.1 exiting
%------------------------------------------------------------------------------