%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP562-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n016.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:27:32 PM UTC 2026
% Result : Unsatisfiable 4.70s 1.09s
% Output : CNFRefutation 4.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 7
% Syntax : Number of clauses : 48 ( 48 unt; 0 nHn; 31 RR)
% Number of literals : 48 ( 47 equ; 9 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t1,axiom,
sF0 = inverse(b2),
introduced(definition) ).
cnf(t5,plain,
inverse(b2) = sF0,
inference(orient,[status(thm)],[t1]) ).
cnf(t2,axiom,
sF1 = divide(inverse(b2),inverse(b2)),
introduced(definition) ).
cnf(t283,plain,
sF1 = divide(sF0,inverse(b2)),
inference(step,[status(thm)],[t2,t5]) ).
cnf(t284,plain,
sF1 = divide(sF0,sF0),
inference(step,[status(thm)],[t283,t5]) ).
cnf(t7,plain,
divide(sF0,sF0) = sF1,
inference(orient,[status(thm)],[t284]) ).
cnf(t0,axiom,
divide(divide(divide(X1,inverse(X2)),X3),divide(X1,X3)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t9,plain,
divide(divide(divide(X1,inverse(X2)),X3),divide(X1,X3)) = X2,
inference(orient,[status(thm)],[t0]) ).
cnf(t3,axiom,
sF2 = inverse(a2),
introduced(definition) ).
cnf(t6,plain,
inverse(a2) = sF2,
inference(orient,[status(thm)],[t3]) ).
cnf(t11,plain,
a2 = divide(divide(divide(X1,sF2),X2),divide(X1,X2)),
inference(cp,[status(thm)],[t9,t6]) ).
cnf(t77,plain,
divide(divide(divide(X1,sF2),X2),divide(X1,X2)) = a2,
inference(orient,[status(thm)],[t11]) ).
cnf(t4,axiom,
sF3 = divide(divide(inverse(b2),inverse(b2)),inverse(a2)),
introduced(definition) ).
cnf(t285,plain,
sF3 = divide(divide(sF0,inverse(b2)),inverse(a2)),
inference(step,[status(thm)],[t4,t5]) ).
cnf(t286,plain,
sF3 = divide(divide(sF0,sF0),inverse(a2)),
inference(step,[status(thm)],[t285,t5]) ).
cnf(t287,plain,
sF3 = divide(sF1,inverse(a2)),
inference(step,[status(thm)],[t286,t7]) ).
cnf(t288,plain,
sF3 = divide(sF1,sF2),
inference(step,[status(thm)],[t287,t6]) ).
cnf(t8,plain,
divide(sF1,sF2) = sF3,
inference(orient,[status(thm)],[t288]) ).
cnf(t78,plain,
a2 = divide(divide(sF3,X1),divide(sF1,X1)),
inference(cp,[status(thm)],[t77,t8]) ).
cnf(t119,plain,
divide(divide(sF3,X1),divide(sF1,X1)) = a2,
inference(orient,[status(thm)],[t78]) ).
cnf(t12,plain,
X1 = divide(divide(divide(sF0,inverse(X1)),sF0),sF1),
inference(cp,[status(thm)],[t9,t7]) ).
cnf(t16,plain,
divide(divide(divide(sF0,inverse(X1)),sF0),sF1) = X1,
inference(orient,[status(thm)],[t12]) ).
cnf(t15,plain,
X1 = divide(divide(divide(divide(divide(X2,inverse(X3)),Y3),inverse(X1)),divide(X2,Y3)),X3),
inference(cp,[status(thm)],[t9,t9]) ).
cnf(t172,plain,
divide(divide(divide(divide(divide(X1,inverse(X2)),X3),inverse(Y3)),divide(X1,X3)),X2) = Y3,
inference(orient,[status(thm)],[t15]) ).
cnf(t206,plain,
X1 = divide(divide(X2,divide(divide(divide(X3,inverse(inverse(X1))),Y3),divide(X3,Y3))),X2),
inference(cp,[status(thm)],[t172,t172]) ).
cnf(t294,plain,
X1 = divide(divide(X2,inverse(X1)),X2),
inference(step,[status(thm)],[t206,t9]) ).
cnf(t230,plain,
divide(divide(X1,inverse(X2)),X1) = X2,
inference(orient,[status(thm)],[t294]) ).
cnf(t295,plain,
divide(X1,sF1) = X1,
inference(step,[status(thm)],[t16,t230]) ).
cnf(t231,plain,
divide(X1,sF1) = X1,
inference(rw,[status(thm)],[t295]) ).
cnf(t248,plain,
divide(X1,sF1) = X1,
inference(orient,[status(thm)],[t231]) ).
cnf(t258,plain,
a2 = divide(sF3,divide(sF1,sF1)),
inference(cp,[status(thm)],[t119,t248]) ).
cnf(t304,plain,
a2 = divide(sF3,sF1),
inference(step,[status(thm)],[t258,t248]) ).
cnf(t305,plain,
a2 = sF3,
inference(step,[status(thm)],[t304,t248]) ).
cnf(t259,plain,
a2 = sF3,
inference(orient,[status(thm)],[t305]) ).
cnf(t306,plain,
inverse(sF3) = sF2,
inference(step,[status(thm)],[t6,t259]) ).
cnf(t260,plain,
inverse(sF3) = sF2,
inference(rw,[status(thm)],[t306]) ).
cnf(t277,plain,
inverse(sF3) = sF2,
inference(orient,[status(thm)],[t260]) ).
cnf(u0,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(d0,axiom,
multiply(A,B) = divide(A,inverse(B)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(goal_0,negated_conjecture,
divide(divide(inverse(b2),inverse(b2)),inverse(a2)) != a2,
inference(definition_unfolding,[status(thm)],[u0,d0]) ).
cnf(g0_0,plain,
divide(divide(sF0,inverse(b2)),inverse(a2)) != a2,
inference(rw,[status(thm)],[goal_0,t5]) ).
cnf(g0_1,plain,
divide(divide(sF0,sF0),inverse(a2)) != a2,
inference(rw,[status(thm)],[g0_0,t5]) ).
cnf(g0_2,plain,
divide(sF1,inverse(a2)) != a2,
inference(rw,[status(thm)],[g0_1,t7]) ).
cnf(g0_3,plain,
divide(sF1,inverse(sF3)) != a2,
inference(rw,[status(thm)],[g0_2,t259]) ).
cnf(g0_4,plain,
divide(sF1,sF2) != a2,
inference(rw,[status(thm)],[g0_3,t277]) ).
cnf(g0_5,plain,
sF3 != a2,
inference(rw,[status(thm)],[g0_4,t8]) ).
cnf(g0_6,plain,
sF3 != sF3,
inference(rw,[status(thm)],[g0_5,t259]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP562-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.37 % Computer : n016.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:09:58 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.70/1.09 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.70/1.09 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------