TSTP Solution File: FLD025-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD025-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:29:59 EDT 2023
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 35 ( 21 unt; 0 nHn; 35 RR)
% Number of literals : 57 ( 0 equ; 24 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.MwamYwGsS6/E---3.1_16659.p',transitivity_of_equality) ).
cnf(multiply_equals_v_10,negated_conjecture,
equalish(multiply(d,b),v),
file('/export/starexec/sandbox/tmp/tmp.MwamYwGsS6/E---3.1_16659.p',multiply_equals_v_10) ).
cnf(compatibility_of_equality_and_multiplication,axiom,
( equalish(multiply(X1,X2),multiply(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.MwamYwGsS6/E---3.1_16659.p',compatibility_of_equality_and_multiplication) ).
cnf(c_equals_d_8,negated_conjecture,
equalish(c,d),
file('/export/starexec/sandbox/tmp/tmp.MwamYwGsS6/E---3.1_16659.p',c_equals_d_8) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/tmp/tmp.MwamYwGsS6/E---3.1_16659.p',b_is_defined) ).
cnf(commutativity_multiplication,axiom,
( equalish(multiply(X1,X2),multiply(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/tmp/tmp.MwamYwGsS6/E---3.1_16659.p',commutativity_multiplication) ).
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.MwamYwGsS6/E---3.1_16659.p',symmetry_of_equality) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox/tmp/tmp.MwamYwGsS6/E---3.1_16659.p',c_is_defined) ).
cnf(a_equals_b_7,negated_conjecture,
equalish(a,b),
file('/export/starexec/sandbox/tmp/tmp.MwamYwGsS6/E---3.1_16659.p',a_equals_b_7) ).
cnf(multiply_equals_u_9,negated_conjecture,
equalish(multiply(a,c),u),
file('/export/starexec/sandbox/tmp/tmp.MwamYwGsS6/E---3.1_16659.p',multiply_equals_u_9) ).
cnf(v_not_equal_to_u_11,negated_conjecture,
~ equalish(v,u),
file('/export/starexec/sandbox/tmp/tmp.MwamYwGsS6/E---3.1_16659.p',v_not_equal_to_u_11) ).
cnf(c_0_11,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
transitivity_of_equality ).
cnf(c_0_12,negated_conjecture,
equalish(multiply(d,b),v),
multiply_equals_v_10 ).
cnf(c_0_13,axiom,
( equalish(multiply(X1,X2),multiply(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
compatibility_of_equality_and_multiplication ).
cnf(c_0_14,negated_conjecture,
equalish(c,d),
c_equals_d_8 ).
cnf(c_0_15,negated_conjecture,
( equalish(X1,v)
| ~ equalish(X1,multiply(d,b)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( equalish(multiply(c,X1),multiply(d,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_18,axiom,
( equalish(multiply(X1,X2),multiply(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
commutativity_multiplication ).
cnf(c_0_19,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
symmetry_of_equality ).
cnf(c_0_20,negated_conjecture,
equalish(multiply(c,b),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_21,plain,
( equalish(X1,multiply(X2,X3))
| ~ defined(X2)
| ~ defined(X3)
| ~ equalish(X1,multiply(X3,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
equalish(v,multiply(c,b)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_24,negated_conjecture,
equalish(v,multiply(b,c)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_17]),c_0_23])]) ).
cnf(c_0_25,negated_conjecture,
equalish(multiply(b,c),v),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
equalish(a,b),
a_equals_b_7 ).
cnf(c_0_27,negated_conjecture,
( equalish(X1,v)
| ~ equalish(X1,multiply(b,c)) ),
inference(spm,[status(thm)],[c_0_11,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( equalish(multiply(a,X1),multiply(b,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
equalish(multiply(a,c),u),
multiply_equals_u_9 ).
cnf(c_0_30,negated_conjecture,
equalish(multiply(a,c),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_23])]) ).
cnf(c_0_31,negated_conjecture,
( equalish(X1,u)
| ~ equalish(X1,multiply(a,c)) ),
inference(spm,[status(thm)],[c_0_11,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
equalish(v,multiply(a,c)),
inference(spm,[status(thm)],[c_0_19,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ equalish(v,u),
v_not_equal_to_u_11 ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : FLD025-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n012.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 23:15:35 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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.MwamYwGsS6/E---3.1_16659.p
% 0.20/0.52 # Version: 3.1pre001
% 0.20/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # sh5l with pid 16740 completed with status 0
% 0.20/0.52 # Result found by sh5l
% 0.20/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.52 # Search class: FGUNF-FFMM21-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 118s (1) cores
% 0.20/0.52 # G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with pid 16745 completed with status 0
% 0.20/0.52 # Result found by G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 0.20/0.52 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.52 # Search class: FGUNF-FFMM21-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.52 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 118s (1) cores
% 0.20/0.52 # Preprocessing time : 0.001 s
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Unsatisfiable
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 38
% 0.20/0.52 # Removed by relevancy pruning/SinE : 0
% 0.20/0.52 # Initial clauses : 38
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 38
% 0.20/0.52 # Processed clauses : 191
% 0.20/0.52 # ...of these trivial : 0
% 0.20/0.52 # ...subsumed : 6
% 0.20/0.52 # ...remaining for further processing : 185
% 0.20/0.52 # Other redundant clauses eliminated : 0
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 0
% 0.20/0.52 # Backward-rewritten : 0
% 0.20/0.52 # Generated clauses : 938
% 0.20/0.52 # ...of the previous two non-redundant : 647
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 0
% 0.20/0.52 # Paramodulations : 936
% 0.20/0.52 # Factorizations : 2
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 0
% 0.20/0.52 # Total rewrite steps : 520
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 185
% 0.20/0.52 # Positive orientable unit clauses : 80
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 2
% 0.20/0.52 # Non-unit-clauses : 103
% 0.20/0.52 # Current number of unprocessed clauses: 489
% 0.20/0.52 # ...number of literals in the above : 1043
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 0
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 1564
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 1423
% 0.20/0.52 # Non-unit clause-clause subsumptions : 6
% 0.20/0.52 # Unit Clause-clause subsumption calls : 257
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 0
% 0.20/0.52 # BW rewrite match successes : 0
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 10743
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.013 s
% 0.20/0.52 # System time : 0.001 s
% 0.20/0.52 # Total time : 0.014 s
% 0.20/0.52 # Maximum resident set size: 1764 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.015 s
% 0.20/0.52 # System time : 0.003 s
% 0.20/0.52 # Total time : 0.018 s
% 0.20/0.52 # Maximum resident set size: 1700 pages
% 0.20/0.52 % E---3.1 exiting
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------