TSTP Solution File: FLD065-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : FLD065-1 : 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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:40:08 EDT 2024
% Result : Unsatisfiable 0.49s 0.63s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 48 ( 9 unt; 4 nHn; 48 RR)
% Number of literals : 112 ( 0 equ; 63 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(totality_of_order_relation,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/tmp/tmp.GN748RBKEl/E---3.1_16241.p',totality_of_order_relation) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.GN748RBKEl/E---3.1_16241.p',a_is_defined) ).
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.GN748RBKEl/E---3.1_16241.p',compatibility_of_equality_and_order_relation) ).
cnf(transitivity_of_order_relation,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.GN748RBKEl/E---3.1_16241.p',transitivity_of_order_relation) ).
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.GN748RBKEl/E---3.1_16241.p',symmetry_of_equality) ).
cnf(existence_of_identity_addition,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.GN748RBKEl/E---3.1_16241.p',existence_of_identity_addition) ).
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.GN748RBKEl/E---3.1_16241.p',compatibility_of_order_relation_and_addition) ).
cnf(transitivity_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.GN748RBKEl/E---3.1_16241.p',transitivity_of_equality) ).
cnf(existence_of_inverse_addition,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.GN748RBKEl/E---3.1_16241.p',existence_of_inverse_addition) ).
cnf(commutativity_addition,axiom,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/tmp/tmp.GN748RBKEl/E---3.1_16241.p',commutativity_addition) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.GN748RBKEl/E---3.1_16241.p',well_definedness_of_additive_inverse) ).
cnf(not_less_or_equal_3,negated_conjecture,
~ less_or_equal(additive_identity,a),
file('/export/starexec/sandbox/tmp/tmp.GN748RBKEl/E---3.1_16241.p',not_less_or_equal_3) ).
cnf(less_or_equal_2,negated_conjecture,
less_or_equal(additive_inverse(a),additive_identity),
file('/export/starexec/sandbox/tmp/tmp.GN748RBKEl/E---3.1_16241.p',less_or_equal_2) ).
cnf(c_0_13,plain,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
inference(fof_simplification,[status(thm)],[totality_of_order_relation]) ).
cnf(c_0_14,plain,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
c_0_13 ).
cnf(c_0_15,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_16,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
inference(fof_simplification,[status(thm)],[compatibility_of_equality_and_order_relation]) ).
cnf(c_0_17,hypothesis,
( less_or_equal(X1,a)
| less_or_equal(a,X1)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,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_19,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
c_0_16 ).
cnf(c_0_20,hypothesis,
less_or_equal(a,a),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_21,plain,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_22,plain,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_23,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
c_0_18 ).
cnf(c_0_24,hypothesis,
( less_or_equal(X1,a)
| ~ equalish(a,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
c_0_21 ).
cnf(c_0_26,plain,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
c_0_22 ).
cnf(c_0_27,hypothesis,
( less_or_equal(X1,a)
| ~ less_or_equal(X1,X2)
| ~ equalish(a,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( equalish(X1,add(additive_identity,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( less_or_equal(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ less_or_equal(X1,X3) ),
inference(fof_simplification,[status(thm)],[compatibility_of_order_relation_and_addition]) ).
cnf(c_0_30,plain,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_31,plain,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_32,hypothesis,
( less_or_equal(X1,a)
| ~ less_or_equal(X1,add(additive_identity,a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_15])]) ).
cnf(c_0_33,plain,
( less_or_equal(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ less_or_equal(X1,X3) ),
c_0_29 ).
cnf(c_0_34,plain,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
c_0_30 ).
cnf(c_0_35,plain,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
c_0_31 ).
cnf(c_0_36,plain,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_37,plain,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_38,hypothesis,
( less_or_equal(add(X1,a),a)
| ~ less_or_equal(X1,additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_15])]) ).
cnf(c_0_39,plain,
( equalish(X1,additive_identity)
| ~ defined(X2)
| ~ equalish(X1,add(X2,additive_inverse(X2))) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
c_0_36 ).
cnf(c_0_41,plain,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
c_0_37 ).
cnf(c_0_42,negated_conjecture,
~ less_or_equal(additive_identity,a),
inference(fof_simplification,[status(thm)],[not_less_or_equal_3]) ).
cnf(c_0_43,hypothesis,
( less_or_equal(X1,a)
| ~ less_or_equal(X2,additive_identity)
| ~ equalish(add(X2,a),X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_38]) ).
cnf(c_0_44,plain,
( equalish(add(additive_inverse(X1),X1),additive_identity)
| ~ defined(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_45,negated_conjecture,
less_or_equal(additive_inverse(a),additive_identity),
less_or_equal_2 ).
cnf(c_0_46,negated_conjecture,
~ less_or_equal(additive_identity,a),
c_0_42 ).
cnf(c_0_47,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_15])]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : FLD065-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n024.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 13:35:35 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.23/0.50 Running first-order theorem proving
% 0.23/0.50 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.GN748RBKEl/E---3.1_16241.p
% 0.49/0.63 # Version: 3.1.0
% 0.49/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.49/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.49/0.63 # Starting new_bool_3 with 300s (1) cores
% 0.49/0.63 # Starting new_bool_1 with 300s (1) cores
% 0.49/0.63 # Starting sh5l with 300s (1) cores
% 0.49/0.63 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16326 completed with status 0
% 0.49/0.63 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.49/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.49/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.49/0.63 # No SInE strategy applied
% 0.49/0.63 # Search class: FGUNF-FFMS21-SFFFFFNN
% 0.49/0.63 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.49/0.63 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 675s (1) cores
% 0.49/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.49/0.63 # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.49/0.63 # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.49/0.63 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 136s (1) cores
% 0.49/0.63 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16331 completed with status 0
% 0.49/0.63 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.49/0.63 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.49/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.49/0.63 # No SInE strategy applied
% 0.49/0.63 # Search class: FGUNF-FFMS21-SFFFFFNN
% 0.49/0.63 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.49/0.63 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 675s (1) cores
% 0.49/0.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.49/0.63 # Preprocessing time : 0.001 s
% 0.49/0.63 # Presaturation interreduction done
% 0.49/0.63
% 0.49/0.63 # Proof found!
% 0.49/0.63 # SZS status Unsatisfiable
% 0.49/0.63 # SZS output start CNFRefutation
% See solution above
% 0.49/0.63 # Parsed axioms : 30
% 0.49/0.63 # Removed by relevancy pruning/SinE : 0
% 0.49/0.63 # Initial clauses : 30
% 0.49/0.63 # Removed in clause preprocessing : 0
% 0.49/0.63 # Initial clauses in saturation : 30
% 0.49/0.63 # Processed clauses : 842
% 0.49/0.63 # ...of these trivial : 6
% 0.49/0.63 # ...subsumed : 331
% 0.49/0.63 # ...remaining for further processing : 505
% 0.49/0.63 # Other redundant clauses eliminated : 0
% 0.49/0.63 # Clauses deleted for lack of memory : 0
% 0.49/0.63 # Backward-subsumed : 13
% 0.49/0.63 # Backward-rewritten : 1
% 0.49/0.63 # Generated clauses : 3548
% 0.49/0.63 # ...of the previous two non-redundant : 3297
% 0.49/0.63 # ...aggressively subsumed : 0
% 0.49/0.63 # Contextual simplify-reflections : 2
% 0.49/0.63 # Paramodulations : 3547
% 0.49/0.63 # Factorizations : 0
% 0.49/0.63 # NegExts : 0
% 0.49/0.63 # Equation resolutions : 0
% 0.49/0.63 # Disequality decompositions : 0
% 0.49/0.63 # Total rewrite steps : 847
% 0.49/0.63 # ...of those cached : 818
% 0.49/0.63 # Propositional unsat checks : 0
% 0.49/0.63 # Propositional check models : 0
% 0.49/0.63 # Propositional check unsatisfiable : 0
% 0.49/0.63 # Propositional clauses : 0
% 0.49/0.63 # Propositional clauses after purity: 0
% 0.49/0.63 # Propositional unsat core size : 0
% 0.49/0.63 # Propositional preprocessing time : 0.000
% 0.49/0.63 # Propositional encoding time : 0.000
% 0.49/0.63 # Propositional solver time : 0.000
% 0.49/0.63 # Success case prop preproc time : 0.000
% 0.49/0.63 # Success case prop encoding time : 0.000
% 0.49/0.63 # Success case prop solver time : 0.000
% 0.49/0.63 # Current number of processed clauses : 460
% 0.49/0.63 # Positive orientable unit clauses : 34
% 0.49/0.63 # Positive unorientable unit clauses: 0
% 0.49/0.63 # Negative unit clauses : 4
% 0.49/0.63 # Non-unit-clauses : 422
% 0.49/0.63 # Current number of unprocessed clauses: 2494
% 0.49/0.63 # ...number of literals in the above : 8361
% 0.49/0.63 # Current number of archived formulas : 0
% 0.49/0.63 # Current number of archived clauses : 45
% 0.49/0.63 # Clause-clause subsumption calls (NU) : 14501
% 0.49/0.63 # Rec. Clause-clause subsumption calls : 12890
% 0.49/0.63 # Non-unit clause-clause subsumptions : 303
% 0.49/0.63 # Unit Clause-clause subsumption calls : 118
% 0.49/0.63 # Rewrite failures with RHS unbound : 0
% 0.49/0.63 # BW rewrite match attempts : 1
% 0.49/0.63 # BW rewrite match successes : 1
% 0.49/0.63 # Condensation attempts : 0
% 0.49/0.63 # Condensation successes : 0
% 0.49/0.63 # Termbank termtop insertions : 49805
% 0.49/0.63 # Search garbage collected termcells : 71
% 0.49/0.63
% 0.49/0.63 # -------------------------------------------------
% 0.49/0.63 # User time : 0.101 s
% 0.49/0.63 # System time : 0.006 s
% 0.49/0.63 # Total time : 0.106 s
% 0.49/0.63 # Maximum resident set size: 1660 pages
% 0.49/0.63
% 0.49/0.63 # -------------------------------------------------
% 0.49/0.63 # User time : 0.502 s
% 0.49/0.63 # System time : 0.037 s
% 0.49/0.63 # Total time : 0.539 s
% 0.49/0.63 # Maximum resident set size: 1712 pages
% 0.49/0.63 % E---3.1 exiting
% 0.49/0.63 % E exiting
%------------------------------------------------------------------------------