%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : GRP023-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n004.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 : Thu Sep 24 08:41:08 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.40s
% Output : Proof 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 11 unt; 0 nHn; 14 RR)
% Number of literals : 23 ( 18 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
multiply(identity,X) = X,
file('GRP004-0.ax',left_identity) ).
cnf(right_inverse,axiom,
multiply(X,inverse(X)) = identity,
file('theBenchmark.p',right_inverse) ).
cnf(prove_inverse_of_id_is_id,negated_conjecture,
inverse(identity) != identity,
file('theBenchmark.p',prove_inverse_of_id_is_id) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(t1,plain,
inverse(identity) != identity,
inference(start,[status(thm),parent(0:0)],[prove_inverse_of_id_is_id]) ).
cnf(t2,plain,
( identity != inverse(identity)
| inverse(identity) = identity ),
inference(extension,[status(thm),parent(t1:1)],[equality_2]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( multiply(identity,inverse(identity)) != inverse(identity)
| identity != multiply(identity,inverse(identity))
| identity = inverse(identity) ),
inference(extension,[status(thm),parent(t2:2)],[equality_3]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( multiply(identity,inverse(identity)) != identity
| identity = multiply(identity,inverse(identity)) ),
inference(extension,[status(thm),parent(t4:2)],[equality_2]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
multiply(identity,inverse(identity)) = identity,
inference(extension,[status(thm),parent(t6:2)],[right_inverse]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
multiply(identity,inverse(identity)) = inverse(identity),
inference(extension,[status(thm),parent(t4:3)],[left_identity]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t4:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP023-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_PEQ_UEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37 % Computer : n004.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sat Sep 19 08:33:37 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.40 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.40 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------