%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP554-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n004.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 5.84s 1.18s
% Output : CNFRefutation 5.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 7
% Syntax : Number of clauses : 57 ( 57 unt; 0 nHn; 39 RR)
% Number of literals : 57 ( 56 equ; 9 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 : 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(t247,plain,
sF1 = divide(sF0,inverse(b2)),
inference(step,[status(thm)],[t2,t5]) ).
cnf(t248,plain,
sF1 = divide(sF0,sF0),
inference(step,[status(thm)],[t247,t5]) ).
cnf(t7,plain,
divide(sF0,sF0) = sF1,
inference(orient,[status(thm)],[t248]) ).
cnf(t0,axiom,
divide(divide(X1,inverse(divide(X2,divide(X1,X3)))),X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t9,plain,
divide(divide(X1,inverse(divide(X2,divide(X1,X3)))),X3) = X2,
inference(orient,[status(thm)],[t0]) ).
cnf(t4,axiom,
sF3 = divide(divide(inverse(b2),inverse(b2)),inverse(a2)),
introduced(definition) ).
cnf(t249,plain,
sF3 = divide(divide(sF0,inverse(b2)),inverse(a2)),
inference(step,[status(thm)],[t4,t5]) ).
cnf(t250,plain,
sF3 = divide(divide(sF0,sF0),inverse(a2)),
inference(step,[status(thm)],[t249,t5]) ).
cnf(t251,plain,
sF3 = divide(sF1,inverse(a2)),
inference(step,[status(thm)],[t250,t7]) ).
cnf(t3,axiom,
sF2 = inverse(a2),
introduced(definition) ).
cnf(t6,plain,
inverse(a2) = sF2,
inference(orient,[status(thm)],[t3]) ).
cnf(t252,plain,
sF3 = divide(sF1,sF2),
inference(step,[status(thm)],[t251,t6]) ).
cnf(t8,plain,
divide(sF1,sF2) = sF3,
inference(orient,[status(thm)],[t252]) ).
cnf(t11,plain,
X1 = divide(divide(sF1,inverse(divide(X1,sF3))),sF2),
inference(cp,[status(thm)],[t9,t8]) ).
cnf(t17,plain,
divide(divide(sF1,inverse(divide(X1,sF3))),sF2) = X1,
inference(orient,[status(thm)],[t11]) ).
cnf(t18,plain,
divide(X1,inverse(divide(X2,divide(X1,sF3)))) = divide(divide(sF1,inverse(X2)),sF2),
inference(cp,[status(thm)],[t17,t9]) ).
cnf(t25,plain,
divide(X1,inverse(divide(X2,divide(X1,sF3)))) = divide(divide(sF1,inverse(X2)),sF2),
inference(orient,[status(thm)],[t18]) ).
cnf(t28,plain,
X1 = divide(divide(divide(sF1,inverse(X1)),sF2),sF3),
inference(cp,[status(thm)],[t9,t25]) ).
cnf(t56,plain,
divide(divide(divide(sF1,inverse(X1)),sF2),sF3) = X1,
inference(orient,[status(thm)],[t28]) ).
cnf(t19,plain,
X1 = divide(divide(divide(sF1,inverse(divide(X2,sF3))),inverse(divide(X1,X2))),sF2),
inference(cp,[status(thm)],[t9,t17]) ).
cnf(t222,plain,
divide(divide(divide(sF1,inverse(divide(X1,sF3))),inverse(divide(X2,X1))),sF2) = X2,
inference(orient,[status(thm)],[t19]) ).
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(t153,plain,
sF1 = divide(sF2,inverse(sF3)),
inference(cp,[status(thm)],[t151,t8]) ).
cnf(t209,plain,
divide(sF2,inverse(sF3)) = sF1,
inference(orient,[status(thm)],[t153]) ).
cnf(t232,plain,
sF2 = divide(divide(divide(sF1,inverse(divide(inverse(sF3),sF3))),inverse(sF1)),sF2),
inference(cp,[status(thm)],[t222,t209]) ).
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(t179,plain,
X1 = divide(divide(sF0,inverse(divide(X1,sF0))),inverse(sF1)),
inference(cp,[status(thm)],[t9,t178]) ).
cnf(t265,plain,
X1 = divide(X1,inverse(sF1)),
inference(step,[status(thm)],[t179,t151]) ).
cnf(t214,plain,
divide(X1,inverse(sF1)) = X1,
inference(orient,[status(thm)],[t265]) ).
cnf(t268,plain,
sF2 = divide(divide(sF1,inverse(divide(inverse(sF3),sF3))),sF2),
inference(step,[status(thm)],[t232,t214]) ).
cnf(t269,plain,
sF2 = inverse(sF3),
inference(step,[status(thm)],[t268,t17]) ).
cnf(t239,plain,
inverse(sF3) = sF2,
inference(orient,[status(thm)],[t269]) ).
cnf(t241,plain,
sF3 = divide(divide(divide(sF1,sF2),sF2),sF3),
inference(cp,[status(thm)],[t56,t239]) ).
cnf(t271,plain,
sF3 = divide(divide(sF3,sF2),sF3),
inference(step,[status(thm)],[t241,t8]) ).
cnf(t58,plain,
a2 = divide(divide(divide(sF1,sF2),sF2),sF3),
inference(cp,[status(thm)],[t56,t6]) ).
cnf(t254,plain,
a2 = divide(divide(sF3,sF2),sF3),
inference(step,[status(thm)],[t58,t8]) ).
cnf(t64,plain,
divide(divide(sF3,sF2),sF3) = a2,
inference(orient,[status(thm)],[t254]) ).
cnf(t272,plain,
sF3 = a2,
inference(step,[status(thm)],[t271,t64]) ).
cnf(t242,plain,
a2 = sF3,
inference(orient,[status(thm)],[t272]) ).
cnf(u0,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(d0,axiom,
multiply(A,B) = divide(A,inverse(B)),
file('/export/starexec/sandbox2/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,t242]) ).
cnf(g0_4,plain,
divide(sF1,sF2) != a2,
inference(rw,[status(thm)],[g0_3,t239]) ).
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,t242]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP554-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/0.37 % Computer : n004.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:03:54 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.84/1.18 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.84/1.18 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------