%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN929+1 : TPTP v9.3.1. Released v3.1.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 : n003.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:11:13 AM UTC 2026
% Result : Theorem 0.10s 0.39s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 5 unt; 0 def)
% Number of atoms : 29 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 33 ( 17 ~; 0 |; 13 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 20 ( 1 sgn 8 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
( ~ ? [Y] : p(Y)
=> ! [Y] :
( ? [X] : p(X)
=> p(Y) ) ),
file('theBenchmark.p',prove_this) ).
fof(f_1_1,negated_conjecture,
( ~ ! [Y] :
( ? [X] : p(X)
=> p(Y) )
& ~ ? [Y] : p(Y) ),
inference(negate,[status(cth)],[prove_this]) ).
fof(f_1_2,negated_conjecture,
( ? [Y] :
( ~ p(Y)
& ? [X] : p(X) )
& ! [Y] : ~ p(Y) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
( ? [U_2] :
( ~ p(U_2)
& ? [U_1] : p(U_1) )
& ! [U_0] : ~ p(U_0) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ? [U_2] : ~ p(U_2)
& ? [U_1] : p(U_1)
& ! [U_0] : ~ p(U_0) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ? [U_2] : ~ p(U_2)
& p(sK1)
& ! [U_0] : ~ p(U_0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_1,sK1)],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ~ p(sK2)
& p(sK1)
& ! [U_0] : ~ p(U_0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_2,sK2)],[f_1_5]) ).
fof(f_1_7,negated_conjecture,
( ~ p(sK2)
& p(sK1)
& ! [U_0] : ~ p(U_0) ),
inference(definitional_conversion,[status(esa)],[f_1_6]) ).
cnf(f_1_8,negated_conjecture,
~ p(U_0),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_9,negated_conjecture,
p(sK1),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(t1,plain,
~ p(sK1),
inference(start,[status(thm),parent(0:0)],[f_1_8]) ).
cnf(t2,plain,
p(sK1),
inference(extension,[status(thm),parent(t1:1)],[f_1_9]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN929+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03 This is a FOF_THM_RFO_NEQ 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.10/0.37 % Computer : n003.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 : Sun Sep 20 07:30:29 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.39 % SZS status Theorem for theBenchmark
% 0.10/0.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------