TSTP Solution File: FLD071-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD071-2 : 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:17 EDT 2023
% Result : Unsatisfiable 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 28 ( 14 unt; 2 nHn; 28 RR)
% Number of literals : 52 ( 0 equ; 24 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.cEmS3X1I9y/E---3.1_21277.p',symmetry_of_equality) ).
cnf(multiply_equals_u_6,negated_conjecture,
equalish(multiply(a,b),u),
file('/export/starexec/sandbox2/tmp/tmp.cEmS3X1I9y/E---3.1_21277.p',multiply_equals_u_6) ).
cnf(compatibility_of_equality_and_order_relation,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.cEmS3X1I9y/E---3.1_21277.p',compatibility_of_equality_and_order_relation) ).
cnf(totality_of_order_relation,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.cEmS3X1I9y/E---3.1_21277.p',totality_of_order_relation) ).
cnf(u_is_defined,hypothesis,
defined(u),
file('/export/starexec/sandbox2/tmp/tmp.cEmS3X1I9y/E---3.1_21277.p',u_is_defined) ).
cnf(compatibility_of_order_relation_and_multiplication,axiom,
( less_or_equal(additive_identity,multiply(X1,X2))
| ~ less_or_equal(additive_identity,X1)
| ~ less_or_equal(additive_identity,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.cEmS3X1I9y/E---3.1_21277.p',compatibility_of_order_relation_and_multiplication) ).
cnf(less_or_equal_5,negated_conjecture,
less_or_equal(additive_identity,b),
file('/export/starexec/sandbox2/tmp/tmp.cEmS3X1I9y/E---3.1_21277.p',less_or_equal_5) ).
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.cEmS3X1I9y/E---3.1_21277.p',transitivity_of_order_relation) ).
cnf(less_or_equal_4,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox2/tmp/tmp.cEmS3X1I9y/E---3.1_21277.p',less_or_equal_4) ).
cnf(not_less_or_equal_7,negated_conjecture,
~ less_or_equal(additive_identity,u),
file('/export/starexec/sandbox2/tmp/tmp.cEmS3X1I9y/E---3.1_21277.p',not_less_or_equal_7) ).
cnf(c_0_10,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
symmetry_of_equality ).
cnf(c_0_11,negated_conjecture,
equalish(multiply(a,b),u),
multiply_equals_u_6 ).
cnf(c_0_12,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
compatibility_of_equality_and_order_relation ).
cnf(c_0_13,negated_conjecture,
equalish(u,multiply(a,b)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
totality_of_order_relation ).
cnf(c_0_15,negated_conjecture,
( less_or_equal(multiply(a,b),X1)
| ~ less_or_equal(u,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( less_or_equal(X1,X1)
| ~ defined(X1) ),
inference(ef,[status(thm)],[c_0_14]) ).
cnf(c_0_17,hypothesis,
defined(u),
u_is_defined ).
cnf(c_0_18,axiom,
( less_or_equal(additive_identity,multiply(X1,X2))
| ~ less_or_equal(additive_identity,X1)
| ~ less_or_equal(additive_identity,X2) ),
compatibility_of_order_relation_and_multiplication ).
cnf(c_0_19,negated_conjecture,
less_or_equal(additive_identity,b),
less_or_equal_5 ).
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,negated_conjecture,
less_or_equal(multiply(a,b),u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_22,negated_conjecture,
( less_or_equal(additive_identity,multiply(X1,b))
| ~ less_or_equal(additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
less_or_equal(additive_identity,a),
less_or_equal_4 ).
cnf(c_0_24,negated_conjecture,
( less_or_equal(X1,u)
| ~ less_or_equal(X1,multiply(a,b)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
less_or_equal(additive_identity,multiply(a,b)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
~ less_or_equal(additive_identity,u),
not_less_or_equal_7 ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : FLD071-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n017.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 : 2400
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon Oct 2 22:49:56 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.cEmS3X1I9y/E---3.1_21277.p
% 0.21/0.51 # Version: 3.1pre001
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # sh5l with pid 21358 completed with status 0
% 0.21/0.51 # Result found by sh5l
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.51 # Search class: FGUNF-FFMM21-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 118s (1) cores
% 0.21/0.51 # G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with pid 21361 completed with status 0
% 0.21/0.51 # Result found by G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.51 # Search class: FGUNF-FFMM21-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 118s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Unsatisfiable
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 34
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 34
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 34
% 0.21/0.51 # Processed clauses : 85
% 0.21/0.51 # ...of these trivial : 1
% 0.21/0.51 # ...subsumed : 4
% 0.21/0.51 # ...remaining for further processing : 80
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 0
% 0.21/0.51 # Backward-rewritten : 0
% 0.21/0.51 # Generated clauses : 283
% 0.21/0.51 # ...of the previous two non-redundant : 240
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 281
% 0.21/0.51 # Factorizations : 2
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Total rewrite steps : 104
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 80
% 0.21/0.51 # Positive orientable unit clauses : 24
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 2
% 0.21/0.51 # Non-unit-clauses : 54
% 0.21/0.51 # Current number of unprocessed clauses: 189
% 0.21/0.51 # ...number of literals in the above : 496
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 0
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 253
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 234
% 0.21/0.51 # Non-unit clause-clause subsumptions : 4
% 0.21/0.51 # Unit Clause-clause subsumption calls : 36
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 0
% 0.21/0.51 # BW rewrite match successes : 0
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 3955
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.008 s
% 0.21/0.51 # System time : 0.000 s
% 0.21/0.51 # Total time : 0.008 s
% 0.21/0.51 # Maximum resident set size: 1764 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.009 s
% 0.21/0.51 # System time : 0.003 s
% 0.21/0.51 # Total time : 0.012 s
% 0.21/0.51 # Maximum resident set size: 1700 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------