%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : FLD025-1 : TPTP v9.2.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 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 : Tue May 5 04:18:16 PM UTC 2026
% Result : Unsatisfiable 1.20s 1.64s
% Output : CNFRefutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 29 ( 17 unt; 0 nHn; 29 RR)
% Number of literals : 50 ( 0 equ; 23 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(compatibility_of_equality_and_multiplication,axiom,
( equalish(multiply(X1,X2),multiply(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication) ).
cnf(a_equals_b_5,negated_conjecture,
equalish(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_equals_b_5) ).
cnf(transitivity_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
cnf(commutativity_multiplication,axiom,
( equalish(multiply(X1,X2),multiply(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',commutativity_multiplication) ).
cnf(c_equals_d_6,negated_conjecture,
equalish(c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_equals_d_6) ).
cnf(d_is_defined,hypothesis,
defined(d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_is_defined) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_is_defined) ).
cnf(multiply_not_equal_to_multiply_7,negated_conjecture,
~ equalish(multiply(a,c),multiply(d,b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_not_equal_to_multiply_7) ).
cnf(c_0_10,axiom,
( equalish(multiply(X1,X2),multiply(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
compatibility_of_equality_and_multiplication ).
cnf(c_0_11,negated_conjecture,
equalish(a,b),
a_equals_b_5 ).
cnf(c_0_12,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
transitivity_of_equality ).
cnf(c_0_13,axiom,
( equalish(multiply(X1,X2),multiply(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
commutativity_multiplication ).
cnf(c_0_14,negated_conjecture,
equalish(c,d),
c_equals_d_6 ).
cnf(c_0_15,negated_conjecture,
( equalish(multiply(a,X1),multiply(b,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( equalish(X1,multiply(X2,X3))
| ~ defined(X2)
| ~ defined(X3)
| ~ equalish(X1,multiply(X3,X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( equalish(multiply(c,X1),multiply(d,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_18,hypothesis,
defined(d),
d_is_defined ).
cnf(c_0_19,negated_conjecture,
( equalish(X1,multiply(b,X2))
| ~ defined(X2)
| ~ equalish(X1,multiply(a,X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( equalish(multiply(c,X1),multiply(X1,d))
| ~ defined(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_22,negated_conjecture,
equalish(multiply(c,a),multiply(b,d)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_18]),c_0_21])]) ).
cnf(c_0_23,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_24,negated_conjecture,
equalish(multiply(c,a),multiply(d,b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_22]),c_0_18]),c_0_23])]) ).
cnf(c_0_25,negated_conjecture,
( equalish(X1,multiply(d,b))
| ~ equalish(X1,multiply(c,a)) ),
inference(spm,[status(thm)],[c_0_12,c_0_24]) ).
cnf(c_0_26,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_27,negated_conjecture,
~ equalish(multiply(a,c),multiply(d,b)),
multiply_not_equal_to_multiply_7 ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_13]),c_0_26]),c_0_21])]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : FLD025-1 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.06 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.06/0.24 % Computer : n024.cluster.edu
% 0.06/0.24 % Model : x86_64 x86_64
% 0.06/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24 % Memory : 8042.1875MB
% 0.06/0.24 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24 % CPULimit : 300
% 0.06/0.24 % WCLimit : 300
% 0.06/0.24 % DateTime : Mon May 4 12:27:26 EDT 2026
% 0.06/0.24 % CPUTime :
% 0.06/0.24 % start to proof: theBenchmark
% 1.20/1.64 % Version : CSE_E---1.7
% 1.20/1.64 % Problem : theBenchmark.p
% 1.20/1.64 % SZS status Unsatisfiable for theBenchmark.p
% 1.20/1.64 % SZS output start CNFRefutation
% See solution above
% 1.20/1.65 % Total time : 1.361s
%------------------------------------------------------------------------------