%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP529-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 : n008.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:27 PM UTC 2026
% Result : Unsatisfiable 0.13s 5.81s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 4
% Syntax : Number of clauses : 36 ( 36 unt; 0 nHn; 5 RR)
% Number of literals : 36 ( 35 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 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 : 64 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t0,axiom,
divide(divide(X1,X1),X2) = inverse(X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t15,plain,
divide(divide(X1,X1),X2) = inverse(X2),
inference(orient,[status(thm)],[t0]) ).
cnf(t2,axiom,
divide(divide(X1,divide(X2,X3)),divide(X1,X2)) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t3,plain,
divide(divide(X1,divide(X2,X3)),divide(X1,X2)) = X3,
inference(orient,[status(thm)],[t2]) ).
cnf(t16,plain,
inverse(divide(divide(X1,X2),X1)) = X2,
inference(cp,[status(thm)],[t15,t3]) ).
cnf(t30,plain,
inverse(divide(divide(X1,X2),X1)) = X2,
inference(orient,[status(thm)],[t16]) ).
cnf(t31,plain,
X1 = inverse(inverse(X1)),
inference(cp,[status(thm)],[t30,t15]) ).
cnf(t37,plain,
inverse(inverse(X1)) = X1,
inference(orient,[status(thm)],[t31]) ).
cnf(t40,plain,
divide(divide(X1,X2),X1) = inverse(X2),
inference(cp,[status(thm)],[t37,t30]) ).
cnf(t44,plain,
divide(divide(X1,X2),X1) = inverse(X2),
inference(orient,[status(thm)],[t40]) ).
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(t133,plain,
divide(X1,inverse(X3)) = multiply(X1,X3),
inference(step,[status(thm)],[t7,t15]) ).
cnf(t21,plain,
divide(X1,inverse(X3)) = multiply(X1,X3),
inference(rw,[status(thm)],[t133]) ).
cnf(t22,plain,
divide(X1,inverse(X2)) = multiply(X1,X2),
inference(orient,[status(thm)],[t21]) ).
cnf(t46,plain,
inverse(inverse(X1)) = divide(multiply(X2,X1),X2),
inference(cp,[status(thm)],[t44,t22]) ).
cnf(t136,plain,
X1 = divide(multiply(X2,X1),X2),
inference(step,[status(thm)],[t46,t37]) ).
cnf(t53,plain,
divide(multiply(X1,X2),X1) = X2,
inference(orient,[status(thm)],[t136]) ).
cnf(t23,plain,
multiply(divide(X1,X1),X2) = inverse(inverse(X2)),
inference(cp,[status(thm)],[t22,t15]) ).
cnf(t27,plain,
multiply(divide(X1,X1),X2) = inverse(inverse(X2)),
inference(orient,[status(thm)],[t23]) ).
cnf(t134,plain,
multiply(divide(X1,X1),X2) = X2,
inference(step,[status(thm)],[t27,t37]) ).
cnf(t38,plain,
multiply(divide(X1,X1),X2) = X2,
inference(orient,[status(thm)],[t134]) ).
cnf(t55,plain,
X1 = divide(X1,divide(X2,X2)),
inference(cp,[status(thm)],[t53,t38]) ).
cnf(t60,plain,
divide(X1,divide(X2,X2)) = X1,
inference(orient,[status(thm)],[t55]) ).
cnf(t61,plain,
divide(X1,divide(X1,X2)) = X2,
inference(cp,[status(thm)],[t60,t3]) ).
cnf(t68,plain,
divide(X1,divide(X1,X2)) = X2,
inference(orient,[status(thm)],[t61]) ).
cnf(t72,plain,
X1 = divide(divide(X1,X2),inverse(X2)),
inference(cp,[status(thm)],[t68,t44]) ).
cnf(t138,plain,
X1 = multiply(divide(X1,X2),X2),
inference(step,[status(thm)],[t72,t22]) ).
cnf(t96,plain,
multiply(divide(X1,X2),X2) = X1,
inference(orient,[status(thm)],[t138]) ).
cnf(t99,plain,
divide(X1,X2) = multiply(inverse(X2),X1),
inference(cp,[status(thm)],[t96,t44]) ).
cnf(t102,plain,
multiply(inverse(X1),X2) = divide(X2,X1),
inference(orient,[status(thm)],[t99]) ).
cnf(goal_0,negated_conjecture,
multiply(inverse(b1),b1) != multiply(inverse(a1),a1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
divide(b1,b1) != multiply(inverse(a1),a1),
inference(rw,[status(thm)],[goal_0,t102]) ).
cnf(g0_1,plain,
divide(b1,b1) != divide(a1,a1),
inference(rw,[status(thm)],[g0_0,t102]) ).
cnf(g0_2,plain,
divide(b1,b1) != divide(b1,b1),
inference(rw,[status(thm)],[g0_1]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP529-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/5.36 % Computer : n008.cluster.edu
% 0.08/5.36 % Model : x86_64 x86_64
% 0.08/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.36 % Memory : 8046.5625MB
% 0.08/5.36 % OS : Linux 6.8.0-71-generic
% 0.08/5.36 % CPULimit : 300
% 0.08/5.36 % WCLimit : 300
% 0.08/5.36 % DateTime : Wed Sep 23 15:00:20 UTC 2026
% 0.08/5.36 % CPUTime :
% 0.08/5.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.13/5.81 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/5.81 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------