%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP756-1 : 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 : 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:27:13 PM UTC 2026
% Result : Unsatisfiable 1.29s 1.68s
% Output : CNFRefutation 1.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 3 RR)
% Number of literals : 31 ( 30 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f05,axiom,
mult(X1,mult(mult(X2,X2),X3)) = mult(mult(X1,X2),mult(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
cnf(goals,negated_conjecture,
mult(mult(a,b),c) != mult(a,mult(b,c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c_0_6,axiom,
mult(X1,mult(mult(X2,X2),X3)) = mult(mult(X1,X2),mult(X2,X3)),
f05 ).
cnf(c_0_7,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_8,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_9,plain,
mult(rd(X1,X2),mult(mult(X2,X2),X3)) = mult(X1,mult(X2,X3)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_11,plain,
ld(mult(X1,X2),mult(X1,mult(mult(X2,X2),X3))) = mult(X2,X3),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_12,plain,
mult(X1,mult(X2,ld(mult(X2,X2),X3))) = mult(rd(X1,X2),X3),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
ld(mult(X1,X2),mult(X1,X3)) = mult(X2,ld(mult(X2,X2),X3)),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_14,plain,
mult(rd(X1,X2),mult(X2,X3)) = mult(X1,mult(rd(X2,X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_12]) ).
cnf(c_0_15,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_16,plain,
mult(X1,mult(mult(X2,X2),ld(X2,X3))) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_17,plain,
mult(mult(X1,X2),mult(rd(X2,X2),X3)) = mult(X1,mult(X2,X3)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
rd(mult(X1,mult(mult(X2,X2),X3)),mult(X2,X3)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_15,c_0_6]) ).
cnf(c_0_19,plain,
ld(X1,mult(mult(X1,X2),X3)) = mult(mult(X2,X2),ld(X2,X3)),
inference(spm,[status(thm)],[c_0_8,c_0_16]) ).
cnf(c_0_20,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(spm,[status(thm)],[c_0_17,c_0_7]) ).
cnf(c_0_21,plain,
rd(mult(X1,X2),ld(mult(X3,X4),mult(X3,X2))) = mult(X1,X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_13]),c_0_10]) ).
cnf(c_0_22,plain,
mult(mult(X1,X1),ld(X1,X1)) = mult(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_8]) ).
cnf(c_0_23,plain,
mult(X1,ld(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_8]),c_0_15]) ).
cnf(c_0_24,plain,
mult(X1,rd(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_23]),c_0_7]),c_0_23]) ).
cnf(c_0_25,plain,
mult(X1,mult(mult(rd(X2,X3),rd(X2,X3)),X3)) = mult(mult(X1,rd(X2,X3)),X2),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_26,plain,
ld(X1,X1) = rd(X2,X2),
inference(spm,[status(thm)],[c_0_8,c_0_24]) ).
cnf(c_0_27,plain,
mult(X1,mult(ld(X2,X2),X3)) = mult(X1,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_23]),c_0_23]) ).
cnf(c_0_28,negated_conjecture,
mult(mult(a,b),c) != mult(a,mult(b,c)),
goals ).
cnf(c_0_29,plain,
mult(mult(X1,X2),X3) = mult(X1,mult(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_26]),c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : GRP756-1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.06 % 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.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 14:04:56 EDT 2026
% 0.06/0.25 % CPUTime :
% 0.09/0.25 % start to proof: theBenchmark
% 1.29/1.68 % Version : CSE_E---1.7
% 1.29/1.68 % Problem : theBenchmark.p
% 1.29/1.68 % SZS status Unsatisfiable for theBenchmark.p
% 1.29/1.68 % SZS output start CNFRefutation
% See solution above
% 1.29/1.68 % Total time : 1.362s
%------------------------------------------------------------------------------