%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP550-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 : n020.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:30 PM UTC 2026
% Result : Unsatisfiable 5.37s 11.14s
% Output : CNFRefutation 5.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of clauses : 32 ( 32 unt; 0 nHn; 9 RR)
% Number of literals : 32 ( 31 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t0,axiom,
divide(X1,X1) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t6,plain,
divide(X1,X1) = identity,
inference(orient,[status(thm)],[t0]) ).
cnf(t3,axiom,
sF1 = divide(divide(identity,b2),divide(identity,b2)),
introduced(definition) ).
cnf(t106,plain,
sF1 = identity,
inference(step,[status(thm)],[t3,t6]) ).
cnf(t9,plain,
identity = sF1,
inference(orient,[status(thm)],[t106]) ).
cnf(t107,plain,
divide(X1,X1) = sF1,
inference(step,[status(thm)],[t6,t9]) ).
cnf(t10,plain,
divide(X1,X1) = sF1,
inference(orient,[status(thm)],[t107]) ).
cnf(t1,axiom,
divide(divide(identity,X1),divide(divide(divide(X2,X1),X3),X2)) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t111,plain,
divide(divide(sF1,X1),divide(divide(divide(X2,X1),X3),X2)) = X3,
inference(step,[status(thm)],[t1,t9]) ).
cnf(t16,plain,
divide(divide(sF1,X1),divide(divide(divide(X2,X1),X3),X2)) = X3,
inference(orient,[status(thm)],[t111]) ).
cnf(t18,plain,
divide(X1,X2) = divide(divide(sF1,X2),divide(sF1,X1)),
inference(cp,[status(thm)],[t16,t10]) ).
cnf(t26,plain,
divide(divide(sF1,X1),divide(sF1,X2)) = divide(X2,X1),
inference(orient,[status(thm)],[t18]) ).
cnf(t27,plain,
divide(X1,sF1) = divide(sF1,divide(sF1,X1)),
inference(cp,[status(thm)],[t26,t10]) ).
cnf(t35,plain,
divide(sF1,divide(sF1,X1)) = divide(X1,sF1),
inference(orient,[status(thm)],[t27]) ).
cnf(t17,plain,
X1 = divide(sF1,divide(divide(divide(X2,sF1),X1),X2)),
inference(cp,[status(thm)],[t16,t10]) ).
cnf(t83,plain,
divide(sF1,divide(divide(divide(X1,sF1),X2),X1)) = X2,
inference(orient,[status(thm)],[t17]) ).
cnf(t84,plain,
X1 = divide(sF1,divide(divide(sF1,X1),sF1)),
inference(cp,[status(thm)],[t83,t10]) ).
cnf(t28,plain,
divide(sF1,X1) = divide(divide(sF1,X1),sF1),
inference(cp,[status(thm)],[t26,t10]) ).
cnf(t55,plain,
divide(divide(sF1,X1),sF1) = divide(sF1,X1),
inference(orient,[status(thm)],[t28]) ).
cnf(t122,plain,
X1 = divide(sF1,divide(sF1,X1)),
inference(step,[status(thm)],[t84,t55]) ).
cnf(t123,plain,
X1 = divide(X1,sF1),
inference(step,[status(thm)],[t122,t35]) ).
cnf(t94,plain,
divide(X1,sF1) = X1,
inference(orient,[status(thm)],[t123]) ).
cnf(t124,plain,
divide(sF1,divide(sF1,X1)) = X1,
inference(step,[status(thm)],[t35,t94]) ).
cnf(t95,plain,
divide(sF1,divide(sF1,X1)) = X1,
inference(orient,[status(thm)],[t124]) ).
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,divide(identity,B)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(d1,axiom,
inverse(A) = divide(identity,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(goal_0,negated_conjecture,
divide(divide(divide(identity,b2),divide(identity,b2)),divide(identity,a2)) != a2,
inference(definition_unfolding,[status(thm)],[u0,d0,d1]) ).
cnf(g0_0,plain,
divide(sF1,divide(identity,a2)) != a2,
inference(rw,[status(thm)],[goal_0,t10]) ).
cnf(g0_1,plain,
divide(sF1,divide(sF1,a2)) != a2,
inference(rw,[status(thm)],[g0_0,t9]) ).
cnf(g0_2,plain,
a2 != a2,
inference(rw,[status(thm)],[g0_1,t95]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP550-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/10.37 % Computer : n020.cluster.edu
% 0.10/10.37 % Model : x86_64 x86_64
% 0.10/10.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.37 % Memory : 8046.5625MB
% 0.10/10.37 % OS : Linux 6.8.0-71-generic
% 0.10/10.37 % CPULimit : 300
% 0.10/10.37 % WCLimit : 300
% 0.10/10.38 % DateTime : Wed Sep 23 15:04:29 UTC 2026
% 0.10/10.38 % CPUTime :
% 0.10/10.38 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.37/11.14 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.37/11.14 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------