%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN315-1 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n020.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 09:10:00 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.38s
% Output : Proof 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 15 ( 6 unt; 3 nHn; 10 RR)
% Number of literals : 24 ( 0 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 9 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause1,negated_conjecture,
( p(a)
| ~ f(X) ),
file('theBenchmark.p',clause1) ).
cnf(clause2,negated_conjecture,
( f(X)
| ~ p(a) ),
file('theBenchmark.p',clause2) ).
cnf(clause3,negated_conjecture,
( ~ p(a)
| ~ f(y(X)) ),
file('theBenchmark.p',clause3) ).
cnf(clause4,negated_conjecture,
( f(y(X))
| p(a) ),
file('theBenchmark.p',clause4) ).
cnf(t1,plain,
( ~ p(a)
| ~ f(y(U_21)) ),
inference(start,[status(thm),parent(0:0)],[clause3]) ).
cnf(t2,plain,
( p(a)
| f(y(U_21)) ),
inference(extension,[status(thm),parent(t1:1)],[clause4]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( f(y(U_21))
| ~ p(a) ),
inference(extension,[status(thm),parent(t2:2)],[clause2]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
$false,
inference(reduction,[status(thm),parent(t4:2)],[t4:2,t1:1]) ).
cnf(t7,plain,
( f(y(U_23))
| p(a) ),
inference(extension,[status(thm),parent(t1:2)],[clause4]) ).
cnf(t8,plain,
$false,
inference(connection,[status(thm),parent(t7:1)],[t7:1,t1:2]) ).
cnf(t9,plain,
( p(a)
| ~ f(y(U_23)) ),
inference(extension,[status(thm),parent(t7:2)],[clause1]) ).
cnf(t10,plain,
$false,
inference(connection,[status(thm),parent(t9:1)],[t9:1,t7:2]) ).
cnf(t11,plain,
$false,
inference(reduction,[status(thm),parent(t9:2)],[t9:2,t1:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN315-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04 This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n020.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 20 06:29:32 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------