%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP710-11 : TPTP v9.2.1. Released v8.1.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 : n009.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:08 PM UTC 2026
% Result : Unsatisfiable 1.27s 1.97s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of clauses : 40 ( 40 unt; 0 nHn; 5 RR)
% Number of literals : 40 ( 39 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 65 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f01,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
cnf(f03,axiom,
mult(X1,mult(X2,mult(X2,X3))) = mult(mult(mult(X1,X2),X2),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
cnf(f05,axiom,
mult(i(X1),X1) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
cnf(f02,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
cnf(f04,axiom,
mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
cnf(goal,negated_conjecture,
mult(X1,x4) != x3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(c_0_6,axiom,
mult(X1,unit) = X1,
f01 ).
cnf(c_0_7,axiom,
mult(X1,mult(X2,mult(X2,X3))) = mult(mult(mult(X1,X2),X2),X3),
f03 ).
cnf(c_0_8,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_6]) ).
cnf(c_0_9,axiom,
mult(i(X1),X1) = unit,
f05 ).
cnf(c_0_10,axiom,
mult(unit,X1) = X1,
f02 ).
cnf(c_0_11,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(X1,mult(X2,mult(X2,X3))),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
mult(i(X1),mult(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_13,plain,
mult(i(X1),mult(X1,mult(X1,X2))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
mult(i(mult(X1,X1)),mult(X1,mult(X1,X2))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_9]),c_0_10]) ).
cnf(c_0_15,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_12]),c_0_9]),c_0_6]) ).
cnf(c_0_16,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_10]),c_0_10]) ).
cnf(c_0_17,plain,
mult(X1,mult(X1,mult(i(mult(X1,X1)),X2))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]) ).
cnf(c_0_18,plain,
mult(i(X1),mult(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_19,axiom,
mult(X1,i(X1)) = unit,
f04 ).
cnf(c_0_20,plain,
mult(X1,mult(i(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_21,plain,
mult(X1,mult(X2,mult(X2,i(mult(X1,mult(X2,X2)))))) = unit,
inference(spm,[status(thm)],[c_0_19,c_0_11]) ).
cnf(c_0_22,plain,
mult(i(mult(X1,X1)),mult(X1,X2)) = mult(i(X1),X2),
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
cnf(c_0_23,plain,
mult(X1,mult(X1,i(mult(X2,mult(X1,X1))))) = i(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_21]),c_0_6]) ).
cnf(c_0_24,plain,
mult(i(mult(X1,X1)),i(X2)) = i(mult(X2,mult(X1,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_18]) ).
cnf(c_0_25,plain,
i(mult(i(X1),mult(X2,X2))) = mult(i(mult(X2,X2)),X1),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_26,plain,
mult(X1,mult(i(X1),i(X1))) = i(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_19]),c_0_10]) ).
cnf(c_0_27,plain,
i(mult(i(mult(X1,X1)),X2)) = mult(i(X2),mult(X1,X1)),
inference(spm,[status(thm)],[c_0_15,c_0_25]) ).
cnf(c_0_28,plain,
mult(i(X1),i(X1)) = i(mult(X1,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_26]),c_0_19]),c_0_6]) ).
cnf(c_0_29,plain,
mult(i(X1),i(mult(X2,X2))) = i(mult(X2,mult(X2,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_15]),c_0_16]) ).
cnf(c_0_30,plain,
mult(X1,i(mult(X2,mult(X2,X1)))) = i(mult(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_29]),c_0_15]) ).
cnf(c_0_31,plain,
mult(i(mult(X1,mult(X2,X2))),X1) = i(mult(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_23]),c_0_15]) ).
cnf(c_0_32,plain,
i(mult(X1,i(mult(X2,X2)))) = mult(X2,mult(X2,i(X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_28]),c_0_15]),c_0_16]) ).
cnf(c_0_33,negated_conjecture,
mult(X1,x4) != x3,
goal ).
cnf(c_0_34,plain,
mult(mult(X1,mult(X1,i(X2))),X2) = mult(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_28]),c_0_32]),c_0_15]) ).
cnf(c_0_35,plain,
i(mult(X1,mult(X1,i(X2)))) = mult(X2,i(mult(X1,X1))),
inference(spm,[status(thm)],[c_0_15,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
mult(X1,mult(x4,x4)) != x3,
inference(spm,[status(thm)],[c_0_33,c_0_8]) ).
cnf(c_0_37,plain,
mult(mult(X1,i(mult(X2,X2))),mult(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_34]),c_0_35]) ).
cnf(c_0_38,negated_conjecture,
X1 != x3,
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.38 % Problem : GRP710-11 : TPTP v9.2.1. Released v8.1.0.
% 0.07/0.38 % 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.12/0.58 % Computer : n009.cluster.edu
% 0.12/0.58 % Model : x86_64 x86_64
% 0.12/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.58 % Memory : 8042.1875MB
% 0.12/0.58 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.58 % CPULimit : 300
% 0.12/0.58 % WCLimit : 300
% 0.12/0.58 % DateTime : Mon May 4 19:03:11 EDT 2026
% 0.12/0.58 % CPUTime :
% 0.12/0.59 % start to proof: theBenchmark
% 1.27/1.97 % Version : CSE_E---1.7
% 1.27/1.97 % Problem : theBenchmark.p
% 1.27/1.97 % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.97 % SZS output start CNFRefutation
% See solution above
% 1.27/1.97 % Total time : 1.367s
%------------------------------------------------------------------------------