%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP679-1 : TPTP v9.2.1. Released v4.0.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 : n016.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:52 PM UTC 2026
% Result : Unsatisfiable 1.24s 1.74s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 4 RR)
% Number of literals : 26 ( 25 equ; 3 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 : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).
cnf(c08,axiom,
mult(op_c,X1) = mult(X1,op_c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c08) ).
cnf(c07,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).
cnf(c06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c06) ).
cnf(c04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).
cnf(c01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c01) ).
cnf(c03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
cnf(goals,negated_conjecture,
mult(mult(op_c,op_c),a) != mult(a,mult(op_c,op_c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_8,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_9,axiom,
mult(op_c,X1) = mult(X1,op_c),
c08 ).
cnf(c_0_10,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3),
c07 ).
cnf(c_0_11,axiom,
mult(unit,X1) = X1,
c06 ).
cnf(c_0_12,axiom,
rd(mult(X1,X2),X2) = X1,
c04 ).
cnf(c_0_13,axiom,
mult(X1,ld(X1,X2)) = X2,
c01 ).
cnf(c_0_14,plain,
ld(X1,mult(op_c,X1)) = op_c,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,plain,
mult(op_c,mult(X1,mult(X2,X1))) = mult(X1,mult(X2,mult(X1,op_c))),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,plain,
ld(op_c,mult(X1,op_c)) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_17,axiom,
mult(rd(X1,X2),X2) = X1,
c03 ).
cnf(c_0_18,negated_conjecture,
mult(mult(op_c,op_c),a) != mult(a,mult(op_c,op_c)),
goals ).
cnf(c_0_19,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).
cnf(c_0_20,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,plain,
ld(mult(X1,mult(op_c,op_c)),mult(op_c,mult(op_c,mult(X1,op_c)))) = op_c,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
rd(X1,op_c) = ld(op_c,X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
mult(a,mult(op_c,op_c)) != mult(op_c,mult(op_c,a)),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
mult(op_c,mult(X1,op_c)) = mult(X1,mult(op_c,op_c)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_8]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP679-1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11 % 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.16/0.32 % Computer : n016.cluster.edu
% 0.16/0.32 % Model : x86_64 x86_64
% 0.16/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.32 % Memory : 8042.1875MB
% 0.16/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.32 % CPULimit : 300
% 0.16/0.32 % WCLimit : 300
% 0.16/0.32 % DateTime : Mon May 4 19:02:21 EDT 2026
% 0.16/0.32 % CPUTime :
% 0.17/0.36 % start to proof: theBenchmark
% 1.24/1.74 % Version : CSE_E---1.7
% 1.24/1.74 % Problem : theBenchmark.p
% 1.24/1.74 % SZS status Unsatisfiable for theBenchmark.p
% 1.24/1.74 % SZS output start CNFRefutation
% See solution above
% 1.24/1.74 % Total time : 1.370s
%------------------------------------------------------------------------------