TSTP Solution File: FLD067-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : FLD067-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 4.46s 0.99s
% Output : CNFRefutation 4.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 7 unt; 0 nHn; 17 RR)
% Number of literals : 34 ( 0 equ; 19 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(compatibility_of_equality_and_order_relation,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.MyEuFE7smk/E---3.1_28145.p',compatibility_of_equality_and_order_relation) ).
cnf(compatibility_of_order_relation_and_addition,axiom,
( less_or_equal(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ less_or_equal(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.MyEuFE7smk/E---3.1_28145.p',compatibility_of_order_relation_and_addition) ).
cnf(existence_of_inverse_addition,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.MyEuFE7smk/E---3.1_28145.p',existence_of_inverse_addition) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.MyEuFE7smk/E---3.1_28145.p',well_definedness_of_additive_inverse) ).
cnf(not_less_or_equal_4,negated_conjecture,
~ less_or_equal(additive_identity,add(b,additive_inverse(a))),
file('/export/starexec/sandbox/tmp/tmp.MyEuFE7smk/E---3.1_28145.p',not_less_or_equal_4) ).
cnf(less_or_equal_3,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox/tmp/tmp.MyEuFE7smk/E---3.1_28145.p',less_or_equal_3) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.MyEuFE7smk/E---3.1_28145.p',a_is_defined) ).
cnf(c_0_7,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
compatibility_of_equality_and_order_relation ).
cnf(c_0_8,axiom,
( less_or_equal(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ less_or_equal(X1,X3) ),
compatibility_of_order_relation_and_addition ).
cnf(c_0_9,plain,
( less_or_equal(X1,add(X2,X3))
| ~ less_or_equal(X4,X2)
| ~ defined(X3)
| ~ equalish(add(X4,X3),X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
existence_of_inverse_addition ).
cnf(c_0_11,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
well_definedness_of_additive_inverse ).
cnf(c_0_12,negated_conjecture,
~ less_or_equal(additive_identity,add(b,additive_inverse(a))),
not_less_or_equal_4 ).
cnf(c_0_13,plain,
( less_or_equal(additive_identity,add(X1,additive_inverse(X2)))
| ~ less_or_equal(X2,X1)
| ~ defined(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_14,negated_conjecture,
less_or_equal(a,b),
less_or_equal_3 ).
cnf(c_0_15,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : FLD067-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n016.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:52:22 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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.MyEuFE7smk/E---3.1_28145.p
% 4.46/0.99 # Version: 3.1pre001
% 4.46/0.99 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.46/0.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.46/0.99 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.46/0.99 # Starting new_bool_3 with 300s (1) cores
% 4.46/0.99 # Starting new_bool_1 with 300s (1) cores
% 4.46/0.99 # Starting sh5l with 300s (1) cores
% 4.46/0.99 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28222 completed with status 0
% 4.46/0.99 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.46/0.99 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.46/0.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.46/0.99 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.46/0.99 # No SInE strategy applied
% 4.46/0.99 # Search class: FGUNF-FFMS21-SFFFFFNN
% 4.46/0.99 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.46/0.99 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 675s (1) cores
% 4.46/0.99 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.46/0.99 # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.46/0.99 # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.46/0.99 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 136s (1) cores
% 4.46/0.99 # G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 28231 completed with status 0
% 4.46/0.99 # Result found by G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 4.46/0.99 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.46/0.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.46/0.99 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.46/0.99 # No SInE strategy applied
% 4.46/0.99 # Search class: FGUNF-FFMS21-SFFFFFNN
% 4.46/0.99 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.46/0.99 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 675s (1) cores
% 4.46/0.99 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.46/0.99 # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.46/0.99 # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.46/0.99 # Preprocessing time : 0.001 s
% 4.46/0.99 # Presaturation interreduction done
% 4.46/0.99
% 4.46/0.99 # Proof found!
% 4.46/0.99 # SZS status Unsatisfiable
% 4.46/0.99 # SZS output start CNFRefutation
% See solution above
% 4.46/0.99 # Parsed axioms : 31
% 4.46/0.99 # Removed by relevancy pruning/SinE : 0
% 4.46/0.99 # Initial clauses : 31
% 4.46/0.99 # Removed in clause preprocessing : 0
% 4.46/0.99 # Initial clauses in saturation : 31
% 4.46/0.99 # Processed clauses : 5264
% 4.46/0.99 # ...of these trivial : 27
% 4.46/0.99 # ...subsumed : 2965
% 4.46/0.99 # ...remaining for further processing : 2272
% 4.46/0.99 # Other redundant clauses eliminated : 0
% 4.46/0.99 # Clauses deleted for lack of memory : 0
% 4.46/0.99 # Backward-subsumed : 244
% 4.46/0.99 # Backward-rewritten : 10
% 4.46/0.99 # Generated clauses : 25923
% 4.46/0.99 # ...of the previous two non-redundant : 24887
% 4.46/0.99 # ...aggressively subsumed : 0
% 4.46/0.99 # Contextual simplify-reflections : 19
% 4.46/0.99 # Paramodulations : 25923
% 4.46/0.99 # Factorizations : 0
% 4.46/0.99 # NegExts : 0
% 4.46/0.99 # Equation resolutions : 0
% 4.46/0.99 # Total rewrite steps : 5901
% 4.46/0.99 # Propositional unsat checks : 0
% 4.46/0.99 # Propositional check models : 0
% 4.46/0.99 # Propositional check unsatisfiable : 0
% 4.46/0.99 # Propositional clauses : 0
% 4.46/0.99 # Propositional clauses after purity: 0
% 4.46/0.99 # Propositional unsat core size : 0
% 4.46/0.99 # Propositional preprocessing time : 0.000
% 4.46/0.99 # Propositional encoding time : 0.000
% 4.46/0.99 # Propositional solver time : 0.000
% 4.46/0.99 # Success case prop preproc time : 0.000
% 4.46/0.99 # Success case prop encoding time : 0.000
% 4.46/0.99 # Success case prop solver time : 0.000
% 4.46/0.99 # Current number of processed clauses : 1987
% 4.46/0.99 # Positive orientable unit clauses : 33
% 4.46/0.99 # Positive unorientable unit clauses: 0
% 4.46/0.99 # Negative unit clauses : 2
% 4.46/0.99 # Non-unit-clauses : 1952
% 4.46/0.99 # Current number of unprocessed clauses: 19472
% 4.46/0.99 # ...number of literals in the above : 68845
% 4.46/0.99 # Current number of archived formulas : 0
% 4.46/0.99 # Current number of archived clauses : 285
% 4.46/0.99 # Clause-clause subsumption calls (NU) : 239255
% 4.46/0.99 # Rec. Clause-clause subsumption calls : 167460
% 4.46/0.99 # Non-unit clause-clause subsumptions : 3194
% 4.46/0.99 # Unit Clause-clause subsumption calls : 1198
% 4.46/0.99 # Rewrite failures with RHS unbound : 0
% 4.46/0.99 # BW rewrite match attempts : 16
% 4.46/0.99 # BW rewrite match successes : 16
% 4.46/0.99 # Condensation attempts : 0
% 4.46/0.99 # Condensation successes : 0
% 4.46/0.99 # Termbank termtop insertions : 394853
% 4.46/0.99
% 4.46/0.99 # -------------------------------------------------
% 4.46/0.99 # User time : 0.531 s
% 4.46/0.99 # System time : 0.018 s
% 4.46/0.99 # Total time : 0.549 s
% 4.46/0.99 # Maximum resident set size: 1648 pages
% 4.46/0.99
% 4.46/0.99 # -------------------------------------------------
% 4.46/0.99 # User time : 2.661 s
% 4.46/0.99 # System time : 0.084 s
% 4.46/0.99 # Total time : 2.745 s
% 4.46/0.99 # Maximum resident set size: 1692 pages
% 4.46/0.99 % E---3.1 exiting
%------------------------------------------------------------------------------