%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : FLD009-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 : n014.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:10 PM UTC 2026
% Result : Unsatisfiable 1.44s 1.77s
% Output : CNFRefutation 1.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 28 ( 13 unt; 4 nHn; 28 RR)
% Number of literals : 55 ( 0 equ; 27 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 29 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(existence_of_identity_multiplication,axiom,
( equalish(multiply(multiplicative_identity,X1),X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_identity_multiplication) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
cnf(existence_of_inverse_multiplication,axiom,
( equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| equalish(X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_multiplication) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(a_not_equal_to_additive_identity_3,negated_conjecture,
~ equalish(a,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_not_equal_to_additive_identity_3) ).
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(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(well_definedness_of_multiplicative_inverse,axiom,
( defined(multiplicative_inverse(X1))
| equalish(X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_multiplicative_inverse) ).
cnf(associativity_multiplication,axiom,
( equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',associativity_multiplication) ).
cnf(multiply_not_equal_to_b_4,negated_conjecture,
~ equalish(multiply(a,X1),b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_not_equal_to_b_4) ).
cnf(c_0_10,axiom,
( equalish(multiply(multiplicative_identity,X1),X1)
| ~ defined(X1) ),
existence_of_identity_multiplication ).
cnf(c_0_11,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_12,axiom,
( equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)
| equalish(X1,additive_identity)
| ~ defined(X1) ),
existence_of_inverse_multiplication ).
cnf(c_0_13,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_14,negated_conjecture,
~ equalish(a,additive_identity),
a_not_equal_to_additive_identity_3 ).
cnf(c_0_15,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
transitivity_of_equality ).
cnf(c_0_16,hypothesis,
equalish(multiply(multiplicative_identity,b),b),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,axiom,
( equalish(multiply(X1,X2),multiply(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
compatibility_of_equality_and_multiplication ).
cnf(c_0_18,hypothesis,
equalish(multiply(a,multiplicative_inverse(a)),multiplicative_identity),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_19,hypothesis,
( equalish(X1,b)
| ~ equalish(X1,multiply(multiplicative_identity,b)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,hypothesis,
( equalish(multiply(multiply(a,multiplicative_inverse(a)),X1),multiply(multiplicative_identity,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,hypothesis,
equalish(multiply(multiply(a,multiplicative_inverse(a)),b),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_11])]) ).
cnf(c_0_22,axiom,
( defined(multiplicative_inverse(X1))
| equalish(X1,additive_identity)
| ~ defined(X1) ),
well_definedness_of_multiplicative_inverse ).
cnf(c_0_23,hypothesis,
( equalish(X1,b)
| ~ equalish(X1,multiply(multiply(a,multiplicative_inverse(a)),b)) ),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_24,axiom,
( equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
associativity_multiplication ).
cnf(c_0_25,hypothesis,
defined(multiplicative_inverse(a)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_13]),c_0_14]) ).
cnf(c_0_26,negated_conjecture,
~ equalish(multiply(a,X1),b),
multiply_not_equal_to_b_4 ).
cnf(c_0_27,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_11]),c_0_25]),c_0_13])]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD009-1 : TPTP v9.2.1. Bugfixed v2.1.0.
% 0.00/0.12 % 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.15/0.33 % Computer : n014.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 17:26:51 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.44/1.77 % Version : CSE_E---1.7
% 1.44/1.77 % Problem : theBenchmark.p
% 1.44/1.77 % SZS status Unsatisfiable for theBenchmark.p
% 1.44/1.77 % SZS output start CNFRefutation
% See solution above
% 1.44/1.78 % Total time : 1.368s
%------------------------------------------------------------------------------