%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : GRP006-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 0.12s 0.44s
% Output : Proof 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% 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 : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(right_identity,axiom,
product(X,identity,X),
file('theBenchmark.p',right_identity) ).
cnf(right_inverse,axiom,
product(X,inverse(X),identity),
file('theBenchmark.p',right_inverse) ).
cnf(left_inverse,axiom,
product(inverse(X),X,identity),
file('theBenchmark.p',left_inverse) ).
cnf(condition,axiom,
( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) ),
file('theBenchmark.p',condition) ).
cnf(associativity2,axiom,
( product(U,Z,W)
| ~ product(X,V,W)
| ~ product(Y,Z,V)
| ~ product(X,Y,U) ),
file('theBenchmark.p',associativity2) ).
cnf(element_of_set,hypothesis,
an_element(the_element),
file('theBenchmark.p',element_of_set) ).
cnf(prove_b_inverse_is_in_set,negated_conjecture,
~ an_element(inverse(the_element)),
file('theBenchmark.p',prove_b_inverse_is_in_set) ).
cnf(t1,plain,
~ an_element(inverse(the_element)),
inference(start,[status(thm),parent(0:0)],[prove_b_inverse_is_in_set]) ).
cnf(t2,plain,
( ~ an_element(the_element)
| ~ product(identity,inverse(the_element),inverse(the_element))
| ~ an_element(identity)
| an_element(inverse(the_element)) ),
inference(extension,[status(thm),parent(t1:1)],[condition]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ an_element(the_element)
| ~ product(the_element,inverse(the_element),identity)
| ~ an_element(the_element)
| an_element(identity) ),
inference(extension,[status(thm),parent(t2:2)],[condition]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
an_element(the_element),
inference(extension,[status(thm),parent(t4:2)],[element_of_set]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(l3,lemma,
an_element(the_element),
inference(lemma,[status(cth),parent(t4:2),below(t2:2)],[t4:2]) ).
cnf(t8,plain,
product(the_element,inverse(the_element),identity),
inference(extension,[status(thm),parent(t4:3)],[right_inverse]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).
cnf(t10,plain,
an_element(the_element),
inference(lemma_extension,[status(thm),parent(t4:4)],[l3:1]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t4:4]) ).
cnf(t12,plain,
( ~ product(the_element,inverse(the_element),identity)
| ~ product(inverse(the_element),identity,inverse(the_element))
| ~ product(inverse(the_element),the_element,identity)
| product(identity,inverse(the_element),inverse(the_element)) ),
inference(extension,[status(thm),parent(t2:3)],[associativity2]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t2:3]) ).
cnf(t14,plain,
product(inverse(the_element),the_element,identity),
inference(extension,[status(thm),parent(t12:2)],[left_inverse]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
cnf(t16,plain,
product(inverse(the_element),identity,inverse(the_element)),
inference(extension,[status(thm),parent(t12:3)],[right_identity]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t12:3]) ).
cnf(t18,plain,
product(the_element,inverse(the_element),identity),
inference(extension,[status(thm),parent(t12:4)],[right_inverse]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t12:4]) ).
cnf(t20,plain,
an_element(the_element),
inference(extension,[status(thm),parent(t2:4)],[element_of_set]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t2:4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP006-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.00/0.03 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.34 % Computer : n026.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Sat Sep 19 08:34:05 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.12/0.44 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.44 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------