%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : GRP012-1 : 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 : n026.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:06 AM UTC 2026
% Result : Unsatisfiable 2.05s 2.36s
% Output : Proof 2.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 8
% Syntax : Number of clauses : 29 ( 24 unt; 0 nHn; 26 RR)
% Number of literals : 44 ( 0 equ; 17 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
product(identity,X,X),
file('GRP003-0.ax',left_identity) ).
cnf(right_identity,axiom,
product(X,identity,X),
file('GRP003-0.ax',right_identity) ).
cnf(right_inverse,axiom,
product(X,inverse(X),identity),
file('GRP003-0.ax',right_inverse) ).
cnf(associativity1,axiom,
( product(X,V,W)
| ~ product(U,Z,W)
| ~ product(Y,Z,V)
| ~ product(X,Y,U) ),
file('GRP003-0.ax',associativity1) ).
cnf(associativity2,axiom,
( product(U,Z,W)
| ~ product(X,V,W)
| ~ product(Y,Z,V)
| ~ product(X,Y,U) ),
file('GRP003-0.ax',associativity2) ).
cnf(a_multiply_b_is_c,hypothesis,
product(a,b,c),
file('theBenchmark.p',a_multiply_b_is_c) ).
cnf(inverse_b_multiply_inverse_a_is_d,hypothesis,
product(inverse(b),inverse(a),d),
file('theBenchmark.p',inverse_b_multiply_inverse_a_is_d) ).
cnf(prove_c_multiply_d_is_identity,negated_conjecture,
~ product(c,d,identity),
file('theBenchmark.p',prove_c_multiply_d_is_identity) ).
cnf(t1,plain,
~ product(c,d,identity),
inference(start,[status(thm),parent(0:0)],[prove_c_multiply_d_is_identity]) ).
cnf(t2,plain,
( ~ product(b,d,inverse(a))
| ~ product(a,inverse(a),identity)
| ~ product(a,b,c)
| product(c,d,identity) ),
inference(extension,[status(thm),parent(t1:1)],[associativity2]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
product(a,b,c),
inference(extension,[status(thm),parent(t2:2)],[a_multiply_b_is_c]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ product(identity,inverse(a),inverse(a))
| ~ product(a,inverse(a),identity)
| ~ product(a,identity,a)
| product(a,inverse(a),identity) ),
inference(extension,[status(thm),parent(t2:3)],[associativity2]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
product(a,identity,a),
inference(extension,[status(thm),parent(t6:2)],[right_identity]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
product(a,inverse(a),identity),
inference(extension,[status(thm),parent(t6:3)],[right_inverse]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t6:3]) ).
cnf(t12,plain,
product(identity,inverse(a),inverse(a)),
inference(extension,[status(thm),parent(t6:4)],[left_identity]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t6:4]) ).
cnf(t14,plain,
( ~ product(inverse(b),inverse(a),d)
| ~ product(identity,inverse(a),inverse(a))
| ~ product(b,inverse(b),identity)
| product(b,d,inverse(a)) ),
inference(extension,[status(thm),parent(t2:4)],[associativity1]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t2:4]) ).
cnf(t16,plain,
product(b,inverse(b),identity),
inference(extension,[status(thm),parent(t14:2)],[right_inverse]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t14:2]) ).
cnf(t18,plain,
product(identity,inverse(a),inverse(a)),
inference(extension,[status(thm),parent(t14:3)],[left_identity]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t14:3]) ).
cnf(t20,plain,
product(inverse(b),inverse(a),d),
inference(extension,[status(thm),parent(t14:4)],[inverse_b_multiply_inverse_a_is_d]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t14:4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP012-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_SEQ_HRN 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.08/0.37 % Computer : n026.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Sat Sep 19 08:33:21 UTC 2026
% 0.08/0.37 % CPUTime :
% 2.05/2.36 % SZS status Unsatisfiable for theBenchmark
% 2.05/2.36 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------