%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP561-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 : n002.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 3.64s 0.97s
% Output : CNFRefutation 3.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 11 RR)
% Number of literals : 33 ( 32 equ; 4 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t0,axiom,
divide(divide(divide(X1,inverse(X2)),X3),divide(X1,X3)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t9,plain,
divide(divide(divide(X1,inverse(X2)),X3),divide(X1,X3)) = X2,
inference(orient,[status(thm)],[t0]) ).
cnf(t14,plain,
X1 = divide(X2,divide(divide(X3,inverse(X2)),divide(X3,inverse(X1)))),
inference(cp,[status(thm)],[t9,t9]) ).
cnf(t113,plain,
divide(X1,divide(divide(X2,inverse(X1)),divide(X2,inverse(X3)))) = X3,
inference(orient,[status(thm)],[t14]) ).
cnf(t2,axiom,
sF1 = divide(inverse(b1),inverse(b1)),
introduced(definition) ).
cnf(t1,axiom,
sF0 = inverse(b1),
introduced(definition) ).
cnf(t5,plain,
inverse(b1) = sF0,
inference(orient,[status(thm)],[t1]) ).
cnf(t469,plain,
sF1 = divide(sF0,inverse(b1)),
inference(step,[status(thm)],[t2,t5]) ).
cnf(t470,plain,
sF1 = divide(sF0,sF0),
inference(step,[status(thm)],[t469,t5]) ).
cnf(t7,plain,
divide(sF0,sF0) = sF1,
inference(orient,[status(thm)],[t470]) ).
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(t171,plain,
divide(divide(divide(divide(divide(X1,inverse(X2)),X3),inverse(Y3)),divide(X1,X3)),X2) = Y3,
inference(orient,[status(thm)],[t15]) ).
cnf(t205,plain,
X1 = divide(divide(X2,divide(divide(divide(X3,inverse(inverse(X1))),Y3),divide(X3,Y3))),X2),
inference(cp,[status(thm)],[t171,t171]) ).
cnf(t478,plain,
X1 = divide(divide(X2,inverse(X1)),X2),
inference(step,[status(thm)],[t205,t9]) ).
cnf(t235,plain,
divide(divide(X1,inverse(X2)),X1) = X2,
inference(orient,[status(thm)],[t478]) ).
cnf(t479,plain,
divide(X1,sF1) = X1,
inference(step,[status(thm)],[t16,t235]) ).
cnf(t236,plain,
divide(X1,sF1) = X1,
inference(rw,[status(thm)],[t479]) ).
cnf(t254,plain,
divide(X1,sF1) = X1,
inference(orient,[status(thm)],[t236]) ).
cnf(t264,plain,
divide(sF1,inverse(X1)) = X1,
inference(cp,[status(thm)],[t254,t235]) ).
cnf(t305,plain,
divide(sF1,inverse(X1)) = X1,
inference(orient,[status(thm)],[t264]) ).
cnf(t310,plain,
X1 = divide(X2,divide(X2,divide(sF1,inverse(X1)))),
inference(cp,[status(thm)],[t113,t305]) ).
cnf(t501,plain,
X1 = divide(X2,divide(X2,X1)),
inference(step,[status(thm)],[t310,t305]) ).
cnf(t420,plain,
divide(X1,divide(X1,X2)) = X2,
inference(orient,[status(thm)],[t501]) ).
cnf(t432,plain,
sF1 = divide(X1,X1),
inference(cp,[status(thm)],[t420,t254]) ).
cnf(t459,plain,
divide(X1,X1) = sF1,
inference(orient,[status(thm)],[t432]) ).
cnf(u0,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
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(inverse(b1),inverse(b1)) != divide(inverse(a1),inverse(a1)),
inference(definition_unfolding,[status(thm)],[u0,d0]) ).
cnf(g0_0,plain,
sF1 != divide(inverse(a1),inverse(a1)),
inference(rw,[status(thm)],[goal_0,t459]) ).
cnf(g0_1,plain,
sF1 != sF1,
inference(rw,[status(thm)],[g0_0,t459]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP561-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.38 % Computer : n002.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Wed Sep 23 15:07:34 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.64/0.97 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.64/0.97 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------