%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP011-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n026.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:24:55 PM UTC 2026
% Result : Unsatisfiable 4.52s 1.09s
% Output : CNFRefutation 4.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 5
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 10 RR)
% Number of literals : 34 ( 33 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t3,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t5,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(orient,[status(thm)],[t3]) ).
cnf(t2,axiom,
multiply(d,c) = multiply(b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t6,plain,
multiply(b,c) = multiply(d,c),
inference(orient,[status(thm)],[t2]) ).
cnf(t7,plain,
multiply(b,multiply(c,X1)) = multiply(multiply(d,c),X1),
inference(cp,[status(thm)],[t5,t6]) ).
cnf(t49,plain,
multiply(b,multiply(c,X1)) = multiply(d,multiply(c,X1)),
inference(step,[status(thm)],[t7,t5]) ).
cnf(t41,plain,
multiply(b,multiply(c,X1)) = multiply(d,multiply(c,X1)),
inference(orient,[status(thm)],[t49]) ).
cnf(t1,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t8,plain,
multiply(inverse(X1),X1) = identity,
inference(orient,[status(thm)],[t1]) ).
cnf(t9,plain,
multiply(inverse(X1),multiply(X1,X2)) = multiply(identity,X2),
inference(cp,[status(thm)],[t5,t8]) ).
cnf(t0,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t4,plain,
multiply(identity,X1) = X1,
inference(orient,[status(thm)],[t0]) ).
cnf(t46,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(step,[status(thm)],[t9,t4]) ).
cnf(t10,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(orient,[status(thm)],[t46]) ).
cnf(t11,plain,
X1 = multiply(inverse(inverse(X1)),identity),
inference(cp,[status(thm)],[t10,t8]) ).
cnf(t18,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(orient,[status(thm)],[t11]) ).
cnf(t15,plain,
multiply(X1,X2) = multiply(inverse(inverse(X1)),X2),
inference(cp,[status(thm)],[t10,t10]) ).
cnf(t25,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(orient,[status(thm)],[t15]) ).
cnf(t47,plain,
multiply(X1,identity) = X1,
inference(step,[status(thm)],[t18,t25]) ).
cnf(t28,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[t47]) ).
cnf(t29,plain,
multiply(X1,identity) = X1,
inference(orient,[status(thm)],[t28]) ).
cnf(t30,plain,
inverse(inverse(X1)) = multiply(X1,identity),
inference(cp,[status(thm)],[t29,t25]) ).
cnf(t48,plain,
inverse(inverse(X1)) = X1,
inference(step,[status(thm)],[t30,t29]) ).
cnf(t31,plain,
inverse(inverse(X1)) = X1,
inference(orient,[status(thm)],[t48]) ).
cnf(t33,plain,
identity = multiply(X1,inverse(X1)),
inference(cp,[status(thm)],[t8,t31]) ).
cnf(t34,plain,
multiply(X1,inverse(X1)) = identity,
inference(orient,[status(thm)],[t33]) ).
cnf(t43,plain,
multiply(d,multiply(c,inverse(c))) = multiply(b,identity),
inference(cp,[status(thm)],[t41,t34]) ).
cnf(t50,plain,
multiply(d,identity) = multiply(b,identity),
inference(step,[status(thm)],[t43,t34]) ).
cnf(t51,plain,
d = multiply(b,identity),
inference(step,[status(thm)],[t50,t29]) ).
cnf(t52,plain,
d = b,
inference(step,[status(thm)],[t51,t29]) ).
cnf(t45,plain,
b = d,
inference(orient,[status(thm)],[t52]) ).
cnf(goal_0,negated_conjecture,
d != b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
d != d,
inference(rw,[status(thm)],[goal_0,t45]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP011-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.34 % Computer : n026.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Wed Sep 23 13:15:38 UTC 2026
% 0.09/0.34 % CPUTime :
% 0.09/0.34 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.52/1.09 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.52/1.09 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------