%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP669-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 : n005.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:26:51 PM UTC 2026
% Result : Unsatisfiable 2.07s 1.97s
% Output : CNFRefutation 2.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 5 RR)
% Number of literals : 43 ( 42 equ; 4 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 82 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c10,axiom,
mult(mult(X1,X2),mult(X3,X1)) = mult(X1,mult(mult(X2,X3),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c10) ).
cnf(c06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c05) ).
cnf(c04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c04) ).
cnf(c03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c03) ).
cnf(c07,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(mult(X1,X2),X1),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c07) ).
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
cnf(c01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).
cnf(goals,negated_conjecture,
mult(mult(a,b),mult(c,mult(a,b))) != mult(mult(mult(a,mult(b,c)),a),b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c09,axiom,
mult(mult(X1,X2),mult(X3,X1)) = mult(mult(X1,mult(X2,X3)),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c09) ).
cnf(c08,axiom,
mult(X1,mult(X2,mult(X3,X2))) = mult(mult(mult(X1,X2),X3),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c08) ).
cnf(c_0_11,axiom,
mult(mult(X1,X2),mult(X3,X1)) = mult(X1,mult(mult(X2,X3),X1)),
c10 ).
cnf(c_0_12,axiom,
mult(unit,X1) = X1,
c06 ).
cnf(c_0_13,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_14,axiom,
rd(mult(X1,X2),X2) = X1,
c04 ).
cnf(c_0_15,plain,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_16,plain,
rd(mult(X1,mult(X2,X1)),X1) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
mult(rd(X1,X2),X2) = X1,
c03 ).
cnf(c_0_18,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(mult(X1,X2),X1),X3),
c07 ).
cnf(c_0_19,plain,
rd(mult(X1,X2),X1) = mult(X1,rd(X2,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
rd(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_21,plain,
mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3))),
inference(rw,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_22,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_23,plain,
mult(X1,rd(unit,X1)) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_13]),c_0_20]) ).
cnf(c_0_24,plain,
mult(X1,mult(rd(X2,X1),mult(X1,X3))) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_25,plain,
rd(unit,X1) = ld(X1,unit),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
mult(X1,mult(ld(X1,unit),mult(X1,X2))) = mult(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_13]) ).
cnf(c_0_27,plain,
mult(X1,mult(mult(X2,rd(X3,X1)),X1)) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_28,axiom,
mult(X1,ld(X1,X2)) = X2,
c01 ).
cnf(c_0_29,plain,
mult(ld(X1,unit),mult(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_26]),c_0_22]) ).
cnf(c_0_30,plain,
mult(mult(X1,rd(X2,rd(X3,X1))),X3) = mult(X1,mult(X2,X1)),
inference(spm,[status(thm)],[c_0_27,c_0_17]) ).
cnf(c_0_31,negated_conjecture,
mult(mult(a,b),mult(c,mult(a,b))) != mult(mult(mult(a,mult(b,c)),a),b),
goals ).
cnf(c_0_32,axiom,
mult(mult(X1,X2),mult(X3,X1)) = mult(mult(X1,mult(X2,X3)),X1),
c09 ).
cnf(c_0_33,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_28]) ).
cnf(c_0_34,plain,
ld(ld(X1,unit),X2) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_29]) ).
cnf(c_0_35,plain,
mult(X1,rd(X2,ld(X1,unit))) = mult(X1,mult(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_30]),c_0_25]) ).
cnf(c_0_36,negated_conjecture,
mult(mult(a,mult(mult(b,c),a)),b) != mult(mult(a,b),mult(c,mult(a,b))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_11]) ).
cnf(c_0_37,axiom,
mult(X1,mult(X2,mult(X3,X2))) = mult(mult(mult(X1,X2),X3),X2),
c08 ).
cnf(c_0_38,plain,
rd(X1,mult(X2,X1)) = ld(X2,unit),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
rd(X1,ld(X2,unit)) = mult(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_35]),c_0_22]) ).
cnf(c_0_40,negated_conjecture,
mult(mult(a,b),mult(c,mult(a,b))) != mult(a,mult(b,mult(mult(c,a),b))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_21]),c_0_11]) ).
cnf(c_0_41,plain,
mult(mult(X1,X2),mult(X3,mult(X1,X2))) = mult(X1,mult(X2,mult(mult(X3,X1),X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_30]),c_0_38]),c_0_39]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP669-1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11 % 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.32 % Computer : n005.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Mon May 4 19:01:00 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.33 % start to proof: theBenchmark
% 2.07/1.97 % Version : CSE_E---1.7
% 2.07/1.97 % Problem : theBenchmark.p
% 2.07/1.97 % SZS status Unsatisfiable for theBenchmark.p
% 2.07/1.97 % SZS output start CNFRefutation
% See solution above
% 2.07/1.97 % Total time : 1.370s
%------------------------------------------------------------------------------