%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP564-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n026.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.25s 1.09s
% Output : CNFRefutation 5.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 7
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 23 RR)
% Number of literals : 43 ( 42 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 : 40 ( 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(t407,plain,
sF1 = divide(b,sF0),
inference(step,[status(thm)],[t2,t5]) ).
cnf(t7,plain,
divide(b,sF0) = sF1,
inference(orient,[status(thm)],[t407]) ).
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(t408,plain,
sF3 = divide(a,sF2),
inference(step,[status(thm)],[t4,t6]) ).
cnf(t8,plain,
divide(a,sF2) = sF3,
inference(orient,[status(thm)],[t408]) ).
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(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(t167,plain,
divide(divide(divide(divide(divide(X1,inverse(X2)),X3),inverse(Y3)),divide(X1,X3)),X2) = Y3,
inference(orient,[status(thm)],[t15]) ).
cnf(t201,plain,
X1 = divide(divide(X2,divide(divide(divide(X3,inverse(inverse(X1))),Y3),divide(X3,Y3))),X2),
inference(cp,[status(thm)],[t167,t167]) ).
cnf(t416,plain,
X1 = divide(divide(X2,inverse(X1)),X2),
inference(step,[status(thm)],[t201,t9]) ).
cnf(t219,plain,
divide(divide(X1,inverse(X2)),X1) = X2,
inference(orient,[status(thm)],[t416]) ).
cnf(t14,plain,
X1 = divide(X2,divide(divide(X3,inverse(X2)),divide(X3,inverse(X1)))),
inference(cp,[status(thm)],[t9,t9]) ).
cnf(t111,plain,
divide(X1,divide(divide(X2,inverse(X1)),divide(X2,inverse(X3)))) = X3,
inference(orient,[status(thm)],[t14]) ).
cnf(t220,plain,
a = divide(divide(X1,sF0),X1),
inference(cp,[status(thm)],[t219,t5]) ).
cnf(t236,plain,
divide(divide(X1,sF0),X1) = a,
inference(orient,[status(thm)],[t220]) ).
cnf(t240,plain,
a = divide(X1,divide(sF0,inverse(X1))),
inference(cp,[status(thm)],[t236,t219]) ).
cnf(t341,plain,
divide(X1,divide(sF0,inverse(X1))) = a,
inference(orient,[status(thm)],[t240]) ).
cnf(t350,plain,
divide(sF0,inverse(X1)) = divide(X1,a),
inference(cp,[status(thm)],[t111,t341]) ).
cnf(t353,plain,
divide(sF0,inverse(X1)) = divide(X1,a),
inference(orient,[status(thm)],[t350]) ).
cnf(t364,plain,
X1 = divide(divide(X1,a),sF0),
inference(cp,[status(thm)],[t219,t353]) ).
cnf(t384,plain,
divide(divide(X1,a),sF0) = X1,
inference(orient,[status(thm)],[t364]) ).
cnf(t221,plain,
b = divide(divide(X1,sF2),X1),
inference(cp,[status(thm)],[t219,t6]) ).
cnf(t257,plain,
divide(divide(X1,sF2),X1) = b,
inference(orient,[status(thm)],[t221]) ).
cnf(t388,plain,
divide(a,sF2) = divide(b,sF0),
inference(cp,[status(thm)],[t384,t257]) ).
cnf(t424,plain,
sF3 = divide(b,sF0),
inference(step,[status(thm)],[t388,t8]) ).
cnf(t425,plain,
sF3 = sF1,
inference(step,[status(thm)],[t424,t7]) ).
cnf(t394,plain,
sF3 = sF1,
inference(orient,[status(thm)],[t425]) ).
cnf(t426,plain,
divide(a,sF2) = sF1,
inference(step,[status(thm)],[t8,t394]) ).
cnf(t395,plain,
divide(a,sF2) = sF1,
inference(orient,[status(thm)],[t426]) ).
cnf(u0,negated_conjecture,
multiply(a,b) != multiply(b,a),
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(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,t395]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP564-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.36 % Computer : n026.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Wed Sep 23 15:08:10 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.25/1.09 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.25/1.09 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------