%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP748-3 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n027.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:27:12 PM UTC 2026
% Result : Unsatisfiable 1.54s 1.80s
% Output : CNFRefutation 1.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 23 unt; 4 nHn; 6 RR)
% Number of literals : 35 ( 34 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f11,axiom,
( mult(X1,X2) = mult(X2,X1)
| mult(i(X1),mult(X1,X2)) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f11) ).
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
cnf(f08,axiom,
mult(mult(X1,X2),i(X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).
cnf(f07,axiom,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(mult(X2,X3),X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f07) ).
cnf(f10,axiom,
mult(i(X1),X1) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f10) ).
cnf(f06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).
cnf(f09,axiom,
mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
cnf(goals,negated_conjecture,
mult(a,mult(b,mult(c,b))) != mult(mult(mult(a,b),c),b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c_0_9,axiom,
( mult(X1,X2) = mult(X2,X1)
| mult(i(X1),mult(X1,X2)) = X2 ),
f11 ).
cnf(c_0_10,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_11,axiom,
mult(mult(X1,X2),i(X2)) = X1,
f08 ).
cnf(c_0_12,plain,
( ld(X1,X2) = mult(i(X1),X2)
| mult(ld(X1,X2),X1) = X2 ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( ld(X1,X2) = mult(i(X1),X2)
| ld(X1,X2) = mult(X2,i(X1)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(mult(X2,X3),X2)),
f07 ).
cnf(c_0_15,axiom,
mult(i(X1),X1) = unit,
f10 ).
cnf(c_0_16,axiom,
mult(unit,X1) = X1,
f06 ).
cnf(c_0_17,plain,
( ld(X1,X2) = mult(X2,i(X1))
| mult(i(X1),X2) != mult(X2,i(X1)) ),
inference(ef,[status(thm)],[c_0_13]) ).
cnf(c_0_18,axiom,
mult(X1,i(X1)) = unit,
f09 ).
cnf(c_0_19,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_20,plain,
mult(i(X1),mult(mult(X1,X2),X1)) = mult(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_21,plain,
( mult(X1,mult(X2,i(X1))) = X2
| mult(i(X1),X2) != mult(X2,i(X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_22,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_18]),c_0_16]) ).
cnf(c_0_23,negated_conjecture,
mult(a,mult(b,mult(c,b))) != mult(mult(mult(a,b),c),b),
goals ).
cnf(c_0_24,plain,
ld(i(X1),mult(X2,X1)) = mult(mult(X1,X2),X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
ld(i(X1),X2) = mult(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_12]),c_0_22]),c_0_10])]) ).
cnf(c_0_26,negated_conjecture,
mult(a,mult(mult(b,c),b)) != mult(a,mult(b,mult(c,b))),
inference(rw,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_27,plain,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP748-3 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.34 % Computer : n027.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Mon May 4 19:18:04 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 1.54/1.80 % Version : CSE_E---1.7
% 1.54/1.80 % Problem : theBenchmark.p
% 1.54/1.80 % SZS status Unsatisfiable for theBenchmark.p
% 1.54/1.80 % SZS output start CNFRefutation
% See solution above
% 1.54/1.81 % Total time : 1.375s
%------------------------------------------------------------------------------