%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP560-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n003.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 5.36s 1.08s
% Output : CNFRefutation 5.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 7
% Syntax : Number of clauses : 42 ( 42 unt; 0 nHn; 25 RR)
% Number of literals : 42 ( 41 equ; 6 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 : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t1,axiom,
sF0 = inverse(a),
introduced(definition) ).
cnf(t5,plain,
inverse(a) = sF0,
inference(orient,[status(thm)],[t1]) ).
cnf(t2,axiom,
sF1 = divide(b,inverse(a)),
introduced(definition) ).
cnf(t399,plain,
sF1 = divide(b,sF0),
inference(step,[status(thm)],[t2,t5]) ).
cnf(t7,plain,
divide(b,sF0) = sF1,
inference(orient,[status(thm)],[t399]) ).
cnf(t3,axiom,
sF2 = inverse(b),
introduced(definition) ).
cnf(t6,plain,
inverse(b) = sF2,
inference(orient,[status(thm)],[t3]) ).
cnf(t4,axiom,
sF3 = divide(a,inverse(b)),
introduced(definition) ).
cnf(t400,plain,
sF3 = divide(a,sF2),
inference(step,[status(thm)],[t4,t6]) ).
cnf(t8,plain,
divide(a,sF2) = sF3,
inference(orient,[status(thm)],[t400]) ).
cnf(t0,axiom,
divide(X1,inverse(divide(divide(X2,X3),divide(X1,X3)))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t9,plain,
divide(X1,inverse(divide(divide(X2,X3),divide(X1,X3)))) = X2,
inference(orient,[status(thm)],[t0]) ).
cnf(t14,plain,
X1 = divide(X2,inverse(divide(X3,divide(X2,inverse(divide(divide(X3,Y3),divide(X1,Y3))))))),
inference(cp,[status(thm)],[t9,t9]) ).
cnf(t68,plain,
divide(X1,inverse(divide(X2,divide(X1,inverse(divide(divide(X2,X3),divide(Y3,X3))))))) = Y3,
inference(orient,[status(thm)],[t14]) ).
cnf(t69,plain,
X1 = divide(X1,inverse(divide(X2,X2))),
inference(cp,[status(thm)],[t68,t9]) ).
cnf(t99,plain,
divide(X1,inverse(divide(X2,X2))) = X1,
inference(orient,[status(thm)],[t69]) ).
cnf(t113,plain,
X1 = divide(X2,inverse(divide(X1,divide(X2,inverse(divide(X3,X3)))))),
inference(cp,[status(thm)],[t9,t99]) ).
cnf(t413,plain,
X1 = divide(X2,inverse(divide(X1,X2))),
inference(step,[status(thm)],[t113,t99]) ).
cnf(t190,plain,
divide(X1,inverse(divide(X2,X1))) = X2,
inference(orient,[status(thm)],[t413]) ).
cnf(t10,plain,
b = divide(X1,inverse(divide(sF1,divide(X1,sF0)))),
inference(cp,[status(thm)],[t9,t7]) ).
cnf(t16,plain,
divide(X1,inverse(divide(sF1,divide(X1,sF0)))) = b,
inference(orient,[status(thm)],[t10]) ).
cnf(t201,plain,
X1 = divide(inverse(divide(X2,X2)),inverse(X1)),
inference(cp,[status(thm)],[t190,t99]) ).
cnf(t338,plain,
divide(inverse(divide(X1,X1)),inverse(X2)) = X2,
inference(orient,[status(thm)],[t201]) ).
cnf(t339,plain,
a = divide(inverse(divide(X1,X1)),sF0),
inference(cp,[status(thm)],[t338,t5]) ).
cnf(t361,plain,
divide(inverse(divide(X1,X1)),sF0) = a,
inference(orient,[status(thm)],[t339]) ).
cnf(t367,plain,
b = divide(inverse(divide(X1,X1)),inverse(divide(sF1,a))),
inference(cp,[status(thm)],[t16,t361]) ).
cnf(t420,plain,
b = divide(sF1,a),
inference(step,[status(thm)],[t367,t338]) ).
cnf(t375,plain,
divide(sF1,a) = b,
inference(orient,[status(thm)],[t420]) ).
cnf(t382,plain,
sF1 = divide(a,inverse(b)),
inference(cp,[status(thm)],[t190,t375]) ).
cnf(t421,plain,
sF1 = divide(a,sF2),
inference(step,[status(thm)],[t382,t6]) ).
cnf(t422,plain,
sF1 = sF3,
inference(step,[status(thm)],[t421,t8]) ).
cnf(t383,plain,
sF3 = sF1,
inference(orient,[status(thm)],[t422]) ).
cnf(t423,plain,
divide(a,sF2) = sF1,
inference(step,[status(thm)],[t8,t383]) ).
cnf(t384,plain,
divide(a,sF2) = sF1,
inference(orient,[status(thm)],[t423]) ).
cnf(u0,negated_conjecture,
multiply(a,b) != multiply(b,a),
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(b,inverse(a)) != divide(a,inverse(b)),
inference(definition_unfolding,[status(thm)],[u0,d0]) ).
cnf(g0_0,plain,
divide(b,sF0) != divide(a,inverse(b)),
inference(rw,[status(thm)],[goal_0,t5]) ).
cnf(g0_1,plain,
sF1 != divide(a,inverse(b)),
inference(rw,[status(thm)],[g0_0,t7]) ).
cnf(g0_2,plain,
sF1 != divide(a,sF2),
inference(rw,[status(thm)],[g0_1,t6]) ).
cnf(g0_3,plain,
sF1 != sF1,
inference(rw,[status(thm)],[g0_2,t384]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP560-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n003.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:06:20 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.36/1.08 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.36/1.08 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------