%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP496-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n011.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:11 PM UTC 2026
% Result : Unsatisfiable 0.34s 20.89s
% Output : CNFRefutation 0.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 5 RR)
% Number of literals : 25 ( 24 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t2,axiom,
double_divide(double_divide(X1,X2),identity) = multiply(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t0,axiom,
double_divide(X1,identity) = inverse(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t8,plain,
double_divide(X1,identity) = inverse(X1),
inference(orient,[status(thm)],[t0]) ).
cnf(t114,plain,
inverse(double_divide(X1,X2)) = multiply(X2,X1),
inference(step,[status(thm)],[t2,t8]) ).
cnf(t11,plain,
inverse(double_divide(X1,X2)) = multiply(X2,X1),
inference(orient,[status(thm)],[t114]) ).
cnf(t1,axiom,
double_divide(X1,inverse(X1)) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t10,plain,
double_divide(X1,inverse(X1)) = identity,
inference(orient,[status(thm)],[t1]) ).
cnf(t13,plain,
multiply(inverse(X1),X1) = inverse(identity),
inference(cp,[status(thm)],[t11,t10]) ).
cnf(t19,plain,
multiply(inverse(X1),X1) = inverse(identity),
inference(orient,[status(thm)],[t13]) ).
cnf(t3,axiom,
double_divide(double_divide(identity,double_divide(X1,double_divide(X2,identity))),double_divide(double_divide(X2,double_divide(X3,X1)),identity)) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t4,plain,
double_divide(double_divide(identity,double_divide(X1,double_divide(X2,identity))),double_divide(double_divide(X2,double_divide(X3,X1)),identity)) = X3,
inference(orient,[status(thm)],[t3]) ).
cnf(t112,plain,
double_divide(double_divide(identity,double_divide(X1,inverse(X2))),double_divide(double_divide(X2,double_divide(X3,X1)),identity)) = X3,
inference(step,[status(thm)],[t4,t8]) ).
cnf(t113,plain,
double_divide(double_divide(identity,double_divide(X1,inverse(X2))),inverse(double_divide(X2,double_divide(X3,X1)))) = X3,
inference(step,[status(thm)],[t112,t8]) ).
cnf(t9,plain,
double_divide(double_divide(identity,double_divide(X1,inverse(X2))),inverse(double_divide(X2,double_divide(X3,X1)))) = X3,
inference(rw,[status(thm)],[t113]) ).
cnf(t115,plain,
double_divide(double_divide(identity,double_divide(X1,inverse(X2))),multiply(double_divide(X3,X1),X2)) = X3,
inference(step,[status(thm)],[t9,t11]) ).
cnf(t70,plain,
double_divide(double_divide(identity,double_divide(X1,inverse(X2))),multiply(double_divide(X3,X1),X2)) = X3,
inference(orient,[status(thm)],[t115]) ).
cnf(t14,plain,
identity = double_divide(double_divide(X1,X2),multiply(X2,X1)),
inference(cp,[status(thm)],[t10,t11]) ).
cnf(t35,plain,
double_divide(double_divide(X1,X2),multiply(X2,X1)) = identity,
inference(orient,[status(thm)],[t14]) ).
cnf(t71,plain,
inverse(identity) = identity,
inference(cp,[status(thm)],[t70,t35]) ).
cnf(t88,plain,
inverse(identity) = identity,
inference(orient,[status(thm)],[t71]) ).
cnf(t116,plain,
multiply(inverse(X1),X1) = identity,
inference(step,[status(thm)],[t19,t88]) ).
cnf(t89,plain,
multiply(inverse(X1),X1) = identity,
inference(orient,[status(thm)],[t116]) ).
cnf(goal_0,negated_conjecture,
multiply(inverse(a1),a1) != identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
identity != identity,
inference(rw,[status(thm)],[goal_0,t89]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP496-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/20.44 % CPULimit : 300
% 0.08/20.44 % WCLimit : 300
% 0.08/20.44 % DateTime : Wed Sep 23 14:54:57 UTC 2026
% 0.08/20.44 % CPUTime :
% 0.08/20.44 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.34/20.89 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.34/20.89 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------