%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP446-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 : n018.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:26:53 PM UTC 2026
% Result : Unsatisfiable 3.19s 0.90s
% Output : CNFRefutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 4
% Syntax : Number of clauses : 61 ( 61 unt; 0 nHn; 3 RR)
% Number of literals : 61 ( 60 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 120 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t1,axiom,
divide(X1,divide(divide(X2,X2),X3)) = multiply(X1,X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t7,plain,
divide(X1,divide(divide(X2,X2),X3)) = multiply(X1,X3),
inference(orient,[status(thm)],[t1]) ).
cnf(t0,axiom,
divide(divide(X1,X1),X2) = inverse(X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t18,plain,
divide(divide(X1,X1),X2) = inverse(X2),
inference(orient,[status(thm)],[t0]) ).
cnf(t461,plain,
divide(X1,inverse(X3)) = multiply(X1,X3),
inference(step,[status(thm)],[t7,t18]) ).
cnf(t20,plain,
divide(X1,inverse(X3)) = multiply(X1,X3),
inference(rw,[status(thm)],[t461]) ).
cnf(t22,plain,
divide(X1,inverse(X2)) = multiply(X1,X2),
inference(orient,[status(thm)],[t20]) ).
cnf(t23,plain,
multiply(divide(X1,X1),X2) = inverse(inverse(X2)),
inference(cp,[status(thm)],[t22,t18]) ).
cnf(t25,plain,
multiply(divide(X1,X1),X2) = inverse(inverse(X2)),
inference(orient,[status(thm)],[t23]) ).
cnf(t26,plain,
inverse(inverse(X1)) = multiply(multiply(inverse(X2),X2),X1),
inference(cp,[status(thm)],[t25,t22]) ).
cnf(t40,plain,
multiply(multiply(inverse(X1),X1),X2) = inverse(inverse(X2)),
inference(orient,[status(thm)],[t26]) ).
cnf(t2,axiom,
divide(X1,divide(divide(divide(divide(X1,X1),X2),X3),divide(divide(divide(X1,X1),X1),X3))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t3,plain,
divide(X1,divide(divide(divide(divide(X1,X1),X2),X3),divide(divide(divide(X1,X1),X1),X3))) = X2,
inference(orient,[status(thm)],[t2]) ).
cnf(t462,plain,
divide(X1,divide(divide(inverse(X2),X3),divide(divide(divide(X1,X1),X1),X3))) = X2,
inference(step,[status(thm)],[t3,t18]) ).
cnf(t463,plain,
divide(X1,divide(divide(inverse(X2),X3),divide(inverse(X1),X3))) = X2,
inference(step,[status(thm)],[t462,t18]) ).
cnf(t21,plain,
divide(X1,divide(divide(inverse(X2),X3),divide(inverse(X1),X3))) = X2,
inference(rw,[status(thm)],[t463]) ).
cnf(t288,plain,
divide(X1,divide(divide(inverse(X2),X3),divide(inverse(X1),X3))) = X2,
inference(orient,[status(thm)],[t21]) ).
cnf(t24,plain,
inverse(X1) = divide(multiply(inverse(X2),X2),X1),
inference(cp,[status(thm)],[t18,t22]) ).
cnf(t35,plain,
divide(multiply(inverse(X1),X1),X2) = inverse(X2),
inference(orient,[status(thm)],[t24]) ).
cnf(t296,plain,
X1 = inverse(divide(divide(inverse(X1),X2),divide(inverse(multiply(inverse(X3),X3)),X2))),
inference(cp,[status(thm)],[t288,t35]) ).
cnf(t19,plain,
inverse(X1) = divide(inverse(divide(X2,X2)),X1),
inference(cp,[status(thm)],[t18,t18]) ).
cnf(t28,plain,
divide(inverse(divide(X1,X1)),X2) = inverse(X2),
inference(orient,[status(thm)],[t19]) ).
cnf(t30,plain,
inverse(X1) = divide(inverse(multiply(inverse(X2),X2)),X1),
inference(cp,[status(thm)],[t28,t22]) ).
cnf(t48,plain,
divide(inverse(multiply(inverse(X1),X1)),X2) = inverse(X2),
inference(orient,[status(thm)],[t30]) ).
cnf(t468,plain,
X1 = inverse(divide(divide(inverse(X1),X2),inverse(X2))),
inference(step,[status(thm)],[t296,t48]) ).
cnf(t469,plain,
X1 = inverse(multiply(divide(inverse(X1),X2),X2)),
inference(step,[status(thm)],[t468,t22]) ).
cnf(t392,plain,
inverse(multiply(divide(inverse(X1),X2),X2)) = X1,
inference(orient,[status(thm)],[t469]) ).
cnf(t300,plain,
X1 = divide(X2,inverse(divide(inverse(X2),inverse(X1)))),
inference(cp,[status(thm)],[t288,t18]) ).
cnf(t464,plain,
X1 = multiply(X2,divide(inverse(X2),inverse(X1))),
inference(step,[status(thm)],[t300,t22]) ).
cnf(t465,plain,
X1 = multiply(X2,multiply(inverse(X2),X1)),
inference(step,[status(thm)],[t464,t22]) ).
cnf(t323,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(orient,[status(thm)],[t465]) ).
cnf(t27,plain,
inverse(inverse(X1)) = multiply(inverse(divide(X2,X2)),X1),
inference(cp,[status(thm)],[t25,t18]) ).
cnf(t41,plain,
multiply(inverse(divide(X1,X1)),X2) = inverse(inverse(X2)),
inference(orient,[status(thm)],[t27]) ).
cnf(t31,plain,
inverse(X1) = divide(inverse(inverse(divide(X2,X2))),X1),
inference(cp,[status(thm)],[t28,t18]) ).
cnf(t55,plain,
divide(inverse(inverse(divide(X1,X1))),X2) = inverse(X2),
inference(orient,[status(thm)],[t31]) ).
cnf(t65,plain,
inverse(inverse(X1)) = multiply(inverse(inverse(inverse(inverse(divide(X2,X2))))),X1),
inference(cp,[status(thm)],[t41,t55]) ).
cnf(t185,plain,
multiply(inverse(inverse(inverse(inverse(divide(X1,X1))))),X2) = inverse(inverse(X2)),
inference(orient,[status(thm)],[t65]) ).
cnf(t325,plain,
X1 = inverse(inverse(multiply(inverse(inverse(inverse(inverse(inverse(divide(X2,X2)))))),X1))),
inference(cp,[status(thm)],[t323,t185]) ).
cnf(t33,plain,
inverse(inverse(X1)) = multiply(inverse(inverse(divide(X2,X2))),X1),
inference(cp,[status(thm)],[t25,t28]) ).
cnf(t67,plain,
multiply(inverse(inverse(divide(X1,X1))),X2) = inverse(inverse(X2)),
inference(orient,[status(thm)],[t33]) ).
cnf(t69,plain,
inverse(inverse(X1)) = multiply(inverse(inverse(inverse(inverse(inverse(divide(X2,X2)))))),X1),
inference(cp,[status(thm)],[t67,t55]) ).
cnf(t247,plain,
multiply(inverse(inverse(inverse(inverse(inverse(divide(X1,X1)))))),X2) = inverse(inverse(X2)),
inference(orient,[status(thm)],[t69]) ).
cnf(t466,plain,
X1 = inverse(inverse(inverse(inverse(X1)))),
inference(step,[status(thm)],[t325,t247]) ).
cnf(t345,plain,
inverse(inverse(inverse(inverse(X1)))) = X1,
inference(orient,[status(thm)],[t466]) ).
cnf(t346,plain,
multiply(X1,inverse(inverse(inverse(X2)))) = divide(X1,X2),
inference(cp,[status(thm)],[t22,t345]) ).
cnf(t376,plain,
multiply(X1,inverse(inverse(inverse(X2)))) = divide(X1,X2),
inference(orient,[status(thm)],[t346]) ).
cnf(t344,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(cp,[status(thm)],[t323,t323]) ).
cnf(t358,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(orient,[status(thm)],[t344]) ).
cnf(t377,plain,
divide(inverse(inverse(X1)),X2) = multiply(X1,inverse(inverse(inverse(X2)))),
inference(cp,[status(thm)],[t376,t358]) ).
cnf(t467,plain,
divide(inverse(inverse(X1)),X2) = divide(X1,X2),
inference(step,[status(thm)],[t377,t376]) ).
cnf(t381,plain,
divide(inverse(inverse(X1)),X2) = divide(X1,X2),
inference(orient,[status(thm)],[t467]) ).
cnf(t394,plain,
inverse(X1) = inverse(multiply(divide(X1,X2),X2)),
inference(cp,[status(thm)],[t392,t381]) ).
cnf(t416,plain,
inverse(multiply(divide(X1,X2),X2)) = inverse(X1),
inference(orient,[status(thm)],[t394]) ).
cnf(t470,plain,
inverse(inverse(X1)) = X1,
inference(step,[status(thm)],[t392,t416]) ).
cnf(t442,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[t470]) ).
cnf(t443,plain,
inverse(inverse(X1)) = X1,
inference(orient,[status(thm)],[t442]) ).
cnf(t473,plain,
multiply(multiply(inverse(X1),X1),X2) = X2,
inference(step,[status(thm)],[t40,t443]) ).
cnf(t446,plain,
multiply(multiply(inverse(X1),X1),X2) = X2,
inference(orient,[status(thm)],[t473]) ).
cnf(goal_0,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
a2 != a2,
inference(rw,[status(thm)],[goal_0,t446]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP446-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.36 % Computer : n018.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 14:49:18 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.19/0.90 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.19/0.90 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------