%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP461-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 : n003.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:55 PM UTC 2026
% Result : Unsatisfiable 5.17s 6.07s
% Output : CNFRefutation 5.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 4 RR)
% Number of literals : 18 ( 17 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t1,axiom,
divide(X1,divide(divide(divide(identity,X2),X3),divide(divide(divide(X1,X1),X1),X3))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t0,axiom,
divide(X1,X1) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(t4,plain,
divide(X1,X1) = identity,
inference(orient,[status(thm)],[t0]) ).
cnf(t43,plain,
divide(X1,divide(divide(divide(identity,X2),X3),divide(divide(identity,X1),X3))) = X2,
inference(step,[status(thm)],[t1,t4]) ).
cnf(t7,plain,
divide(X1,divide(divide(divide(identity,X2),X3),divide(divide(identity,X1),X3))) = X2,
inference(orient,[status(thm)],[t43]) ).
cnf(t8,plain,
X1 = divide(X1,identity),
inference(cp,[status(thm)],[t7,t4]) ).
cnf(t21,plain,
divide(X1,identity) = X1,
inference(orient,[status(thm)],[t8]) ).
cnf(t22,plain,
X1 = divide(X2,divide(divide(identity,X1),divide(divide(identity,X2),identity))),
inference(cp,[status(thm)],[t7,t21]) ).
cnf(t44,plain,
X1 = divide(X2,divide(divide(identity,X1),divide(identity,X2))),
inference(step,[status(thm)],[t22,t21]) ).
cnf(t23,plain,
divide(X1,divide(divide(identity,X2),divide(identity,X1))) = X2,
inference(orient,[status(thm)],[t44]) ).
cnf(t25,plain,
X1 = divide(identity,divide(divide(identity,X1),identity)),
inference(cp,[status(thm)],[t23,t4]) ).
cnf(t45,plain,
X1 = divide(identity,divide(identity,X1)),
inference(step,[status(thm)],[t25,t21]) ).
cnf(t38,plain,
divide(identity,divide(identity,X1)) = X1,
inference(orient,[status(thm)],[t45]) ).
cnf(u0,negated_conjecture,
multiply(identity,a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(d0,axiom,
multiply(A,B) = divide(A,divide(identity,B)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
cnf(goal_0,negated_conjecture,
divide(identity,divide(identity,a2)) != a2,
inference(definition_unfolding,[status(thm)],[u0,d0]) ).
cnf(g0_0,plain,
a2 != a2,
inference(rw,[status(thm)],[goal_0,t38]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP461-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/5.37 % Computer : n003.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Wed Sep 23 14:50:39 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.17/6.07 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.17/6.07 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------