%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP526-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 : n019.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 5.40s 1.20s
% Output : CNFRefutation 5.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 4
% Syntax : Number of clauses : 37 ( 37 unt; 0 nHn; 4 RR)
% Number of literals : 37 ( 36 equ; 3 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 : 68 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t1,axiom,
divide(X1,divide(divide(X1,X2),divide(X3,X2))) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t3,plain,
divide(X1,divide(divide(X1,X2),divide(X3,X2))) = X3,
inference(orient,[status(thm)],[t1]) ).
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(t18,plain,
X1 = divide(X2,inverse(divide(X1,X2))),
inference(cp,[status(thm)],[t3,t15]) ).
cnf(t2,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)],[t2]) ).
cnf(t184,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)],[t184]) ).
cnf(t22,plain,
divide(X1,inverse(X2)) = multiply(X1,X2),
inference(orient,[status(thm)],[t21]) ).
cnf(t185,plain,
X1 = multiply(X2,divide(X1,X2)),
inference(step,[status(thm)],[t18,t22]) ).
cnf(t30,plain,
multiply(X1,divide(X2,X1)) = X2,
inference(orient,[status(thm)],[t185]) ).
cnf(t33,plain,
X1 = multiply(inverse(X2),multiply(X1,X2)),
inference(cp,[status(thm)],[t30,t22]) ).
cnf(t35,plain,
multiply(inverse(X1),multiply(X2,X1)) = X2,
inference(orient,[status(thm)],[t33]) ).
cnf(t34,plain,
divide(X1,X1) = multiply(X2,inverse(X2)),
inference(cp,[status(thm)],[t30,t15]) ).
cnf(t70,plain,
divide(X1,X1) = multiply(X2,inverse(X2)),
inference(orient,[status(thm)],[t34]) ).
cnf(t87,plain,
divide(X1,X1) = divide(X2,X2),
inference(cp,[status(thm)],[t70,t70]) ).
cnf(t88,plain,
divide(X1,X1) = divide(X2,X2),
inference(orient,[status(thm)],[t87]) ).
cnf(t95,plain,
X1 = divide(X1,divide(X2,X2)),
inference(cp,[status(thm)],[t3,t88]) ).
cnf(t119,plain,
divide(X1,divide(X2,X2)) = X1,
inference(orient,[status(thm)],[t95]) ).
cnf(t128,plain,
X1 = divide(X2,divide(X2,X1)),
inference(cp,[status(thm)],[t3,t119]) ).
cnf(t149,plain,
divide(X1,divide(X1,X2)) = X2,
inference(orient,[status(thm)],[t128]) ).
cnf(t156,plain,
X1 = multiply(divide(X1,X2),X2),
inference(cp,[status(thm)],[t30,t149]) ).
cnf(t166,plain,
multiply(divide(X1,X2),X2) = X1,
inference(orient,[status(thm)],[t156]) ).
cnf(t173,plain,
divide(X1,X2) = multiply(inverse(X2),X1),
inference(cp,[status(thm)],[t35,t166]) ).
cnf(t175,plain,
multiply(inverse(X1),X2) = divide(X2,X1),
inference(orient,[status(thm)],[t173]) ).
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(t127,plain,
X1 = multiply(divide(X2,X2),X1),
inference(cp,[status(thm)],[t30,t119]) ).
cnf(t189,plain,
X1 = inverse(inverse(X1)),
inference(step,[status(thm)],[t127,t27]) ).
cnf(t131,plain,
inverse(inverse(X1)) = X1,
inference(orient,[status(thm)],[t189]) ).
cnf(t190,plain,
multiply(divide(X1,X1),X2) = X2,
inference(step,[status(thm)],[t27,t131]) ).
cnf(t132,plain,
multiply(divide(X1,X1),X2) = X2,
inference(orient,[status(thm)],[t190]) ).
cnf(goal_0,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
multiply(divide(b2,b2),a2) != a2,
inference(rw,[status(thm)],[goal_0,t175]) ).
cnf(g0_1,plain,
a2 != a2,
inference(rw,[status(thm)],[g0_0,t132]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP526-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/0.43 % Computer : n019.cluster.edu
% 0.08/0.43 % Model : x86_64 x86_64
% 0.08/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.43 % Memory : 8046.5625MB
% 0.08/0.43 % OS : Linux 6.8.0-71-generic
% 0.08/0.43 % CPULimit : 300
% 0.08/0.43 % WCLimit : 300
% 0.08/0.43 % DateTime : Wed Sep 23 14:59:20 UTC 2026
% 0.08/0.43 % CPUTime :
% 0.08/0.43 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.40/1.20 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.40/1.20 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------