%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SET045-5 : 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 : n008.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:56:04 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.39s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 12 ( 8 unt; 2 nHn; 11 RR)
% Number of literals : 18 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 5 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause_2,axiom,
( ~ element(X,X)
| ~ element(X,f(Y)) ),
file('theBenchmark.p',clause_2) ).
cnf(clause_3,axiom,
( element(X,f(Y))
| element(X,X)
| ~ element(X,Y) ),
file('theBenchmark.p',clause_3) ).
cnf(clause_4,negated_conjecture,
element(X,a),
file('theBenchmark.p',clause_4) ).
cnf(t1,plain,
( ~ element(f(a),f(a))
| ~ element(f(a),f(a)) ),
inference(start,[status(thm),parent(0:0)],[clause_2]) ).
cnf(t2,plain,
( element(f(a),f(a))
| ~ element(f(a),a)
| element(f(a),f(a)) ),
inference(extension,[status(thm),parent(t1:1)],[clause_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
element(f(a),a),
inference(extension,[status(thm),parent(t2:2)],[clause_4]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
$false,
inference(reduction,[status(thm),parent(t2:3)],[t2:3,t1:1]) ).
cnf(l1,lemma,
element(f(a),f(a)),
inference(lemma,[status(cth),parent(t1:1),below(0:0)],[t1:1]) ).
cnf(t7,plain,
element(f(a),f(a)),
inference(lemma_extension,[status(thm),parent(t1:2)],[l1:1]) ).
cnf(t8,plain,
$false,
inference(connection,[status(thm),parent(t7:1)],[t7:1,t1:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET045-5 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_NHN 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.10/0.37 % Computer : n008.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 19 21:33:10 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------