%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP553-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 : 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:27:31 PM UTC 2026
% Result : Unsatisfiable 3.73s 1.29s
% Output : CNFRefutation 3.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 7
% Syntax : Number of clauses : 52 ( 52 unt; 0 nHn; 34 RR)
% Number of literals : 52 ( 51 equ; 8 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t1,axiom,
sF0 = inverse(b1),
introduced(definition) ).
cnf(t5,plain,
inverse(b1) = sF0,
inference(orient,[status(thm)],[t1]) ).
cnf(t2,axiom,
sF1 = divide(inverse(b1),inverse(b1)),
introduced(definition) ).
cnf(t298,plain,
sF1 = divide(sF0,inverse(b1)),
inference(step,[status(thm)],[t2,t5]) ).
cnf(t299,plain,
sF1 = divide(sF0,sF0),
inference(step,[status(thm)],[t298,t5]) ).
cnf(t7,plain,
divide(sF0,sF0) = sF1,
inference(orient,[status(thm)],[t299]) ).
cnf(t3,axiom,
sF2 = inverse(a1),
introduced(definition) ).
cnf(t6,plain,
inverse(a1) = sF2,
inference(orient,[status(thm)],[t3]) ).
cnf(t4,axiom,
sF3 = divide(inverse(a1),inverse(a1)),
introduced(definition) ).
cnf(t300,plain,
sF3 = divide(sF2,inverse(a1)),
inference(step,[status(thm)],[t4,t6]) ).
cnf(t301,plain,
sF3 = divide(sF2,sF2),
inference(step,[status(thm)],[t300,t6]) ).
cnf(t8,plain,
divide(sF2,sF2) = sF3,
inference(orient,[status(thm)],[t301]) ).
cnf(t0,axiom,
divide(divide(X1,inverse(divide(X2,divide(X1,X3)))),X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t9,plain,
divide(divide(X1,inverse(divide(X2,divide(X1,X3)))),X3) = X2,
inference(orient,[status(thm)],[t0]) ).
cnf(t13,plain,
X1 = divide(divide(divide(X2,inverse(divide(X3,divide(X2,Y3)))),inverse(divide(X1,X3))),Y3),
inference(cp,[status(thm)],[t9,t9]) ).
cnf(t101,plain,
divide(divide(divide(X1,inverse(divide(X2,divide(X1,X3)))),inverse(divide(Y3,X2))),X3) = Y3,
inference(orient,[status(thm)],[t13]) ).
cnf(t104,plain,
X1 = divide(X2,inverse(divide(X1,X2))),
inference(cp,[status(thm)],[t101,t9]) ).
cnf(t151,plain,
divide(X1,inverse(divide(X2,X1))) = X2,
inference(orient,[status(thm)],[t104]) ).
cnf(t10,plain,
X1 = divide(divide(sF0,inverse(divide(X1,sF1))),sF0),
inference(cp,[status(thm)],[t9,t7]) ).
cnf(t14,plain,
divide(divide(sF0,inverse(divide(X1,sF1))),sF0) = X1,
inference(orient,[status(thm)],[t10]) ).
cnf(t15,plain,
divide(X1,inverse(divide(X2,divide(X1,sF1)))) = divide(divide(sF0,inverse(X2)),sF0),
inference(cp,[status(thm)],[t14,t9]) ).
cnf(t20,plain,
divide(X1,inverse(divide(X2,divide(X1,sF1)))) = divide(divide(sF0,inverse(X2)),sF0),
inference(orient,[status(thm)],[t15]) ).
cnf(t23,plain,
X1 = divide(divide(divide(sF0,inverse(X1)),sF0),sF1),
inference(cp,[status(thm)],[t9,t20]) ).
cnf(t30,plain,
divide(divide(divide(sF0,inverse(X1)),sF0),sF1) = X1,
inference(orient,[status(thm)],[t23]) ).
cnf(t152,plain,
sF0 = divide(sF0,inverse(sF1)),
inference(cp,[status(thm)],[t151,t7]) ).
cnf(t178,plain,
divide(sF0,inverse(sF1)) = sF0,
inference(orient,[status(thm)],[t152]) ).
cnf(t180,plain,
sF1 = divide(divide(sF0,sF0),sF1),
inference(cp,[status(thm)],[t30,t178]) ).
cnf(t306,plain,
sF1 = divide(sF1,sF1),
inference(step,[status(thm)],[t180,t7]) ).
cnf(t185,plain,
divide(sF1,sF1) = sF1,
inference(orient,[status(thm)],[t306]) ).
cnf(t186,plain,
X1 = divide(divide(sF1,inverse(divide(X1,sF1))),sF1),
inference(cp,[status(thm)],[t9,t185]) ).
cnf(t307,plain,
X1 = divide(X1,sF1),
inference(step,[status(thm)],[t186,t151]) ).
cnf(t190,plain,
divide(X1,sF1) = X1,
inference(orient,[status(thm)],[t307]) ).
cnf(t201,plain,
X1 = divide(sF1,inverse(X1)),
inference(cp,[status(thm)],[t151,t190]) ).
cnf(t273,plain,
divide(sF1,inverse(X1)) = X1,
inference(orient,[status(thm)],[t201]) ).
cnf(t274,plain,
a1 = divide(sF1,sF2),
inference(cp,[status(thm)],[t273,t6]) ).
cnf(t285,plain,
divide(sF1,sF2) = a1,
inference(orient,[status(thm)],[t274]) ).
cnf(t290,plain,
sF1 = divide(sF2,inverse(a1)),
inference(cp,[status(thm)],[t151,t285]) ).
cnf(t323,plain,
sF1 = divide(sF2,sF2),
inference(step,[status(thm)],[t290,t6]) ).
cnf(t324,plain,
sF1 = sF3,
inference(step,[status(thm)],[t323,t8]) ).
cnf(t292,plain,
sF3 = sF1,
inference(orient,[status(thm)],[t324]) ).
cnf(t325,plain,
divide(sF2,sF2) = sF1,
inference(step,[status(thm)],[t8,t292]) ).
cnf(t293,plain,
divide(sF2,sF2) = sF1,
inference(orient,[status(thm)],[t325]) ).
cnf(u0,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
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(inverse(b1),inverse(b1)) != divide(inverse(a1),inverse(a1)),
inference(definition_unfolding,[status(thm)],[u0,d0]) ).
cnf(g0_0,plain,
divide(sF0,inverse(b1)) != divide(inverse(a1),inverse(a1)),
inference(rw,[status(thm)],[goal_0,t5]) ).
cnf(g0_1,plain,
divide(sF0,sF0) != divide(inverse(a1),inverse(a1)),
inference(rw,[status(thm)],[g0_0,t5]) ).
cnf(g0_2,plain,
sF1 != divide(inverse(a1),inverse(a1)),
inference(rw,[status(thm)],[g0_1,t7]) ).
cnf(g0_3,plain,
sF1 != divide(sF2,inverse(a1)),
inference(rw,[status(thm)],[g0_2,t6]) ).
cnf(g0_4,plain,
sF1 != divide(sF2,sF2),
inference(rw,[status(thm)],[g0_3,t6]) ).
cnf(g0_5,plain,
sF1 != sF1,
inference(rw,[status(thm)],[g0_4,t293]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP553-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.58 % Computer : n009.cluster.edu
% 0.10/0.58 % Model : x86_64 x86_64
% 0.10/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.58 % Memory : 8046.5625MB
% 0.10/0.58 % OS : Linux 6.8.0-71-generic
% 0.10/0.58 % CPULimit : 300
% 0.10/0.58 % WCLimit : 300
% 0.10/0.58 % DateTime : Wed Sep 23 15:03:43 UTC 2026
% 0.10/0.58 % CPUTime :
% 0.10/0.58 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.73/1.29 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.73/1.29 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------