TSTP Solution File: FLD066-3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD066-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:30:15 EDT 2023
% Result : Unsatisfiable 0.17s 0.53s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 16
% Syntax : Number of clauses : 57 ( 27 unt; 3 nHn; 57 RR)
% Number of literals : 118 ( 0 equ; 60 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 80 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(compatibility_of_order_relation_and_addition,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X4)
| ~ sum(X3,X5,X1)
| ~ sum(X4,X5,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.ca37IaOXMT/E---3.1_1370.p',compatibility_of_order_relation_and_addition) ).
cnf(sum_6,negated_conjecture,
sum(a,c,u),
file('/export/starexec/sandbox2/tmp/tmp.ca37IaOXMT/E---3.1_1370.p',sum_6) ).
cnf(totality_of_order_relation,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.ca37IaOXMT/E---3.1_1370.p',totality_of_order_relation) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/tmp/tmp.ca37IaOXMT/E---3.1_1370.p',a_is_defined) ).
cnf(antisymmetry_of_order_relation,axiom,
( sum(additive_identity,X1,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ca37IaOXMT/E---3.1_1370.p',antisymmetry_of_order_relation) ).
cnf(less_or_equal_8,negated_conjecture,
less_or_equal(u,v),
file('/export/starexec/sandbox2/tmp/tmp.ca37IaOXMT/E---3.1_1370.p',less_or_equal_8) ).
cnf(sum_7,negated_conjecture,
sum(b,c,v),
file('/export/starexec/sandbox2/tmp/tmp.ca37IaOXMT/E---3.1_1370.p',sum_7) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/tmp/tmp.ca37IaOXMT/E---3.1_1370.p',b_is_defined) ).
cnf(not_less_or_equal_9,negated_conjecture,
~ less_or_equal(a,b),
file('/export/starexec/sandbox2/tmp/tmp.ca37IaOXMT/E---3.1_1370.p',not_less_or_equal_9) ).
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/tmp/tmp.ca37IaOXMT/E---3.1_1370.p',associativity_addition_2) ).
cnf(existence_of_identity_addition,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ca37IaOXMT/E---3.1_1370.p',existence_of_identity_addition) ).
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/tmp/tmp.ca37IaOXMT/E---3.1_1370.p',associativity_addition_1) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.ca37IaOXMT/E---3.1_1370.p',well_definedness_of_additive_identity) ).
cnf(commutativity_addition,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.ca37IaOXMT/E---3.1_1370.p',commutativity_addition) ).
cnf(existence_of_inverse_addition,axiom,
( sum(additive_inverse(X1),X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ca37IaOXMT/E---3.1_1370.p',existence_of_inverse_addition) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox2/tmp/tmp.ca37IaOXMT/E---3.1_1370.p',c_is_defined) ).
cnf(c_0_16,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X4)
| ~ sum(X3,X5,X1)
| ~ sum(X4,X5,X2) ),
compatibility_of_order_relation_and_addition ).
cnf(c_0_17,negated_conjecture,
sum(a,c,u),
sum_6 ).
cnf(c_0_18,negated_conjecture,
( less_or_equal(X1,u)
| ~ less_or_equal(X2,a)
| ~ sum(X2,c,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
totality_of_order_relation ).
cnf(c_0_20,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_21,axiom,
( sum(additive_identity,X1,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
antisymmetry_of_order_relation ).
cnf(c_0_22,negated_conjecture,
less_or_equal(u,v),
less_or_equal_8 ).
cnf(c_0_23,negated_conjecture,
( less_or_equal(a,X1)
| less_or_equal(X2,u)
| ~ defined(X1)
| ~ sum(X1,c,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_24,negated_conjecture,
sum(b,c,v),
sum_7 ).
cnf(c_0_25,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_26,negated_conjecture,
~ less_or_equal(a,b),
not_less_or_equal_9 ).
cnf(c_0_27,axiom,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X6,X3) ),
associativity_addition_2 ).
cnf(c_0_28,negated_conjecture,
( sum(additive_identity,v,u)
| ~ less_or_equal(v,u) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
less_or_equal(v,u),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( sum(X1,c,X2)
| ~ sum(X3,v,X2)
| ~ sum(X3,b,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
sum(additive_identity,v,u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_32,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
existence_of_identity_addition ).
cnf(c_0_33,axiom,
( sum(X1,X2,X3)
| ~ sum(X1,X4,X5)
| ~ sum(X4,X6,X2)
| ~ sum(X5,X6,X3) ),
associativity_addition_1 ).
cnf(c_0_34,negated_conjecture,
( sum(X1,c,u)
| ~ sum(additive_identity,b,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,additive_identity)
| ~ defined(X2)
| ~ sum(X3,X2,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_32]) ).
cnf(c_0_36,plain,
( less_or_equal(X1,X1)
| ~ defined(X1) ),
inference(ef,[status(thm)],[c_0_19]) ).
cnf(c_0_37,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_38,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
commutativity_addition ).
cnf(c_0_39,plain,
( sum(X1,X2,X3)
| ~ defined(X3)
| ~ sum(X1,X4,additive_identity)
| ~ sum(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_40,axiom,
( sum(additive_inverse(X1),X1,additive_identity)
| ~ defined(X1) ),
existence_of_inverse_addition ).
cnf(c_0_41,negated_conjecture,
sum(b,c,u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_32]),c_0_25])]) ).
cnf(c_0_42,plain,
( less_or_equal(X1,X2)
| ~ defined(X2)
| ~ sum(additive_identity,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_43,plain,
( sum(X1,additive_identity,X1)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_32]) ).
cnf(c_0_44,negated_conjecture,
sum(c,a,u),
inference(spm,[status(thm)],[c_0_38,c_0_17]) ).
cnf(c_0_45,plain,
( sum(additive_inverse(X1),X2,X3)
| ~ defined(X3)
| ~ defined(X1)
| ~ sum(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
sum(c,b,u),
inference(spm,[status(thm)],[c_0_38,c_0_41]) ).
cnf(c_0_47,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_48,plain,
less_or_equal(additive_identity,additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_37])]) ).
cnf(c_0_49,negated_conjecture,
( sum(X1,a,X2)
| ~ sum(X3,u,X2)
| ~ sum(X3,c,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_44]) ).
cnf(c_0_50,negated_conjecture,
sum(additive_inverse(c),u,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_25]),c_0_47])]) ).
cnf(c_0_51,plain,
sum(additive_identity,additive_identity,additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_48]),c_0_48])]) ).
cnf(c_0_52,negated_conjecture,
( sum(X1,a,b)
| ~ sum(additive_inverse(c),c,X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,plain,
( sum(additive_identity,X1,X2)
| ~ defined(X2)
| ~ sum(additive_identity,X2,X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
sum(additive_identity,a,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_40]),c_0_47])]) ).
cnf(c_0_55,negated_conjecture,
sum(additive_identity,b,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_20])]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_55]),c_0_25])]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : FLD066-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.12/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 23:19:14 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.ca37IaOXMT/E---3.1_1370.p
% 0.17/0.53 # Version: 3.1pre001
% 0.17/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.53 # Starting sh5l with 300s (1) cores
% 0.17/0.53 # sh5l with pid 1451 completed with status 0
% 0.17/0.53 # Result found by sh5l
% 0.17/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.53 # Starting sh5l with 300s (1) cores
% 0.17/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.53 # Search class: FGUNF-FFMM21-SFFFFFNN
% 0.17/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.53 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 118s (1) cores
% 0.17/0.53 # G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with pid 1458 completed with status 0
% 0.17/0.53 # Result found by G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 0.17/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.53 # Starting sh5l with 300s (1) cores
% 0.17/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.53 # Search class: FGUNF-FFMM21-SFFFFFNN
% 0.17/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.53 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 118s (1) cores
% 0.17/0.53 # Preprocessing time : 0.001 s
% 0.17/0.53
% 0.17/0.53 # Proof found!
% 0.17/0.53 # SZS status Unsatisfiable
% 0.17/0.53 # SZS output start CNFRefutation
% See solution above
% 0.17/0.53 # Parsed axioms : 35
% 0.17/0.53 # Removed by relevancy pruning/SinE : 2
% 0.17/0.53 # Initial clauses : 33
% 0.17/0.53 # Removed in clause preprocessing : 0
% 0.17/0.53 # Initial clauses in saturation : 33
% 0.17/0.53 # Processed clauses : 1130
% 0.17/0.53 # ...of these trivial : 10
% 0.17/0.53 # ...subsumed : 439
% 0.17/0.53 # ...remaining for further processing : 681
% 0.17/0.53 # Other redundant clauses eliminated : 0
% 0.17/0.53 # Clauses deleted for lack of memory : 0
% 0.17/0.53 # Backward-subsumed : 4
% 0.17/0.53 # Backward-rewritten : 5
% 0.17/0.53 # Generated clauses : 3725
% 0.17/0.53 # ...of the previous two non-redundant : 2758
% 0.17/0.53 # ...aggressively subsumed : 0
% 0.17/0.53 # Contextual simplify-reflections : 4
% 0.17/0.53 # Paramodulations : 3711
% 0.17/0.53 # Factorizations : 14
% 0.17/0.53 # NegExts : 0
% 0.17/0.53 # Equation resolutions : 0
% 0.17/0.53 # Total rewrite steps : 2861
% 0.17/0.53 # Propositional unsat checks : 0
% 0.17/0.53 # Propositional check models : 0
% 0.17/0.53 # Propositional check unsatisfiable : 0
% 0.17/0.53 # Propositional clauses : 0
% 0.17/0.53 # Propositional clauses after purity: 0
% 0.17/0.53 # Propositional unsat core size : 0
% 0.17/0.53 # Propositional preprocessing time : 0.000
% 0.17/0.53 # Propositional encoding time : 0.000
% 0.17/0.53 # Propositional solver time : 0.000
% 0.17/0.53 # Success case prop preproc time : 0.000
% 0.17/0.53 # Success case prop encoding time : 0.000
% 0.17/0.53 # Success case prop solver time : 0.000
% 0.17/0.53 # Current number of processed clauses : 672
% 0.17/0.53 # Positive orientable unit clauses : 67
% 0.17/0.53 # Positive unorientable unit clauses: 0
% 0.17/0.53 # Negative unit clauses : 2
% 0.17/0.53 # Non-unit-clauses : 603
% 0.17/0.53 # Current number of unprocessed clauses: 1648
% 0.17/0.53 # ...number of literals in the above : 5987
% 0.17/0.53 # Current number of archived formulas : 0
% 0.17/0.53 # Current number of archived clauses : 9
% 0.17/0.53 # Clause-clause subsumption calls (NU) : 19601
% 0.17/0.53 # Rec. Clause-clause subsumption calls : 15291
% 0.17/0.53 # Non-unit clause-clause subsumptions : 447
% 0.17/0.53 # Unit Clause-clause subsumption calls : 988
% 0.17/0.53 # Rewrite failures with RHS unbound : 0
% 0.17/0.53 # BW rewrite match attempts : 45
% 0.17/0.53 # BW rewrite match successes : 5
% 0.17/0.53 # Condensation attempts : 0
% 0.17/0.53 # Condensation successes : 0
% 0.17/0.53 # Termbank termtop insertions : 48916
% 0.17/0.53
% 0.17/0.53 # -------------------------------------------------
% 0.17/0.53 # User time : 0.067 s
% 0.17/0.53 # System time : 0.004 s
% 0.17/0.53 # Total time : 0.071 s
% 0.17/0.53 # Maximum resident set size: 1616 pages
% 0.17/0.53
% 0.17/0.53 # -------------------------------------------------
% 0.17/0.53 # User time : 0.069 s
% 0.17/0.53 # System time : 0.004 s
% 0.17/0.53 # Total time : 0.074 s
% 0.17/0.53 # Maximum resident set size: 1704 pages
% 0.17/0.53 % E---3.1 exiting
% 0.17/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------