%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP704-11 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 01:28:14 PM UTC 2026
% Result : Unsatisfiable 5.54s 1.22s
% Output : CNFRefutation 5.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 8 RR)
% Number of literals : 33 ( 32 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 : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t4,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t13,plain,
mult(X1,ld(X1,X2)) = X2,
inference(orient,[status(thm)],[t4]) ).
cnf(t3,axiom,
ld(X1,mult(op_c,X1)) = op_d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t107,plain,
ld(X1,mult(op_c,X1)) = op_d,
inference(orient,[status(thm)],[t3]) ).
cnf(t7,axiom,
mult(X1,mult(X2,ld(mult(X1,X2),op_c))) = op_f,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t46,plain,
mult(X1,mult(X2,ld(mult(X1,X2),op_c))) = op_f,
inference(orient,[status(thm)],[t7]) ).
cnf(t1,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t17,plain,
mult(unit,X1) = X1,
inference(orient,[status(thm)],[t1]) ).
cnf(t48,plain,
op_f = mult(X1,ld(mult(unit,X1),op_c)),
inference(cp,[status(thm)],[t46,t17]) ).
cnf(t221,plain,
op_f = mult(X1,ld(X1,op_c)),
inference(step,[status(thm)],[t48,t17]) ).
cnf(t222,plain,
op_f = op_c,
inference(step,[status(thm)],[t221,t13]) ).
cnf(t113,plain,
op_c = op_f,
inference(orient,[status(thm)],[t222]) ).
cnf(t223,plain,
ld(X1,mult(op_f,X1)) = op_d,
inference(step,[status(thm)],[t107,t113]) ).
cnf(t114,plain,
ld(X1,mult(op_f,X1)) = op_d,
inference(rw,[status(thm)],[t223]) ).
cnf(t126,plain,
ld(X1,mult(op_f,X1)) = op_d,
inference(orient,[status(thm)],[t114]) ).
cnf(t131,plain,
mult(op_f,X1) = mult(X1,op_d),
inference(cp,[status(thm)],[t13,t126]) ).
cnf(t2,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t19,plain,
ld(X1,mult(X1,X2)) = X2,
inference(orient,[status(thm)],[t2]) ).
cnf(t127,plain,
op_d = op_f,
inference(cp,[status(thm)],[t126,t19]) ).
cnf(t133,plain,
op_d = op_f,
inference(orient,[status(thm)],[t127]) ).
cnf(t236,plain,
mult(op_f,X1) = mult(X1,op_f),
inference(step,[status(thm)],[t131,t133]) ).
cnf(t154,plain,
mult(op_f,X1) = mult(X1,op_f),
inference(orient,[status(thm)],[t236]) ).
cnf(t8,axiom,
mult(mult(X1,X2),op_c) = mult(X1,mult(X2,op_c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t37,plain,
mult(mult(X1,X2),op_c) = mult(X1,mult(X2,op_c)),
inference(orient,[status(thm)],[t8]) ).
cnf(t228,plain,
mult(mult(X1,X2),op_f) = mult(X1,mult(X2,op_c)),
inference(step,[status(thm)],[t37,t113]) ).
cnf(t229,plain,
mult(mult(X1,X2),op_f) = mult(X1,mult(X2,op_f)),
inference(step,[status(thm)],[t228,t113]) ).
cnf(t117,plain,
mult(mult(X1,X2),op_f) = mult(X1,mult(X2,op_f)),
inference(rw,[status(thm)],[t229]) ).
cnf(t239,plain,
mult(op_f,mult(X1,X2)) = mult(X1,mult(X2,op_f)),
inference(step,[status(thm)],[t117,t154]) ).
cnf(t191,plain,
mult(op_f,mult(X1,X2)) = mult(X1,mult(X2,op_f)),
inference(orient,[status(thm)],[t239]) ).
cnf(goal_0,negated_conjecture,
mult(x4,mult(x5,op_f)) != mult(mult(x4,x5),op_f),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
mult(x4,mult(x5,op_f)) != mult(op_f,mult(x4,x5)),
inference(rw,[status(thm)],[goal_0,t154]) ).
cnf(g0_1,plain,
mult(x4,mult(x5,op_f)) != mult(x4,mult(x5,op_f)),
inference(rw,[status(thm)],[g0_0,t191]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP704-11 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/0.37 % Computer : n013.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Wed Sep 23 15:45:50 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.54/1.22 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.54/1.22 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------