TSTP Solution File: FLD060-4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD060-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:13 EDT 2023
% Result : Unsatisfiable 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 29 ( 15 unt; 0 nHn; 29 RR)
% Number of literals : 57 ( 0 equ; 30 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 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.wzaOkk2TTi/E---3.1_16374.p',compatibility_of_order_relation_and_addition) ).
cnf(sum_7,negated_conjecture,
sum(b,b,v),
file('/export/starexec/sandbox2/tmp/tmp.wzaOkk2TTi/E---3.1_16374.p',sum_7) ).
cnf(less_or_equal_5,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/tmp/tmp.wzaOkk2TTi/E---3.1_16374.p',less_or_equal_5) ).
cnf(commutativity_addition,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.wzaOkk2TTi/E---3.1_16374.p',commutativity_addition) ).
cnf(totality_of_addition,axiom,
( sum(X1,X2,add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.wzaOkk2TTi/E---3.1_16374.p',totality_of_addition) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/tmp/tmp.wzaOkk2TTi/E---3.1_16374.p',a_is_defined) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/tmp/tmp.wzaOkk2TTi/E---3.1_16374.p',b_is_defined) ).
cnf(sum_6,negated_conjecture,
sum(a,a,u),
file('/export/starexec/sandbox2/tmp/tmp.wzaOkk2TTi/E---3.1_16374.p',sum_6) ).
cnf(transitivity_of_order_relation,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.wzaOkk2TTi/E---3.1_16374.p',transitivity_of_order_relation) ).
cnf(not_less_or_equal_8,negated_conjecture,
~ less_or_equal(u,v),
file('/export/starexec/sandbox2/tmp/tmp.wzaOkk2TTi/E---3.1_16374.p',not_less_or_equal_8) ).
cnf(c_0_10,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_11,negated_conjecture,
sum(b,b,v),
sum_7 ).
cnf(c_0_12,negated_conjecture,
( less_or_equal(X1,v)
| ~ less_or_equal(X2,b)
| ~ sum(X2,b,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
less_or_equal(a,b),
less_or_equal_5 ).
cnf(c_0_14,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
commutativity_addition ).
cnf(c_0_15,axiom,
( sum(X1,X2,add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
totality_of_addition ).
cnf(c_0_16,negated_conjecture,
( less_or_equal(X1,v)
| ~ sum(a,b,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( sum(X1,X2,add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_19,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_20,plain,
( less_or_equal(X1,add(X2,X3))
| ~ less_or_equal(X4,X2)
| ~ defined(X3)
| ~ defined(X2)
| ~ sum(X4,X3,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
sum(a,a,u),
sum_6 ).
cnf(c_0_22,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
transitivity_of_order_relation ).
cnf(c_0_23,negated_conjecture,
less_or_equal(add(b,a),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_24,negated_conjecture,
( less_or_equal(u,add(X1,a))
| ~ less_or_equal(a,X1)
| ~ defined(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_18])]) ).
cnf(c_0_25,negated_conjecture,
( less_or_equal(X1,v)
| ~ less_or_equal(X1,add(b,a)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
less_or_equal(u,add(b,a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_13]),c_0_19])]) ).
cnf(c_0_27,negated_conjecture,
~ less_or_equal(u,v),
not_less_or_equal_8 ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.10 % Problem : FLD060-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n024.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 23:12:27 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.wzaOkk2TTi/E---3.1_16374.p
% 0.15/0.43 # Version: 3.1pre001
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16458 completed with status 0
% 0.15/0.43 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: FGUNF-FFMM21-SFFFFFNN
% 0.15/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 589s (1) cores
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.43 # Starting new_bool_3 with 269s (1) cores
% 0.15/0.43 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.15/0.43 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.15/0.43 # G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with pid 16463 completed with status 0
% 0.15/0.43 # Result found by G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: FGUNF-FFMM21-SFFFFFNN
% 0.15/0.43 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 589s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 s
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Unsatisfiable
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 34
% 0.15/0.43 # Removed by relevancy pruning/SinE : 0
% 0.15/0.43 # Initial clauses : 34
% 0.15/0.43 # Removed in clause preprocessing : 0
% 0.15/0.43 # Initial clauses in saturation : 34
% 0.15/0.43 # Processed clauses : 152
% 0.15/0.43 # ...of these trivial : 0
% 0.15/0.43 # ...subsumed : 18
% 0.15/0.43 # ...remaining for further processing : 134
% 0.15/0.43 # Other redundant clauses eliminated : 0
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 0
% 0.15/0.43 # Backward-rewritten : 0
% 0.15/0.43 # Generated clauses : 469
% 0.15/0.43 # ...of the previous two non-redundant : 392
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 0
% 0.15/0.43 # Paramodulations : 467
% 0.15/0.43 # Factorizations : 2
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 0
% 0.15/0.43 # Total rewrite steps : 263
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 134
% 0.15/0.43 # Positive orientable unit clauses : 40
% 0.15/0.43 # Positive unorientable unit clauses: 0
% 0.15/0.43 # Negative unit clauses : 2
% 0.15/0.43 # Non-unit-clauses : 92
% 0.15/0.43 # Current number of unprocessed clauses: 271
% 0.15/0.43 # ...number of literals in the above : 891
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 0
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 832
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 678
% 0.15/0.43 # Non-unit clause-clause subsumptions : 18
% 0.15/0.43 # Unit Clause-clause subsumption calls : 53
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 2
% 0.15/0.43 # BW rewrite match successes : 0
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 6692
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.010 s
% 0.15/0.43 # System time : 0.002 s
% 0.15/0.43 # Total time : 0.012 s
% 0.15/0.43 # Maximum resident set size: 1660 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.050 s
% 0.15/0.43 # System time : 0.009 s
% 0.15/0.43 # Total time : 0.059 s
% 0.15/0.43 # Maximum resident set size: 1700 pages
% 0.15/0.43 % E---3.1 exiting
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------