TSTP Solution File: FLD061-4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : FLD061-4 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:39 EDT 2024
% Result : Unsatisfiable 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 38 ( 20 unt; 0 nHn; 38 RR)
% Number of literals : 74 ( 0 equ; 39 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 : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(commutativity_addition,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).
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/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(sum_10,negated_conjecture,
sum(d,b,v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_10) ).
cnf(totality_of_addition,axiom,
( sum(X1,X2,add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',totality_of_addition) ).
cnf(less_or_equal_7,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_7) ).
cnf(sum_9,negated_conjecture,
sum(a,c,u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_9) ).
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/benchmark/Axioms/FLD002-0.ax',transitivity_of_order_relation) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(d_is_defined,hypothesis,
defined(d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_is_defined) ).
cnf(less_or_equal_8,negated_conjecture,
less_or_equal(c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_8) ).
cnf(not_less_or_equal_11,negated_conjecture,
~ less_or_equal(u,v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_11) ).
cnf(c_0_11,plain,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_12,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X4)
| ~ sum(X3,X5,X1)
| ~ sum(X4,X5,X2) ),
inference(fof_simplification,[status(thm)],[compatibility_of_order_relation_and_addition]) ).
cnf(c_0_13,plain,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
c_0_11 ).
cnf(c_0_14,negated_conjecture,
sum(d,b,v),
sum_10 ).
cnf(c_0_15,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X4)
| ~ sum(X3,X5,X1)
| ~ sum(X4,X5,X2) ),
c_0_12 ).
cnf(c_0_16,negated_conjecture,
sum(b,d,v),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( sum(X1,X2,add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
inference(fof_simplification,[status(thm)],[totality_of_addition]) ).
cnf(c_0_18,negated_conjecture,
( less_or_equal(X1,v)
| ~ less_or_equal(X2,b)
| ~ sum(X2,d,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
less_or_equal(a,b),
less_or_equal_7 ).
cnf(c_0_20,plain,
( sum(X1,X2,add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
c_0_17 ).
cnf(c_0_21,negated_conjecture,
sum(a,c,u),
sum_9 ).
cnf(c_0_22,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_order_relation]) ).
cnf(c_0_23,negated_conjecture,
( less_or_equal(X1,v)
| ~ sum(a,d,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( sum(X1,X2,add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_25,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_26,hypothesis,
defined(d),
d_is_defined ).
cnf(c_0_27,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_15,c_0_20]) ).
cnf(c_0_28,negated_conjecture,
sum(c,a,u),
inference(spm,[status(thm)],[c_0_13,c_0_21]) ).
cnf(c_0_29,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
c_0_22 ).
cnf(c_0_30,negated_conjecture,
less_or_equal(add(d,a),v),
inference(cn,[status(thm)],[inference(rw,[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_31,negated_conjecture,
( less_or_equal(u,add(X1,a))
| ~ less_or_equal(c,X1)
| ~ defined(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_25])]) ).
cnf(c_0_32,negated_conjecture,
less_or_equal(c,d),
less_or_equal_8 ).
cnf(c_0_33,negated_conjecture,
~ less_or_equal(u,v),
inference(fof_simplification,[status(thm)],[not_less_or_equal_11]) ).
cnf(c_0_34,negated_conjecture,
( less_or_equal(X1,v)
| ~ less_or_equal(X1,add(d,a)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
less_or_equal(u,add(d,a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26])]) ).
cnf(c_0_36,negated_conjecture,
~ less_or_equal(u,v),
c_0_33 ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : FLD061-4 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n009.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Sat May 18 21:15:23 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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/benchmark/theBenchmark.p
% 0.21/0.50 # Version: 3.1.0
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 11618 completed with status 0
% 0.21/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGUNF-FFMM21-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 589s (1) cores
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.21/0.50 # Starting new_bool_3 with 269s (1) cores
% 0.21/0.50 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.21/0.50 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.21/0.50 # G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with pid 11622 completed with status 0
% 0.21/0.50 # Result found by G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 0.21/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.50 # No SInE strategy applied
% 0.21/0.50 # Search class: FGUNF-FFMM21-SFFFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 589s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Unsatisfiable
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 37
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 37
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 37
% 0.21/0.50 # Processed clauses : 162
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 15
% 0.21/0.50 # ...remaining for further processing : 147
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 0
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 436
% 0.21/0.50 # ...of the previous two non-redundant : 361
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 434
% 0.21/0.50 # Factorizations : 2
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 289
% 0.21/0.50 # ...of those cached : 257
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 147
% 0.21/0.50 # Positive orientable unit clauses : 37
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 2
% 0.21/0.50 # Non-unit-clauses : 108
% 0.21/0.50 # Current number of unprocessed clauses: 233
% 0.21/0.50 # ...number of literals in the above : 764
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 0
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 1391
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 1063
% 0.21/0.50 # Non-unit clause-clause subsumptions : 15
% 0.21/0.50 # Unit Clause-clause subsumption calls : 72
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 1
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 6557
% 0.21/0.50 # Search garbage collected termcells : 116
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.012 s
% 0.21/0.50 # System time : 0.004 s
% 0.21/0.50 # Total time : 0.016 s
% 0.21/0.50 # Maximum resident set size: 1688 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.054 s
% 0.21/0.50 # System time : 0.009 s
% 0.21/0.50 # Total time : 0.063 s
% 0.21/0.50 # Maximum resident set size: 1728 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------