%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP532-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 : 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:28 PM UTC 2026
% Result : Unsatisfiable 6.71s 11.43s
% Output : CNFRefutation 6.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 6
% Syntax : Number of clauses : 44 ( 44 unt; 0 nHn; 18 RR)
% Number of literals : 44 ( 43 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t3,axiom,
sFlat0 = multiply(b,a),
introduced(definition) ).
cnf(t25,plain,
multiply(b,a) = sFlat0,
inference(orient,[status(thm)],[t3]) ).
cnf(t4,axiom,
sFlat1 = multiply(a,b),
introduced(definition) ).
cnf(t24,plain,
multiply(a,b) = sFlat1,
inference(orient,[status(thm)],[t4]) ).
cnf(t0,axiom,
divide(divide(X1,X1),X2) = inverse(X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t17,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/sandbox2/benchmark/theBenchmark.p') ).
cnf(t5,plain,
divide(divide(X1,divide(X2,X3)),divide(X1,X2)) = X3,
inference(orient,[status(thm)],[t2]) ).
cnf(t18,plain,
inverse(divide(divide(X1,X2),X1)) = X2,
inference(cp,[status(thm)],[t17,t5]) ).
cnf(t34,plain,
inverse(divide(divide(X1,X2),X1)) = X2,
inference(orient,[status(thm)],[t18]) ).
cnf(t35,plain,
X1 = inverse(inverse(X1)),
inference(cp,[status(thm)],[t34,t17]) ).
cnf(t41,plain,
inverse(inverse(X1)) = X1,
inference(orient,[status(thm)],[t35]) ).
cnf(t44,plain,
divide(divide(X1,X2),X1) = inverse(X2),
inference(cp,[status(thm)],[t41,t34]) ).
cnf(t48,plain,
divide(divide(X1,X2),X1) = inverse(X2),
inference(orient,[status(thm)],[t44]) ).
cnf(t1,axiom,
divide(X1,divide(divide(X2,X2),X3)) = multiply(X1,X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t9,plain,
divide(X1,divide(divide(X2,X2),X3)) = multiply(X1,X3),
inference(orient,[status(thm)],[t1]) ).
cnf(t128,plain,
divide(X1,inverse(X3)) = multiply(X1,X3),
inference(step,[status(thm)],[t9,t17]) ).
cnf(t23,plain,
divide(X1,inverse(X3)) = multiply(X1,X3),
inference(rw,[status(thm)],[t128]) ).
cnf(t26,plain,
divide(X1,inverse(X2)) = multiply(X1,X2),
inference(orient,[status(thm)],[t23]) ).
cnf(t50,plain,
inverse(inverse(X1)) = divide(multiply(X2,X1),X2),
inference(cp,[status(thm)],[t48,t26]) ).
cnf(t131,plain,
X1 = divide(multiply(X2,X1),X2),
inference(step,[status(thm)],[t50,t41]) ).
cnf(t57,plain,
divide(multiply(X1,X2),X1) = X2,
inference(orient,[status(thm)],[t131]) ).
cnf(t27,plain,
multiply(divide(X1,X1),X2) = inverse(inverse(X2)),
inference(cp,[status(thm)],[t26,t17]) ).
cnf(t31,plain,
multiply(divide(X1,X1),X2) = inverse(inverse(X2)),
inference(orient,[status(thm)],[t27]) ).
cnf(t129,plain,
multiply(divide(X1,X1),X2) = X2,
inference(step,[status(thm)],[t31,t41]) ).
cnf(t42,plain,
multiply(divide(X1,X1),X2) = X2,
inference(orient,[status(thm)],[t129]) ).
cnf(t59,plain,
X1 = divide(X1,divide(X2,X2)),
inference(cp,[status(thm)],[t57,t42]) ).
cnf(t96,plain,
divide(X1,divide(X2,X2)) = X1,
inference(orient,[status(thm)],[t59]) ).
cnf(t97,plain,
divide(X1,divide(X1,X2)) = X2,
inference(cp,[status(thm)],[t96,t5]) ).
cnf(t104,plain,
divide(X1,divide(X1,X2)) = X2,
inference(orient,[status(thm)],[t97]) ).
cnf(t61,plain,
a = divide(sFlat0,b),
inference(cp,[status(thm)],[t57,t25]) ).
cnf(t70,plain,
divide(sFlat0,b) = a,
inference(orient,[status(thm)],[t61]) ).
cnf(t71,plain,
inverse(b) = divide(a,sFlat0),
inference(cp,[status(thm)],[t48,t70]) ).
cnf(t78,plain,
divide(a,sFlat0) = inverse(b),
inference(orient,[status(thm)],[t71]) ).
cnf(t109,plain,
sFlat0 = divide(a,inverse(b)),
inference(cp,[status(thm)],[t104,t78]) ).
cnf(t136,plain,
sFlat0 = multiply(a,b),
inference(step,[status(thm)],[t109,t26]) ).
cnf(t137,plain,
sFlat0 = sFlat1,
inference(step,[status(thm)],[t136,t24]) ).
cnf(t119,plain,
sFlat1 = sFlat0,
inference(orient,[status(thm)],[t137]) ).
cnf(t138,plain,
multiply(a,b) = sFlat0,
inference(step,[status(thm)],[t24,t119]) ).
cnf(t120,plain,
multiply(a,b) = sFlat0,
inference(orient,[status(thm)],[t138]) ).
cnf(goal_0,negated_conjecture,
multiply(b,a) != multiply(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
sFlat0 != multiply(a,b),
inference(rw,[status(thm)],[goal_0,t25]) ).
cnf(g0_1,plain,
sFlat0 != sFlat0,
inference(rw,[status(thm)],[g0_0,t120]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP532-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/10.39 % Computer : n008.cluster.edu
% 0.09/10.39 % Model : x86_64 x86_64
% 0.09/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.39 % Memory : 8046.5625MB
% 0.09/10.39 % OS : Linux 6.8.0-71-generic
% 0.09/10.39 % CPULimit : 300
% 0.09/10.39 % WCLimit : 300
% 0.09/10.39 % DateTime : Wed Sep 23 15:00:55 UTC 2026
% 0.09/10.39 % CPUTime :
% 0.09/10.39 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 6.71/11.43 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.71/11.43 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------