TSTP Solution File: FLD014-3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : FLD014-3 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 19:52:58 EDT 2024
% Result : Unsatisfiable 0.94s 0.63s
% Output : CNFRefutation 0.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 42 ( 16 unt; 0 nHn; 42 RR)
% Number of literals : 90 ( 0 equ; 52 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 : 75 ( 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/sandbox2/benchmark/Axioms/FLD002-0.ax',associativity_addition_1) ).
cnf(existence_of_identity_addition,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',existence_of_identity_addition) ).
cnf(commutativity_addition,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',well_definedness_of_additive_identity) ).
cnf(existence_of_inverse_addition,axiom,
( sum(additive_inverse(X1),X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_addition) ).
cnf(sum_3,negated_conjecture,
sum(additive_identity,a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_3) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(associativity_addition_2,axiom,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X6,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',associativity_addition_2) ).
cnf(not_sum_4,negated_conjecture,
~ sum(additive_identity,additive_inverse(a),additive_inverse(b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_sum_4) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',well_definedness_of_additive_inverse) ).
cnf(c_0_11,plain,
( sum(X1,X2,X3)
| ~ sum(X1,X4,X5)
| ~ sum(X4,X6,X2)
| ~ sum(X5,X6,X3) ),
inference(fof_simplification,[status(thm)],[associativity_addition_1]) ).
cnf(c_0_12,plain,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_13,plain,
( sum(X1,X2,X3)
| ~ sum(X1,X4,X5)
| ~ sum(X4,X6,X2)
| ~ sum(X5,X6,X3) ),
c_0_11 ).
cnf(c_0_14,plain,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
c_0_12 ).
cnf(c_0_15,plain,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_16,plain,
( sum(X1,X2,X3)
| ~ defined(X3)
| ~ sum(X1,X4,additive_identity)
| ~ sum(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_18,plain,
( sum(additive_inverse(X1),X1,additive_identity)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_19,plain,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
c_0_15 ).
cnf(c_0_20,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_16,c_0_14]),c_0_17])]) ).
cnf(c_0_21,negated_conjecture,
sum(additive_identity,a,b),
sum_3 ).
cnf(c_0_22,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_23,plain,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X6,X3) ),
inference(fof_simplification,[status(thm)],[associativity_addition_2]) ).
cnf(c_0_24,plain,
( sum(additive_inverse(X1),X1,additive_identity)
| ~ defined(X1) ),
c_0_18 ).
cnf(c_0_25,plain,
( sum(X1,additive_identity,X1)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_26,negated_conjecture,
sum(additive_identity,b,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_27,plain,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X6,X3) ),
c_0_23 ).
cnf(c_0_28,plain,
( sum(X1,additive_inverse(X1),additive_identity)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_29,plain,
( sum(X1,X2,X3)
| ~ defined(X3)
| ~ sum(X4,additive_identity,X2)
| ~ sum(X1,X4,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
sum(b,additive_identity,a),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
~ sum(additive_identity,additive_inverse(a),additive_inverse(b)),
inference(fof_simplification,[status(thm)],[not_sum_4]) ).
cnf(c_0_32,plain,
( sum(X1,additive_inverse(X2),X3)
| ~ defined(X2)
| ~ sum(X4,additive_identity,X3)
| ~ sum(X4,X2,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( sum(X1,a,X2)
| ~ defined(X2)
| ~ sum(X1,b,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_35,negated_conjecture,
~ sum(additive_identity,additive_inverse(a),additive_inverse(b)),
c_0_31 ).
cnf(c_0_36,plain,
( sum(X1,additive_inverse(X2),X3)
| ~ defined(X2)
| ~ defined(X3)
| ~ sum(X3,X2,X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_25]) ).
cnf(c_0_37,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_33,c_0_24]),c_0_17]),c_0_34])]) ).
cnf(c_0_38,plain,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_39,negated_conjecture,
~ defined(additive_inverse(b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_22]),c_0_37])]) ).
cnf(c_0_40,plain,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
c_0_38 ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : FLD014-3 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 21:31:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 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/benchmark/theBenchmark.p
% 0.94/0.63 # Version: 3.1.0
% 0.94/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.94/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.94/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.94/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.94/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.94/0.63 # Starting sh5l with 300s (1) cores
% 0.94/0.63 # new_bool_1 with pid 10868 completed with status 0
% 0.94/0.63 # Result found by new_bool_1
% 0.94/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.94/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.94/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.94/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.94/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.94/0.63 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.94/0.63 # Search class: FHUNF-FFSS11-SFFFFFNN
% 0.94/0.63 # partial match(1): FHUNF-FFSF11-SFFFFFNN
% 0.94/0.63 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.94/0.63 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.94/0.63 # SAT001_MinMin_p005000_rr_RG with pid 10872 completed with status 0
% 0.94/0.63 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.94/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.94/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.94/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.94/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.94/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.94/0.63 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.94/0.63 # Search class: FHUNF-FFSS11-SFFFFFNN
% 0.94/0.63 # partial match(1): FHUNF-FFSF11-SFFFFFNN
% 0.94/0.63 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.94/0.63 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.94/0.63 # Preprocessing time : 0.001 s
% 0.94/0.63 # Presaturation interreduction done
% 0.94/0.63
% 0.94/0.63 # Proof found!
% 0.94/0.63 # SZS status Unsatisfiable
% 0.94/0.63 # SZS output start CNFRefutation
% See solution above
% 0.94/0.63 # Parsed axioms : 30
% 0.94/0.63 # Removed by relevancy pruning/SinE : 19
% 0.94/0.63 # Initial clauses : 11
% 0.94/0.63 # Removed in clause preprocessing : 0
% 0.94/0.63 # Initial clauses in saturation : 11
% 0.94/0.63 # Processed clauses : 2043
% 0.94/0.63 # ...of these trivial : 8
% 0.94/0.63 # ...subsumed : 1537
% 0.94/0.63 # ...remaining for further processing : 498
% 0.94/0.63 # Other redundant clauses eliminated : 0
% 0.94/0.63 # Clauses deleted for lack of memory : 0
% 0.94/0.63 # Backward-subsumed : 34
% 0.94/0.63 # Backward-rewritten : 0
% 0.94/0.63 # Generated clauses : 8202
% 0.94/0.63 # ...of the previous two non-redundant : 6887
% 0.94/0.63 # ...aggressively subsumed : 0
% 0.94/0.63 # Contextual simplify-reflections : 11
% 0.94/0.63 # Paramodulations : 8202
% 0.94/0.63 # Factorizations : 0
% 0.94/0.63 # NegExts : 0
% 0.94/0.63 # Equation resolutions : 0
% 0.94/0.63 # Disequality decompositions : 0
% 0.94/0.63 # Total rewrite steps : 4726
% 0.94/0.63 # ...of those cached : 4696
% 0.94/0.63 # Propositional unsat checks : 0
% 0.94/0.63 # Propositional check models : 0
% 0.94/0.63 # Propositional check unsatisfiable : 0
% 0.94/0.63 # Propositional clauses : 0
% 0.94/0.63 # Propositional clauses after purity: 0
% 0.94/0.63 # Propositional unsat core size : 0
% 0.94/0.63 # Propositional preprocessing time : 0.000
% 0.94/0.63 # Propositional encoding time : 0.000
% 0.94/0.63 # Propositional solver time : 0.000
% 0.94/0.63 # Success case prop preproc time : 0.000
% 0.94/0.63 # Success case prop encoding time : 0.000
% 0.94/0.63 # Success case prop solver time : 0.000
% 0.94/0.63 # Current number of processed clauses : 453
% 0.94/0.63 # Positive orientable unit clauses : 30
% 0.94/0.63 # Positive unorientable unit clauses: 0
% 0.94/0.63 # Negative unit clauses : 2
% 0.94/0.63 # Non-unit-clauses : 421
% 0.94/0.63 # Current number of unprocessed clauses: 4787
% 0.94/0.63 # ...number of literals in the above : 17635
% 0.94/0.63 # Current number of archived formulas : 0
% 0.94/0.63 # Current number of archived clauses : 45
% 0.94/0.63 # Clause-clause subsumption calls (NU) : 17584
% 0.94/0.63 # Rec. Clause-clause subsumption calls : 16825
% 0.94/0.63 # Non-unit clause-clause subsumptions : 1575
% 0.94/0.63 # Unit Clause-clause subsumption calls : 93
% 0.94/0.63 # Rewrite failures with RHS unbound : 0
% 0.94/0.63 # BW rewrite match attempts : 17
% 0.94/0.63 # BW rewrite match successes : 6
% 0.94/0.63 # Condensation attempts : 0
% 0.94/0.63 # Condensation successes : 0
% 0.94/0.63 # Termbank termtop insertions : 99684
% 0.94/0.63 # Search garbage collected termcells : 151
% 0.94/0.63
% 0.94/0.63 # -------------------------------------------------
% 0.94/0.63 # User time : 0.118 s
% 0.94/0.63 # System time : 0.012 s
% 0.94/0.63 # Total time : 0.130 s
% 0.94/0.63 # Maximum resident set size: 1748 pages
% 0.94/0.63
% 0.94/0.63 # -------------------------------------------------
% 0.94/0.63 # User time : 0.120 s
% 0.94/0.63 # System time : 0.014 s
% 0.94/0.63 # Total time : 0.133 s
% 0.94/0.63 # Maximum resident set size: 1724 pages
% 0.94/0.63 % E---3.1 exiting
%------------------------------------------------------------------------------