%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP700-10 : TPTP v9.2.1. Released v8.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 : n017.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:05 PM UTC 2026
% Result : Unsatisfiable 1.58s 1.82s
% Output : CNFRefutation 1.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 3 RR)
% Number of literals : 24 ( 23 equ; 2 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f08,axiom,
mult(mult(X1,X2),mult(X2,mult(X3,X2))) = mult(mult(X1,mult(X2,mult(X2,X3))),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f08) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(f05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
cnf(f06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
cnf(goal,negated_conjecture,
tuple(mult(X1,x0),mult(x0,X1)) != tuple(unit,unit),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(c_0_7,axiom,
mult(mult(X1,X2),mult(X2,mult(X3,X2))) = mult(mult(X1,mult(X2,mult(X2,X3))),X2),
f08 ).
cnf(c_0_8,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_9,plain,
mult(mult(rd(X1,mult(X2,mult(X2,X3))),X2),mult(X2,mult(X3,X2))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
mult(mult(rd(X1,mult(X2,mult(X2,rd(X3,X2)))),X2),mult(X2,X3)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_11,axiom,
mult(X1,unit) = X1,
f05 ).
cnf(c_0_12,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_13,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_14,plain,
mult(mult(rd(X1,mult(X2,mult(X2,rd(unit,X2)))),X2),X2) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
ld(mult(X1,mult(X2,mult(X2,X3))),mult(mult(X1,X2),mult(X2,mult(X3,X2)))) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_16,axiom,
mult(unit,X1) = X1,
f06 ).
cnf(c_0_17,plain,
mult(rd(X1,mult(X2,mult(X2,rd(unit,X2)))),X2) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_13]) ).
cnf(c_0_18,plain,
ld(mult(X1,mult(X1,X2)),mult(X1,mult(X1,mult(X2,X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_19,plain,
mult(X1,mult(X2,mult(X2,rd(unit,X2)))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_20,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_21,negated_conjecture,
tuple(mult(X1,x0),mult(x0,X1)) != tuple(unit,unit),
goal ).
cnf(c_0_22,plain,
mult(X1,rd(unit,X1)) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.14 % Problem : GRP700-10 : TPTP v9.2.1. Released v8.1.0.
% 0.10/0.14 % 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.19/0.35 % Computer : n017.cluster.edu
% 0.19/0.35 % Model : x86_64 x86_64
% 0.19/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.35 % Memory : 8042.1875MB
% 0.19/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.36 % CPULimit : 300
% 0.19/0.36 % WCLimit : 300
% 0.19/0.36 % DateTime : Mon May 4 19:05:43 EDT 2026
% 0.19/0.36 % CPUTime :
% 0.19/0.37 % start to proof: theBenchmark
% 1.58/1.82 % Version : CSE_E---1.7
% 1.58/1.82 % Problem : theBenchmark.p
% 1.58/1.82 % SZS status Unsatisfiable for theBenchmark.p
% 1.58/1.82 % SZS output start CNFRefutation
% See solution above
% 1.58/1.83 % Total time : 1.373s
%------------------------------------------------------------------------------