%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN052+1 : TPTP v9.3.1. Released v2.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 : n015.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:09:19 AM UTC 2026
% Result : Theorem 0.14s 0.39s
% Output : Proof 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(pel22,conjecture,
( ! [X] :
( p
<=> big_f(X) )
=> ( p
<=> ! [X1] : big_f(X1) ) ),
file('theBenchmark.p',pel22) ).
fof(f_1_1,negated_conjecture,
( ~ ( p
<=> ! [X1] : big_f(X1) )
& ! [X] :
( p
<=> big_f(X) ) ),
inference(negate,[status(cth)],[pel22]) ).
fof(f_1_2,negated_conjecture,
( ( ( ~ p
& ! [X1] : big_f(X1) )
| ( ? [X1] : ~ big_f(X1)
& p ) )
& ! [X] :
( ( p
| ~ big_f(X) )
& ( big_f(X)
| ~ p ) ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
( ( ( ~ p
& ! [U_2] : big_f(U_2) )
| ( ? [U_1] : ~ big_f(U_1)
& p ) )
& ! [U_0] :
( ( p
| ~ big_f(U_0) )
& ( big_f(U_0)
| ~ p ) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ( ( ~ p
& ! [U_2] : big_f(U_2) )
| ( ? [U_1] : ~ big_f(U_1)
& p ) )
& ( ! [U_4] : ~ big_f(U_4)
| p )
& ( ! [U_3] : big_f(U_3)
| ~ p ) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ( ( ~ p
& ! [U_2] : big_f(U_2) )
| ( ~ big_f(sK1)
& p ) )
& ( ! [U_4] : ~ big_f(U_4)
| p )
& ( ! [U_3] : big_f(U_3)
| ~ p ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_1,sK1)],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ! [U_2] :
( ~ p
| ~ sP1(U_2) )
& ! [U_2] :
( big_f(U_2)
| ~ sP1(U_2) )
& ( ~ big_f(sK1)
| ~ sP0 )
& ( p
| ~ sP0 )
& ! [U_2] :
( sP1(U_2)
| sP0 )
& ! [U_4] :
( ~ big_f(U_4)
| p )
& ! [U_3] :
( big_f(U_3)
| ~ p ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1])],[f_1_5]) ).
cnf(f_1_7,negated_conjecture,
( big_f(U_3)
| ~ p ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_8,negated_conjecture,
( ~ big_f(U_4)
| p ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_9,negated_conjecture,
( sP1(U_2)
| sP0 ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_10,negated_conjecture,
( p
| ~ sP0 ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_11,negated_conjecture,
( ~ big_f(sK1)
| ~ sP0 ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_12,negated_conjecture,
( big_f(U_2)
| ~ sP1(U_2) ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_13,negated_conjecture,
( ~ p
| ~ sP1(U_2) ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN052+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 This is a FOF_THM_RFO_NEQ 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.09/0.37 % Computer : n015.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % 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:26:21 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------