TSTP Solution File: FLD066-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---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 : n013.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:46 EDT 2023
% Result : Unsatisfiable 0.15s 0.51s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 16
% Syntax : Number of clauses : 56 ( 27 unt; 3 nHn; 56 RR)
% Number of literals : 116 ( 0 equ; 59 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/sandbox/tmp/tmp.c2dV6KLhBF/E---3.1_14672.p',compatibility_of_order_relation_and_addition) ).
cnf(sum_6,negated_conjecture,
sum(a,c,u),
file('/export/starexec/sandbox/tmp/tmp.c2dV6KLhBF/E---3.1_14672.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/sandbox/tmp/tmp.c2dV6KLhBF/E---3.1_14672.p',totality_of_order_relation) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.c2dV6KLhBF/E---3.1_14672.p',a_is_defined) ).
cnf(sum_7,negated_conjecture,
sum(b,c,v),
file('/export/starexec/sandbox/tmp/tmp.c2dV6KLhBF/E---3.1_14672.p',sum_7) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/tmp/tmp.c2dV6KLhBF/E---3.1_14672.p',b_is_defined) ).
cnf(not_less_or_equal_9,negated_conjecture,
~ less_or_equal(a,b),
file('/export/starexec/sandbox/tmp/tmp.c2dV6KLhBF/E---3.1_14672.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/sandbox/tmp/tmp.c2dV6KLhBF/E---3.1_14672.p',associativity_addition_2) ).
cnf(antisymmetry_of_order_relation,axiom,
( sum(additive_identity,X1,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.c2dV6KLhBF/E---3.1_14672.p',antisymmetry_of_order_relation) ).
cnf(less_or_equal_8,negated_conjecture,
less_or_equal(u,v),
file('/export/starexec/sandbox/tmp/tmp.c2dV6KLhBF/E---3.1_14672.p',less_or_equal_8) ).
cnf(existence_of_identity_addition,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.c2dV6KLhBF/E---3.1_14672.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/sandbox/tmp/tmp.c2dV6KLhBF/E---3.1_14672.p',associativity_addition_1) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox/tmp/tmp.c2dV6KLhBF/E---3.1_14672.p',well_definedness_of_additive_identity) ).
cnf(commutativity_addition,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.c2dV6KLhBF/E---3.1_14672.p',commutativity_addition) ).
cnf(existence_of_inverse_addition,axiom,
( sum(additive_inverse(X1),X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.c2dV6KLhBF/E---3.1_14672.p',existence_of_inverse_addition) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox/tmp/tmp.c2dV6KLhBF/E---3.1_14672.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,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_22,negated_conjecture,
sum(b,c,v),
sum_7 ).
cnf(c_0_23,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_24,negated_conjecture,
~ less_or_equal(a,b),
not_less_or_equal_9 ).
cnf(c_0_25,axiom,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X6,X3) ),
associativity_addition_2 ).
cnf(c_0_26,axiom,
( sum(additive_identity,X1,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
antisymmetry_of_order_relation ).
cnf(c_0_27,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_21,c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_28,negated_conjecture,
less_or_equal(u,v),
less_or_equal_8 ).
cnf(c_0_29,negated_conjecture,
( sum(X1,c,X2)
| ~ sum(X3,u,X2)
| ~ sum(X3,a,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_17]) ).
cnf(c_0_30,negated_conjecture,
sum(additive_identity,u,v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_31,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
existence_of_identity_addition ).
cnf(c_0_32,negated_conjecture,
( sum(X1,c,v)
| ~ sum(additive_identity,a,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
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,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_31]) ).
cnf(c_0_35,plain,
( less_or_equal(X1,X1)
| ~ defined(X1) ),
inference(ef,[status(thm)],[c_0_19]) ).
cnf(c_0_36,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_37,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
commutativity_addition ).
cnf(c_0_38,negated_conjecture,
sum(a,c,v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_31]),c_0_20])]) ).
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_31]) ).
cnf(c_0_40,axiom,
( sum(additive_inverse(X1),X1,additive_identity)
| ~ defined(X1) ),
existence_of_inverse_addition ).
cnf(c_0_41,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_34,c_0_35]),c_0_36])]) ).
cnf(c_0_42,plain,
( sum(X1,additive_identity,X1)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_31]) ).
cnf(c_0_43,negated_conjecture,
sum(c,a,v),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,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_45,negated_conjecture,
sum(c,b,v),
inference(spm,[status(thm)],[c_0_37,c_0_22]) ).
cnf(c_0_46,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_47,plain,
less_or_equal(additive_identity,additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_36])]) ).
cnf(c_0_48,negated_conjecture,
( sum(X1,a,X2)
| ~ sum(X3,v,X2)
| ~ sum(X3,c,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
sum(additive_inverse(c),v,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_23]),c_0_46])]) ).
cnf(c_0_50,plain,
sum(additive_identity,additive_identity,additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_47]),c_0_47])]) ).
cnf(c_0_51,negated_conjecture,
( sum(X1,a,b)
| ~ sum(additive_inverse(c),c,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,plain,
( sum(additive_identity,X1,X2)
| ~ defined(X2)
| ~ sum(additive_identity,X2,X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_50]) ).
cnf(c_0_53,negated_conjecture,
sum(additive_identity,a,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_40]),c_0_46])]) ).
cnf(c_0_54,negated_conjecture,
sum(additive_identity,b,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_20])]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_54]),c_0_23])]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : FLD066-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.09/0.32 % Computer : n013.cluster.edu
% 0.09/0.32 % Model : x86_64 x86_64
% 0.09/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.32 % Memory : 8042.1875MB
% 0.09/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.32 % CPULimit : 2400
% 0.09/0.32 % WCLimit : 300
% 0.09/0.32 % DateTime : Mon Oct 2 23:12:59 EDT 2023
% 0.09/0.32 % CPUTime :
% 0.15/0.43 Running first-order model finding
% 0.15/0.43 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.c2dV6KLhBF/E---3.1_14672.p
% 0.15/0.51 # Version: 3.1pre001
% 0.15/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.51 # Starting sh5l with 300s (1) cores
% 0.15/0.51 # sh5l with pid 14761 completed with status 0
% 0.15/0.51 # Result found by sh5l
% 0.15/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.51 # Starting sh5l with 300s (1) cores
% 0.15/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.51 # Search class: FGUNF-FFMM21-SFFFFFNN
% 0.15/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.51 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 118s (1) cores
% 0.15/0.51 # G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with pid 14768 completed with status 0
% 0.15/0.51 # Result found by G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 0.15/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.51 # Starting sh5l with 300s (1) cores
% 0.15/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.51 # Search class: FGUNF-FFMM21-SFFFFFNN
% 0.15/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.51 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 118s (1) cores
% 0.15/0.51 # Preprocessing time : 0.001 s
% 0.15/0.51
% 0.15/0.51 # Proof found!
% 0.15/0.51 # SZS status Unsatisfiable
% 0.15/0.51 # SZS output start CNFRefutation
% See solution above
% 0.15/0.51 # Parsed axioms : 35
% 0.15/0.51 # Removed by relevancy pruning/SinE : 2
% 0.15/0.51 # Initial clauses : 33
% 0.15/0.51 # Removed in clause preprocessing : 0
% 0.15/0.51 # Initial clauses in saturation : 33
% 0.15/0.51 # Processed clauses : 1183
% 0.15/0.51 # ...of these trivial : 11
% 0.15/0.51 # ...subsumed : 470
% 0.15/0.51 # ...remaining for further processing : 702
% 0.15/0.51 # Other redundant clauses eliminated : 0
% 0.15/0.51 # Clauses deleted for lack of memory : 0
% 0.15/0.51 # Backward-subsumed : 4
% 0.15/0.51 # Backward-rewritten : 5
% 0.15/0.51 # Generated clauses : 3934
% 0.15/0.51 # ...of the previous two non-redundant : 2900
% 0.15/0.51 # ...aggressively subsumed : 0
% 0.15/0.51 # Contextual simplify-reflections : 4
% 0.15/0.51 # Paramodulations : 3920
% 0.15/0.51 # Factorizations : 14
% 0.15/0.51 # NegExts : 0
% 0.15/0.51 # Equation resolutions : 0
% 0.15/0.51 # Total rewrite steps : 3050
% 0.15/0.51 # Propositional unsat checks : 0
% 0.15/0.51 # Propositional check models : 0
% 0.15/0.51 # Propositional check unsatisfiable : 0
% 0.15/0.51 # Propositional clauses : 0
% 0.15/0.51 # Propositional clauses after purity: 0
% 0.15/0.51 # Propositional unsat core size : 0
% 0.15/0.51 # Propositional preprocessing time : 0.000
% 0.15/0.51 # Propositional encoding time : 0.000
% 0.15/0.51 # Propositional solver time : 0.000
% 0.15/0.51 # Success case prop preproc time : 0.000
% 0.15/0.51 # Success case prop encoding time : 0.000
% 0.15/0.51 # Success case prop solver time : 0.000
% 0.15/0.51 # Current number of processed clauses : 693
% 0.15/0.51 # Positive orientable unit clauses : 70
% 0.15/0.51 # Positive unorientable unit clauses: 0
% 0.15/0.51 # Negative unit clauses : 2
% 0.15/0.51 # Non-unit-clauses : 621
% 0.15/0.51 # Current number of unprocessed clauses: 1737
% 0.15/0.51 # ...number of literals in the above : 6306
% 0.15/0.51 # Current number of archived formulas : 0
% 0.15/0.51 # Current number of archived clauses : 9
% 0.15/0.51 # Clause-clause subsumption calls (NU) : 20603
% 0.15/0.51 # Rec. Clause-clause subsumption calls : 16094
% 0.15/0.51 # Non-unit clause-clause subsumptions : 478
% 0.15/0.51 # Unit Clause-clause subsumption calls : 1530
% 0.15/0.51 # Rewrite failures with RHS unbound : 0
% 0.15/0.51 # BW rewrite match attempts : 49
% 0.15/0.51 # BW rewrite match successes : 5
% 0.15/0.51 # Condensation attempts : 0
% 0.15/0.51 # Condensation successes : 0
% 0.15/0.51 # Termbank termtop insertions : 51358
% 0.15/0.51
% 0.15/0.51 # -------------------------------------------------
% 0.15/0.51 # User time : 0.070 s
% 0.15/0.51 # System time : 0.001 s
% 0.15/0.51 # Total time : 0.071 s
% 0.15/0.51 # Maximum resident set size: 1612 pages
% 0.15/0.51
% 0.15/0.51 # -------------------------------------------------
% 0.15/0.51 # User time : 0.072 s
% 0.15/0.51 # System time : 0.002 s
% 0.15/0.51 # Total time : 0.074 s
% 0.15/0.51 # Maximum resident set size: 1700 pages
% 0.15/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------