%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GRP022-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n006.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:24:57 PM UTC 2026
% Result : Unsatisfiable 0.15s 1.92s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 3 RR)
% Number of literals : 17 ( 16 equ; 2 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(t4,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t7,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(orient,[status(thm)],[t4]) ).
cnf(t2,axiom,
multiply(X1,inverse(X1)) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t8,plain,
multiply(X1,inverse(X1)) = identity,
inference(orient,[status(thm)],[t2]) ).
cnf(t11,plain,
multiply(X1,multiply(inverse(X1),X2)) = multiply(identity,X2),
inference(cp,[status(thm)],[t7,t8]) ).
cnf(t1,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t6,plain,
multiply(identity,X1) = X1,
inference(orient,[status(thm)],[t1]) ).
cnf(t22,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(step,[status(thm)],[t11,t6]) ).
cnf(t16,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(orient,[status(thm)],[t22]) ).
cnf(t18,plain,
inverse(inverse(X1)) = multiply(X1,identity),
inference(cp,[status(thm)],[t16,t8]) ).
cnf(t0,axiom,
multiply(X1,identity) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(t5,plain,
multiply(X1,identity) = X1,
inference(orient,[status(thm)],[t0]) ).
cnf(t23,plain,
inverse(inverse(X1)) = X1,
inference(step,[status(thm)],[t18,t5]) ).
cnf(t20,plain,
inverse(inverse(X1)) = X1,
inference(orient,[status(thm)],[t23]) ).
cnf(goal_0,negated_conjecture,
inverse(inverse(a)) != a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
cnf(g0_0,plain,
a != a,
inference(rw,[status(thm)],[goal_0,t20]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP022-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/1.21 % Computer : n006.cluster.edu
% 0.11/1.21 % Model : x86_64 x86_64
% 0.11/1.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/1.21 % Memory : 8046.5625MB
% 0.11/1.21 % OS : Linux 6.8.0-71-generic
% 0.11/1.21 % CPULimit : 300
% 0.11/1.21 % WCLimit : 300
% 0.11/1.21 % DateTime : Wed Sep 23 13:15:28 UTC 2026
% 0.11/1.21 % CPUTime :
% 0.11/1.21 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.15/1.92 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/1.92 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------