TSTP Solution File: FLD058-3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : FLD058-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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 : Sat May 4 07:40:05 EDT 2024
% Result : Unsatisfiable 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 16 unt; 0 nHn; 29 RR)
% Number of literals : 52 ( 0 equ; 27 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(commutativity_addition,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.rZK2WKLVQ2/E---3.1_19257.p',commutativity_addition) ).
cnf(existence_of_identity_addition,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.rZK2WKLVQ2/E---3.1_19257.p',existence_of_identity_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/tmp/tmp.rZK2WKLVQ2/E---3.1_19257.p',compatibility_of_order_relation_and_addition) ).
cnf(sum_6,negated_conjecture,
sum(additive_identity,b,additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.rZK2WKLVQ2/E---3.1_19257.p',sum_6) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/tmp/tmp.rZK2WKLVQ2/E---3.1_19257.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.rZK2WKLVQ2/E---3.1_19257.p',antisymmetry_of_order_relation) ).
cnf(not_sum_5,negated_conjecture,
~ sum(additive_identity,a,additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.rZK2WKLVQ2/E---3.1_19257.p',not_sum_5) ).
cnf(less_or_equal_3,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox2/tmp/tmp.rZK2WKLVQ2/E---3.1_19257.p',less_or_equal_3) ).
cnf(less_or_equal_4,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/tmp/tmp.rZK2WKLVQ2/E---3.1_19257.p',less_or_equal_4) ).
cnf(c_0_9,plain,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_10,plain,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_11,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_12,plain,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
c_0_9 ).
cnf(c_0_13,negated_conjecture,
sum(additive_identity,b,additive_identity),
sum_6 ).
cnf(c_0_14,plain,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
c_0_10 ).
cnf(c_0_15,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_16,plain,
( sum(additive_identity,X1,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_of_order_relation]) ).
cnf(c_0_17,negated_conjecture,
~ sum(additive_identity,a,additive_identity),
inference(fof_simplification,[status(thm)],[not_sum_5]) ).
cnf(c_0_18,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X4)
| ~ sum(X3,X5,X1)
| ~ sum(X4,X5,X2) ),
c_0_11 ).
cnf(c_0_19,negated_conjecture,
sum(b,additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,hypothesis,
sum(additive_identity,a,a),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( sum(additive_identity,X1,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
less_or_equal(additive_identity,a),
less_or_equal_3 ).
cnf(c_0_23,negated_conjecture,
~ sum(additive_identity,a,additive_identity),
c_0_17 ).
cnf(c_0_24,negated_conjecture,
( less_or_equal(X1,additive_identity)
| ~ less_or_equal(X2,b)
| ~ sum(X2,additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,hypothesis,
sum(a,additive_identity,a),
inference(spm,[status(thm)],[c_0_12,c_0_20]) ).
cnf(c_0_26,negated_conjecture,
less_or_equal(a,b),
less_or_equal_4 ).
cnf(c_0_27,negated_conjecture,
~ less_or_equal(a,additive_identity),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_28,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : FLD058-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n031.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 : Fri May 3 14:06:02 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.52 Running first-order theorem proving
% 0.21/0.52 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.rZK2WKLVQ2/E---3.1_19257.p
% 0.21/0.54 # Version: 3.1.0
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # new_bool_3 with pid 19376 completed with status 0
% 0.21/0.54 # Result found by new_bool_3
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FGUNF-FFMM00-SFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.54 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 19379 completed with status 0
% 0.21/0.54 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FGUNF-FFMM00-SFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.54 # Preprocessing time : 0.001 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Unsatisfiable
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 32
% 0.21/0.54 # Removed by relevancy pruning/SinE : 11
% 0.21/0.54 # Initial clauses : 21
% 0.21/0.54 # Removed in clause preprocessing : 0
% 0.21/0.54 # Initial clauses in saturation : 21
% 0.21/0.54 # Processed clauses : 77
% 0.21/0.54 # ...of these trivial : 0
% 0.21/0.54 # ...subsumed : 6
% 0.21/0.54 # ...remaining for further processing : 71
% 0.21/0.54 # Other redundant clauses eliminated : 0
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 1
% 0.21/0.54 # Backward-rewritten : 2
% 0.21/0.54 # Generated clauses : 92
% 0.21/0.54 # ...of the previous two non-redundant : 67
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 92
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 0
% 0.21/0.54 # Disequality decompositions : 0
% 0.21/0.54 # Total rewrite steps : 28
% 0.21/0.54 # ...of those cached : 18
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 47
% 0.21/0.54 # Positive orientable unit clauses : 16
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 2
% 0.21/0.54 # Non-unit-clauses : 29
% 0.21/0.54 # Current number of unprocessed clauses: 27
% 0.21/0.54 # ...number of literals in the above : 84
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 24
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 106
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 104
% 0.21/0.54 # Non-unit clause-clause subsumptions : 6
% 0.21/0.54 # Unit Clause-clause subsumption calls : 4
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 4
% 0.21/0.54 # BW rewrite match successes : 1
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 1962
% 0.21/0.54 # Search garbage collected termcells : 145
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.003 s
% 0.21/0.54 # System time : 0.004 s
% 0.21/0.54 # Total time : 0.007 s
% 0.21/0.54 # Maximum resident set size: 1740 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.004 s
% 0.21/0.54 # System time : 0.006 s
% 0.21/0.54 # Total time : 0.011 s
% 0.21/0.54 # Maximum resident set size: 1716 pages
% 0.21/0.54 % E---3.1 exiting
% 0.21/0.54 % E exiting
%------------------------------------------------------------------------------