%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP569-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 : n017.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:33 PM UTC 2026
% Result : Unsatisfiable 4.30s 1.27s
% Output : CNFRefutation 4.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 7
% Syntax : Number of clauses : 46 ( 46 unt; 0 nHn; 26 RR)
% Number of literals : 46 ( 45 equ; 7 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t3,axiom,
sF1 = double_divide(a1,double_divide(a1,identity)),
introduced(definition) ).
cnf(u1,axiom,
identity = double_divide(A,inverse(A)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(d1,axiom,
inverse(A) = double_divide(A,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t0,plain,
double_divide(X1,double_divide(X1,identity)) = identity,
inference(definition_unfolding,[status(thm)],[u1,d1]) ).
cnf(t6,plain,
double_divide(X1,double_divide(X1,identity)) = identity,
inference(orient,[status(thm)],[t0]) ).
cnf(t62,plain,
sF1 = identity,
inference(step,[status(thm)],[t3,t6]) ).
cnf(t9,plain,
identity = sF1,
inference(orient,[status(thm)],[t62]) ).
cnf(t11,plain,
double_divide(X1,double_divide(X1,sF1)) = identity,
inference(rw,[status(thm)],[t6]) ).
cnf(t66,plain,
double_divide(X1,double_divide(X1,sF1)) = sF1,
inference(step,[status(thm)],[t11,t9]) ).
cnf(t15,plain,
double_divide(X1,double_divide(X1,sF1)) = sF1,
inference(orient,[status(thm)],[t66]) ).
cnf(t4,axiom,
sF2 = double_divide(double_divide(a1,double_divide(a1,identity)),identity),
introduced(definition) ).
cnf(t67,plain,
sF2 = double_divide(double_divide(a1,double_divide(a1,sF1)),identity),
inference(step,[status(thm)],[t4,t9]) ).
cnf(t68,plain,
sF2 = double_divide(sF1,identity),
inference(step,[status(thm)],[t67,t15]) ).
cnf(t69,plain,
sF2 = double_divide(sF1,sF1),
inference(step,[status(thm)],[t68,t9]) ).
cnf(t16,plain,
double_divide(sF1,sF1) = sF2,
inference(orient,[status(thm)],[t69]) ).
cnf(t1,axiom,
double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(X3,identity))),double_divide(identity,identity)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t70,plain,
double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(X3,sF1))),double_divide(identity,identity)) = X2,
inference(step,[status(thm)],[t1,t9]) ).
cnf(t71,plain,
double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(X3,sF1))),double_divide(sF1,identity)) = X2,
inference(step,[status(thm)],[t70,t9]) ).
cnf(t72,plain,
double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(X3,sF1))),double_divide(sF1,sF1)) = X2,
inference(step,[status(thm)],[t71,t9]) ).
cnf(t73,plain,
double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(X3,sF1))),sF2) = X2,
inference(step,[status(thm)],[t72,t16]) ).
cnf(t19,plain,
double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(X3,sF1))),sF2) = X2,
inference(orient,[status(thm)],[t73]) ).
cnf(t25,plain,
X1 = double_divide(double_divide(sF1,double_divide(double_divide(X1,sF2),double_divide(sF1,sF1))),sF2),
inference(cp,[status(thm)],[t19,t16]) ).
cnf(t76,plain,
X1 = double_divide(double_divide(sF1,double_divide(double_divide(X1,sF2),sF2)),sF2),
inference(step,[status(thm)],[t25,t16]) ).
cnf(t42,plain,
double_divide(double_divide(sF1,double_divide(double_divide(X1,sF2),sF2)),sF2) = X1,
inference(orient,[status(thm)],[t76]) ).
cnf(t23,plain,
X1 = double_divide(double_divide(X1,double_divide(sF1,double_divide(sF1,sF1))),sF2),
inference(cp,[status(thm)],[t19,t15]) ).
cnf(t74,plain,
X1 = double_divide(double_divide(X1,sF1),sF2),
inference(step,[status(thm)],[t23,t15]) ).
cnf(t29,plain,
double_divide(double_divide(X1,sF1),sF2) = X1,
inference(orient,[status(thm)],[t74]) ).
cnf(t31,plain,
sF1 = double_divide(sF2,sF2),
inference(cp,[status(thm)],[t29,t16]) ).
cnf(t38,plain,
double_divide(sF2,sF2) = sF1,
inference(orient,[status(thm)],[t31]) ).
cnf(t47,plain,
sF2 = double_divide(double_divide(sF1,double_divide(sF1,sF2)),sF2),
inference(cp,[status(thm)],[t42,t38]) ).
cnf(t17,plain,
sF1 = double_divide(sF1,sF2),
inference(cp,[status(thm)],[t15,t16]) ).
cnf(t18,plain,
double_divide(sF1,sF2) = sF1,
inference(orient,[status(thm)],[t17]) ).
cnf(t77,plain,
sF2 = double_divide(double_divide(sF1,sF1),sF2),
inference(step,[status(thm)],[t47,t18]) ).
cnf(t78,plain,
sF2 = sF1,
inference(step,[status(thm)],[t77,t29]) ).
cnf(t51,plain,
sF2 = sF1,
inference(orient,[status(thm)],[t78]) ).
cnf(t79,plain,
double_divide(sF1,sF1) = sF1,
inference(step,[status(thm)],[t16,t51]) ).
cnf(t52,plain,
double_divide(sF1,sF1) = sF1,
inference(orient,[status(thm)],[t79]) ).
cnf(u0,negated_conjecture,
multiply(inverse(a1),a1) != identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(d0,axiom,
multiply(A,B) = double_divide(double_divide(B,A),identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(goal_0,negated_conjecture,
double_divide(double_divide(a1,double_divide(a1,identity)),identity) != identity,
inference(definition_unfolding,[status(thm)],[u0,d0,d1]) ).
cnf(g0_0,plain,
double_divide(double_divide(a1,double_divide(a1,sF1)),identity) != identity,
inference(rw,[status(thm)],[goal_0,t9]) ).
cnf(g0_1,plain,
double_divide(sF1,identity) != identity,
inference(rw,[status(thm)],[g0_0,t15]) ).
cnf(g0_2,plain,
double_divide(sF1,sF1) != identity,
inference(rw,[status(thm)],[g0_1,t9]) ).
cnf(g0_3,plain,
sF1 != identity,
inference(rw,[status(thm)],[g0_2,t52]) ).
cnf(g0_4,plain,
sF1 != sF1,
inference(rw,[status(thm)],[g0_3,t9]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP569-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.55 % Computer : n017.cluster.edu
% 0.09/0.55 % Model : x86_64 x86_64
% 0.09/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.55 % Memory : 8046.5625MB
% 0.09/0.55 % OS : Linux 6.8.0-71-generic
% 0.09/0.55 % CPULimit : 300
% 0.09/0.55 % WCLimit : 300
% 0.09/0.55 % DateTime : Wed Sep 23 15:01:45 UTC 2026
% 0.14/0.55 % CPUTime :
% 0.14/0.55 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.30/1.27 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.30/1.27 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------