TSTP Solution File: FLD008-4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD008-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:53 EDT 2023
% Result : Unsatisfiable 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of clauses : 52 ( 23 unt; 0 nHn; 52 RR)
% Number of literals : 98 ( 0 equ; 48 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 65 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(commutativity_addition,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.rzLfNZWn0t/E---3.1_13662.p',commutativity_addition) ).
cnf(sum_5,negated_conjecture,
sum(a,b,c),
file('/export/starexec/sandbox/tmp/tmp.rzLfNZWn0t/E---3.1_13662.p',sum_5) ).
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.rzLfNZWn0t/E---3.1_13662.p',associativity_addition_1) ).
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.rzLfNZWn0t/E---3.1_13662.p',associativity_addition_2) ).
cnf(existence_of_inverse_addition,axiom,
( sum(additive_inverse(X1),X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rzLfNZWn0t/E---3.1_13662.p',existence_of_inverse_addition) ).
cnf(sum_6,negated_conjecture,
sum(additive_inverse(a),additive_inverse(b),d),
file('/export/starexec/sandbox/tmp/tmp.rzLfNZWn0t/E---3.1_13662.p',sum_6) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.rzLfNZWn0t/E---3.1_13662.p',a_is_defined) ).
cnf(existence_of_identity_addition,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rzLfNZWn0t/E---3.1_13662.p',existence_of_identity_addition) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/tmp/tmp.rzLfNZWn0t/E---3.1_13662.p',b_is_defined) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.rzLfNZWn0t/E---3.1_13662.p',well_definedness_of_additive_inverse) ).
cnf(d_is_defined,hypothesis,
defined(d),
file('/export/starexec/sandbox/tmp/tmp.rzLfNZWn0t/E---3.1_13662.p',d_is_defined) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox/tmp/tmp.rzLfNZWn0t/E---3.1_13662.p',c_is_defined) ).
cnf(not_sum_7,negated_conjecture,
~ sum(additive_identity,additive_inverse(c),d),
file('/export/starexec/sandbox/tmp/tmp.rzLfNZWn0t/E---3.1_13662.p',not_sum_7) ).
cnf(c_0_13,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
commutativity_addition ).
cnf(c_0_14,negated_conjecture,
sum(a,b,c),
sum_5 ).
cnf(c_0_15,axiom,
( sum(X1,X2,X3)
| ~ sum(X1,X4,X5)
| ~ sum(X4,X6,X2)
| ~ sum(X5,X6,X3) ),
associativity_addition_1 ).
cnf(c_0_16,negated_conjecture,
sum(b,a,c),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( sum(X1,X2,c)
| ~ sum(X3,a,X2)
| ~ sum(X1,X3,b) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X6,X3) ),
associativity_addition_2 ).
cnf(c_0_19,axiom,
( sum(additive_inverse(X1),X1,additive_identity)
| ~ defined(X1) ),
existence_of_inverse_addition ).
cnf(c_0_20,negated_conjecture,
sum(additive_inverse(a),additive_inverse(b),d),
sum_6 ).
cnf(c_0_21,negated_conjecture,
( sum(X1,c,c)
| ~ sum(X1,b,b) ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_22,plain,
( sum(X1,X2,X3)
| ~ defined(X2)
| ~ sum(X4,additive_inverse(X2),X1)
| ~ sum(X4,additive_identity,X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
sum(additive_inverse(b),additive_inverse(a),d),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_24,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_25,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
existence_of_identity_addition ).
cnf(c_0_26,negated_conjecture,
( sum(c,X1,c)
| ~ sum(X1,b,b) ),
inference(spm,[status(thm)],[c_0_13,c_0_21]) ).
cnf(c_0_27,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_28,negated_conjecture,
( sum(d,a,X1)
| ~ sum(additive_inverse(b),additive_identity,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_29,plain,
( sum(X1,additive_identity,X1)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
sum(c,additive_identity,c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_25]),c_0_27])]) ).
cnf(c_0_31,plain,
( sum(X1,X2,additive_identity)
| ~ defined(X3)
| ~ sum(X1,X4,additive_inverse(X3))
| ~ sum(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_32,negated_conjecture,
( sum(d,a,additive_inverse(b))
| ~ defined(additive_inverse(b)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( sum(X1,X2,d)
| ~ sum(X3,additive_inverse(b),X2)
| ~ sum(X1,X3,additive_inverse(a)) ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_34,negated_conjecture,
sum(additive_identity,c,c),
inference(spm,[status(thm)],[c_0_13,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( sum(d,X1,additive_identity)
| ~ defined(additive_inverse(b))
| ~ sum(a,b,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_27])]) ).
cnf(c_0_36,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
well_definedness_of_additive_inverse ).
cnf(c_0_37,negated_conjecture,
( sum(X1,d,d)
| ~ sum(X1,additive_inverse(a),additive_inverse(a)) ),
inference(spm,[status(thm)],[c_0_33,c_0_20]) ).
cnf(c_0_38,negated_conjecture,
( sum(X1,c,X2)
| ~ sum(X3,c,X2)
| ~ sum(X3,additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( sum(d,X1,additive_identity)
| ~ sum(a,b,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_27])]) ).
cnf(c_0_40,negated_conjecture,
( sum(additive_identity,d,d)
| ~ defined(additive_inverse(a)) ),
inference(spm,[status(thm)],[c_0_37,c_0_25]) ).
cnf(c_0_41,negated_conjecture,
( sum(X1,c,additive_identity)
| ~ sum(d,additive_identity,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_14])]) ).
cnf(c_0_42,hypothesis,
defined(d),
d_is_defined ).
cnf(c_0_43,negated_conjecture,
sum(additive_identity,d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_36]),c_0_24])]) ).
cnf(c_0_44,negated_conjecture,
sum(d,c,additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_29]),c_0_42])]) ).
cnf(c_0_45,negated_conjecture,
( sum(X1,X2,d)
| ~ sum(X3,d,X2)
| ~ sum(X1,X3,additive_identity) ),
inference(spm,[status(thm)],[c_0_15,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
sum(c,d,additive_identity),
inference(spm,[status(thm)],[c_0_13,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
( sum(X1,additive_identity,d)
| ~ sum(X1,c,additive_identity) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_49,negated_conjecture,
sum(additive_inverse(c),additive_identity,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_19]),c_0_48])]) ).
cnf(c_0_50,negated_conjecture,
~ sum(additive_identity,additive_inverse(c),d),
not_sum_7 ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_49]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : FLD008-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n003.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 23:23:33 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.rzLfNZWn0t/E---3.1_13662.p
% 0.21/0.54 # Version: 3.1pre001
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # new_bool_1 with pid 13742 completed with status 0
% 0.21/0.54 # Result found by new_bool_1
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FHUNF-FFSM11-SFFFFFNN
% 0.21/0.54 # partial match(1): FHUNF-FFSF11-SFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.54 # SAT001_MinMin_p005000_rr_RG with pid 13744 completed with status 0
% 0.21/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FHUNF-FFSM11-SFFFFFNN
% 0.21/0.54 # partial match(1): FHUNF-FFSF11-SFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.54 # Preprocessing time : 0.001 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Unsatisfiable
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 33
% 0.21/0.54 # Removed by relevancy pruning/SinE : 19
% 0.21/0.54 # Initial clauses : 14
% 0.21/0.54 # Removed in clause preprocessing : 0
% 0.21/0.54 # Initial clauses in saturation : 14
% 0.21/0.54 # Processed clauses : 441
% 0.21/0.54 # ...of these trivial : 7
% 0.21/0.54 # ...subsumed : 146
% 0.21/0.54 # ...remaining for further processing : 288
% 0.21/0.54 # Other redundant clauses eliminated : 0
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 7
% 0.21/0.54 # Backward-rewritten : 1
% 0.21/0.54 # Generated clauses : 1568
% 0.21/0.54 # ...of the previous two non-redundant : 1315
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 2
% 0.21/0.54 # Paramodulations : 1568
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 0
% 0.21/0.54 # Total rewrite steps : 720
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 266
% 0.21/0.54 # Positive orientable unit clauses : 25
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 1
% 0.21/0.54 # Non-unit-clauses : 240
% 0.21/0.54 # Current number of unprocessed clauses: 891
% 0.21/0.54 # ...number of literals in the above : 2966
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 22
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 2915
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 2823
% 0.21/0.54 # Non-unit clause-clause subsumptions : 153
% 0.21/0.54 # Unit Clause-clause subsumption calls : 15
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 16
% 0.21/0.54 # BW rewrite match successes : 3
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 19047
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.028 s
% 0.21/0.54 # System time : 0.004 s
% 0.21/0.54 # Total time : 0.032 s
% 0.21/0.54 # Maximum resident set size: 1628 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.029 s
% 0.21/0.54 # System time : 0.006 s
% 0.21/0.54 # Total time : 0.035 s
% 0.21/0.54 # Maximum resident set size: 1700 pages
% 0.21/0.54 % E---3.1 exiting
% 0.21/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------