%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP710-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 : n009.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:15 PM UTC 2026
% Result : Unsatisfiable 7.00s 1.48s
% Output : CNFRefutation 7.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 8
% Syntax : Number of clauses : 57 ( 57 unt; 0 nHn; 6 RR)
% Number of literals : 57 ( 56 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 80 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eg0,negated_conjecture,
mult(X5,x4) != x3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t5,plain,
eq(mult(X1,x4),x3) = efalse,
inference(equality_encoding,[status(esa)],[eg0]) ).
cnf(t22,plain,
eq(mult(X1,x4),x3) = efalse,
inference(orient,[status(thm)],[t5]) ).
cnf(t6,axiom,
mult(mult(mult(X1,X2),X2),X3) = mult(X1,mult(X2,mult(X2,X3))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t9,plain,
mult(mult(mult(X1,X2),X2),X3) = mult(X1,mult(X2,mult(X2,X3))),
inference(orient,[status(thm)],[t6]) ).
cnf(t1,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t7,plain,
mult(X1,unit) = X1,
inference(orient,[status(thm)],[t1]) ).
cnf(t10,plain,
mult(X1,mult(X2,mult(X2,unit))) = mult(mult(X1,X2),X2),
inference(cp,[status(thm)],[t9,t7]) ).
cnf(t455,plain,
mult(X1,mult(X2,X2)) = mult(mult(X1,X2),X2),
inference(step,[status(thm)],[t10,t7]) ).
cnf(t29,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(orient,[status(thm)],[t455]) ).
cnf(t33,plain,
efalse = eq(mult(X1,mult(x4,x4)),x3),
inference(cp,[status(thm)],[t22,t29]) ).
cnf(t37,plain,
eq(mult(X1,mult(x4,x4)),x3) = efalse,
inference(orient,[status(thm)],[t33]) ).
cnf(t456,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(X1,mult(X2,mult(X2,X3))),
inference(step,[status(thm)],[t9,t29]) ).
cnf(t34,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(X1,mult(X2,mult(X2,X3))),
inference(rw,[status(thm)],[t456]) ).
cnf(t46,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(X1,mult(X2,mult(X2,X3))),
inference(orient,[status(thm)],[t34]) ).
cnf(t58,plain,
efalse = eq(mult(X1,mult(X2,mult(X2,mult(x4,x4)))),x3),
inference(cp,[status(thm)],[t37,t46]) ).
cnf(t430,plain,
eq(mult(X1,mult(X2,mult(X2,mult(x4,x4)))),x3) = efalse,
inference(orient,[status(thm)],[t58]) ).
cnf(t2,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t8,plain,
mult(unit,X1) = X1,
inference(orient,[status(thm)],[t2]) ).
cnf(t54,plain,
mult(unit,mult(X1,mult(X1,X2))) = mult(mult(X1,X1),X2),
inference(cp,[status(thm)],[t46,t8]) ).
cnf(t460,plain,
mult(X1,mult(X1,X2)) = mult(mult(X1,X1),X2),
inference(step,[status(thm)],[t54,t8]) ).
cnf(t62,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(orient,[status(thm)],[t460]) ).
cnf(t4,axiom,
mult(i(X1),X1) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t18,plain,
mult(i(X1),X1) = unit,
inference(orient,[status(thm)],[t4]) ).
cnf(t53,plain,
mult(i(mult(X1,X1)),mult(X1,mult(X1,X2))) = mult(unit,X2),
inference(cp,[status(thm)],[t46,t18]) ).
cnf(t469,plain,
mult(i(mult(X1,X1)),mult(X1,mult(X1,X2))) = X2,
inference(step,[status(thm)],[t53,t8]) ).
cnf(t181,plain,
mult(i(mult(X1,X1)),mult(X1,mult(X1,X2))) = X2,
inference(orient,[status(thm)],[t469]) ).
cnf(t3,axiom,
mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t14,plain,
mult(X1,i(X1)) = unit,
inference(orient,[status(thm)],[t3]) ).
cnf(t30,plain,
mult(X1,mult(i(X1),i(X1))) = mult(unit,i(X1)),
inference(cp,[status(thm)],[t29,t14]) ).
cnf(t458,plain,
mult(X1,mult(i(X1),i(X1))) = i(X1),
inference(step,[status(thm)],[t30,t8]) ).
cnf(t39,plain,
mult(X1,mult(i(X1),i(X1))) = i(X1),
inference(orient,[status(thm)],[t458]) ).
cnf(t187,plain,
mult(i(X1),i(X1)) = mult(i(mult(X1,X1)),mult(X1,i(X1))),
inference(cp,[status(thm)],[t181,t39]) ).
cnf(t470,plain,
mult(i(X1),i(X1)) = mult(i(mult(X1,X1)),unit),
inference(step,[status(thm)],[t187,t14]) ).
cnf(t471,plain,
mult(i(X1),i(X1)) = i(mult(X1,X1)),
inference(step,[status(thm)],[t470,t7]) ).
cnf(t202,plain,
mult(i(X1),i(X1)) = i(mult(X1,X1)),
inference(orient,[status(thm)],[t471]) ).
cnf(t205,plain,
mult(i(X1),mult(i(X1),X2)) = mult(i(mult(X1,X1)),X2),
inference(cp,[status(thm)],[t62,t202]) ).
cnf(t239,plain,
mult(i(X1),mult(i(X1),X2)) = mult(i(mult(X1,X1)),X2),
inference(orient,[status(thm)],[t205]) ).
cnf(t31,plain,
mult(i(X1),mult(X1,X1)) = mult(unit,X1),
inference(cp,[status(thm)],[t29,t18]) ).
cnf(t457,plain,
mult(i(X1),mult(X1,X1)) = X1,
inference(step,[status(thm)],[t31,t8]) ).
cnf(t35,plain,
mult(i(X1),mult(X1,X1)) = X1,
inference(orient,[status(thm)],[t457]) ).
cnf(t52,plain,
mult(i(X1),mult(X1,mult(X1,X2))) = mult(X1,X2),
inference(cp,[status(thm)],[t46,t35]) ).
cnf(t89,plain,
mult(i(X1),mult(X1,mult(X1,X2))) = mult(X1,X2),
inference(orient,[status(thm)],[t52]) ).
cnf(t241,plain,
mult(i(mult(X1,X1)),mult(X1,mult(X1,X2))) = mult(i(X1),mult(X1,X2)),
inference(cp,[status(thm)],[t239,t89]) ).
cnf(t474,plain,
X2 = mult(i(X1),mult(X1,X2)),
inference(step,[status(thm)],[t241,t181]) ).
cnf(t256,plain,
mult(i(X1),mult(X1,X2)) = X2,
inference(orient,[status(thm)],[t474]) ).
cnf(t449,plain,
efalse = eq(mult(X1,mult(i(x4),x4)),x3),
inference(cp,[status(thm)],[t430,t256]) ).
cnf(t483,plain,
efalse = eq(mult(X1,unit),x3),
inference(step,[status(thm)],[t449,t18]) ).
cnf(t484,plain,
efalse = eq(X1,x3),
inference(step,[status(thm)],[t483,t7]) ).
cnf(t450,plain,
eq(X1,x3) = efalse,
inference(orient,[status(thm)],[t484]) ).
cnf(t0,plain,
eq(X1,X1) = etrue,
introduced(definition) ).
cnf(t21,plain,
eq(X1,X1) = etrue,
inference(orient,[status(thm)],[t0]) ).
cnf(t451,plain,
efalse = etrue,
inference(cp,[status(thm)],[t450,t21]) ).
cnf(t452,plain,
efalse = etrue,
inference(orient,[status(thm)],[t451]) ).
cnf(goal_0,negated_conjecture,
etrue != efalse,
introduced(definition) ).
cnf(g0_0,plain,
etrue != etrue,
inference(rw,[status(thm)],[goal_0,t452]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP710-11 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n009.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Wed Sep 23 15:47:58 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.00/1.48 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.00/1.48 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------