TSTP Solution File: FLD060-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : FLD060-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:44 EDT 2023
% Result : Unsatisfiable 1.08s 0.61s
% Output : CNFRefutation 1.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 15 unt; 0 nHn; 28 RR)
% Number of literals : 51 ( 0 equ; 25 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(totality_of_addition,axiom,
( sum(X1,X2,add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.3bxwQ3PkEP/E---3.1_15565.p',totality_of_addition) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/tmp/tmp.3bxwQ3PkEP/E---3.1_15565.p',b_is_defined) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/tmp/tmp.3bxwQ3PkEP/E---3.1_15565.p',a_is_defined) ).
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.3bxwQ3PkEP/E---3.1_15565.p',compatibility_of_order_relation_and_addition) ).
cnf(commutativity_addition,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.3bxwQ3PkEP/E---3.1_15565.p',commutativity_addition) ).
cnf(less_or_equal_3,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/tmp/tmp.3bxwQ3PkEP/E---3.1_15565.p',less_or_equal_3) ).
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.3bxwQ3PkEP/E---3.1_15565.p',transitivity_of_order_relation) ).
cnf(not_less_or_equal_4,negated_conjecture,
~ less_or_equal(add(a,a),add(b,b)),
file('/export/starexec/sandbox2/tmp/tmp.3bxwQ3PkEP/E---3.1_15565.p',not_less_or_equal_4) ).
cnf(c_0_8,axiom,
( sum(X1,X2,add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
totality_of_addition ).
cnf(c_0_9,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_10,hypothesis,
( sum(X1,b,add(X1,b))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_12,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_13,hypothesis,
sum(b,b,add(b,b)),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_14,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
commutativity_addition ).
cnf(c_0_15,hypothesis,
sum(a,b,add(a,b)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,hypothesis,
( less_or_equal(X1,add(b,b))
| ~ less_or_equal(X2,b)
| ~ sum(X2,b,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
less_or_equal(a,b),
less_or_equal_3 ).
cnf(c_0_18,hypothesis,
sum(b,a,add(a,b)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,hypothesis,
( sum(X1,a,add(X1,a))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_20,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
transitivity_of_order_relation ).
cnf(c_0_21,hypothesis,
less_or_equal(add(a,b),add(b,b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_17])]) ).
cnf(c_0_22,hypothesis,
( less_or_equal(X1,add(a,b))
| ~ less_or_equal(X2,b)
| ~ sum(X2,a,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_23,hypothesis,
sum(a,a,add(a,a)),
inference(spm,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_24,negated_conjecture,
~ less_or_equal(add(a,a),add(b,b)),
not_less_or_equal_4 ).
cnf(c_0_25,hypothesis,
( less_or_equal(X1,add(b,b))
| ~ less_or_equal(X1,add(a,b)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,hypothesis,
less_or_equal(add(a,a),add(a,b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_17])]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : FLD060-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 22:33:56 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.3bxwQ3PkEP/E---3.1_15565.p
% 1.08/0.61 # Version: 3.1pre001
% 1.08/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.08/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.08/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.08/0.61 # Starting new_bool_3 with 300s (1) cores
% 1.08/0.61 # Starting new_bool_1 with 300s (1) cores
% 1.08/0.61 # Starting sh5l with 300s (1) cores
% 1.08/0.61 # new_bool_1 with pid 15644 completed with status 0
% 1.08/0.61 # Result found by new_bool_1
% 1.08/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.08/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.08/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.08/0.61 # Starting new_bool_3 with 300s (1) cores
% 1.08/0.61 # Starting new_bool_1 with 300s (1) cores
% 1.08/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.08/0.61 # Search class: FGUNF-FFMS22-SFFFFFNN
% 1.08/0.61 # partial match(1): FGUNF-FFMS21-SFFFFFNN
% 1.08/0.61 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.08/0.61 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 135s (1) cores
% 1.08/0.61 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 15646 completed with status 0
% 1.08/0.61 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 1.08/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.08/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.08/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.08/0.61 # Starting new_bool_3 with 300s (1) cores
% 1.08/0.61 # Starting new_bool_1 with 300s (1) cores
% 1.08/0.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.08/0.61 # Search class: FGUNF-FFMS22-SFFFFFNN
% 1.08/0.61 # partial match(1): FGUNF-FFMS21-SFFFFFNN
% 1.08/0.61 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.08/0.61 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 135s (1) cores
% 1.08/0.61 # Preprocessing time : 0.001 s
% 1.08/0.61 # Presaturation interreduction done
% 1.08/0.61
% 1.08/0.61 # Proof found!
% 1.08/0.61 # SZS status Unsatisfiable
% 1.08/0.61 # SZS output start CNFRefutation
% See solution above
% 1.08/0.61 # Parsed axioms : 30
% 1.08/0.61 # Removed by relevancy pruning/SinE : 9
% 1.08/0.61 # Initial clauses : 21
% 1.08/0.61 # Removed in clause preprocessing : 0
% 1.08/0.61 # Initial clauses in saturation : 21
% 1.08/0.61 # Processed clauses : 1360
% 1.08/0.61 # ...of these trivial : 14
% 1.08/0.61 # ...subsumed : 471
% 1.08/0.61 # ...remaining for further processing : 875
% 1.08/0.61 # Other redundant clauses eliminated : 0
% 1.08/0.61 # Clauses deleted for lack of memory : 0
% 1.08/0.61 # Backward-subsumed : 16
% 1.08/0.61 # Backward-rewritten : 1
% 1.08/0.61 # Generated clauses : 5714
% 1.08/0.61 # ...of the previous two non-redundant : 4420
% 1.08/0.61 # ...aggressively subsumed : 0
% 1.08/0.61 # Contextual simplify-reflections : 17
% 1.08/0.61 # Paramodulations : 5702
% 1.08/0.61 # Factorizations : 12
% 1.08/0.61 # NegExts : 0
% 1.08/0.61 # Equation resolutions : 0
% 1.08/0.61 # Total rewrite steps : 1779
% 1.08/0.61 # Propositional unsat checks : 0
% 1.08/0.61 # Propositional check models : 0
% 1.08/0.61 # Propositional check unsatisfiable : 0
% 1.08/0.61 # Propositional clauses : 0
% 1.08/0.61 # Propositional clauses after purity: 0
% 1.08/0.61 # Propositional unsat core size : 0
% 1.08/0.61 # Propositional preprocessing time : 0.000
% 1.08/0.61 # Propositional encoding time : 0.000
% 1.08/0.61 # Propositional solver time : 0.000
% 1.08/0.61 # Success case prop preproc time : 0.000
% 1.08/0.61 # Success case prop encoding time : 0.000
% 1.08/0.61 # Success case prop solver time : 0.000
% 1.08/0.61 # Current number of processed clauses : 837
% 1.08/0.61 # Positive orientable unit clauses : 105
% 1.08/0.61 # Positive unorientable unit clauses: 0
% 1.08/0.61 # Negative unit clauses : 1
% 1.08/0.61 # Non-unit-clauses : 731
% 1.08/0.61 # Current number of unprocessed clauses: 3094
% 1.08/0.61 # ...number of literals in the above : 10164
% 1.08/0.61 # Current number of archived formulas : 0
% 1.08/0.61 # Current number of archived clauses : 38
% 1.08/0.61 # Clause-clause subsumption calls (NU) : 47177
% 1.08/0.61 # Rec. Clause-clause subsumption calls : 42456
% 1.08/0.61 # Non-unit clause-clause subsumptions : 504
% 1.08/0.61 # Unit Clause-clause subsumption calls : 4908
% 1.08/0.61 # Rewrite failures with RHS unbound : 0
% 1.08/0.61 # BW rewrite match attempts : 77
% 1.08/0.61 # BW rewrite match successes : 1
% 1.08/0.61 # Condensation attempts : 0
% 1.08/0.61 # Condensation successes : 0
% 1.08/0.61 # Termbank termtop insertions : 78128
% 1.08/0.61
% 1.08/0.61 # -------------------------------------------------
% 1.08/0.61 # User time : 0.106 s
% 1.08/0.61 # System time : 0.004 s
% 1.08/0.61 # Total time : 0.110 s
% 1.08/0.61 # Maximum resident set size: 1792 pages
% 1.08/0.61
% 1.08/0.61 # -------------------------------------------------
% 1.08/0.61 # User time : 0.107 s
% 1.08/0.61 # System time : 0.007 s
% 1.08/0.61 # Total time : 0.114 s
% 1.08/0.61 # Maximum resident set size: 1696 pages
% 1.08/0.61 % E---3.1 exiting
%------------------------------------------------------------------------------