%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN063+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 : n012.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:22 AM UTC 2026
% Result : Theorem 0.03s 11.16s
% Output : Proof 0.03s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(pel33,conjecture,
( ! [X] :
( ( ( big_p(X)
=> big_p(b) )
& big_p(a) )
=> big_p(c) )
<=> ! [X1] :
( ( big_p(c)
| ~ big_p(b)
| ~ big_p(a) )
& ( big_p(c)
| big_p(X1)
| ~ big_p(a) ) ) ),
file('theBenchmark.p',pel33) ).
fof(f_1_1,negated_conjecture,
~ ( ! [X] :
( ( ( big_p(X)
=> big_p(b) )
& big_p(a) )
=> big_p(c) )
<=> ! [X1] :
( ( big_p(c)
| ~ big_p(b)
| ~ big_p(a) )
& ( big_p(c)
| big_p(X1)
| ~ big_p(a) ) ) ),
inference(negate,[status(cth)],[pel33]) ).
fof(f_1_2,negated_conjecture,
( ( ? [X] :
( ~ big_p(c)
& ( big_p(b)
| ~ big_p(X) )
& big_p(a) )
& ! [X1] :
( ( big_p(c)
| ~ big_p(b)
| ~ big_p(a) )
& ( big_p(c)
| big_p(X1)
| ~ big_p(a) ) ) )
| ( ? [X1] :
( ( ~ big_p(c)
& big_p(b)
& big_p(a) )
| ( ~ big_p(c)
& ~ big_p(X1)
& big_p(a) ) )
& ! [X] :
( big_p(c)
| ( ~ big_p(b)
& big_p(X) )
| ~ big_p(a) ) ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
( ( ? [U_3] :
( ~ big_p(c)
& ( big_p(b)
| ~ big_p(U_3) )
& big_p(a) )
& ! [U_2] :
( ( big_p(c)
| ~ big_p(b)
| ~ big_p(a) )
& ( big_p(c)
| big_p(U_2)
| ~ big_p(a) ) ) )
| ( ? [U_1] :
( ( ~ big_p(c)
& big_p(b)
& big_p(a) )
| ( ~ big_p(c)
& ~ big_p(U_1)
& big_p(a) ) )
& ! [U_0] :
( big_p(c)
| ( ~ big_p(b)
& big_p(U_0) )
| ~ big_p(a) ) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ( ( ? [U_3] : ~ big_p(U_3)
| big_p(b) )
& big_p(a)
& ~ big_p(c)
& ( ! [U_2] : big_p(U_2)
| big_p(c)
| ~ big_p(a) )
& ( big_p(c)
| ~ big_p(b)
| ~ big_p(a) ) )
| ( ( ( ? [U_1] : ~ big_p(U_1)
& ~ big_p(c)
& big_p(a) )
| ( ~ big_p(c)
& big_p(b)
& big_p(a) ) )
& ( ( ! [U_0] : big_p(U_0)
& ~ big_p(b) )
| ~ big_p(a)
| big_p(c) ) ) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ( ( ? [U_3] : ~ big_p(U_3)
| big_p(b) )
& big_p(a)
& ~ big_p(c)
& ( ! [U_2] : big_p(U_2)
| big_p(c)
| ~ big_p(a) )
& ( big_p(c)
| ~ big_p(b)
| ~ big_p(a) ) )
| ( ( ( ~ big_p(sK1)
& ~ big_p(c)
& big_p(a) )
| ( ~ big_p(c)
& big_p(b)
& big_p(a) ) )
& ( ( ! [U_0] : big_p(U_0)
& ~ big_p(b) )
| ~ big_p(a)
| big_p(c) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_1,sK1)],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ( ( ~ big_p(sK2)
| big_p(b) )
& big_p(a)
& ~ big_p(c)
& ( ! [U_2] : big_p(U_2)
| big_p(c)
| ~ big_p(a) )
& ( big_p(c)
| ~ big_p(b)
| ~ big_p(a) ) )
| ( ( ( ~ big_p(sK1)
& ~ big_p(c)
& big_p(a) )
| ( ~ big_p(c)
& big_p(b)
& big_p(a) ) )
& ( ( ! [U_0] : big_p(U_0)
& ~ big_p(b) )
| ~ big_p(a)
| big_p(c) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_3,sK2)],[f_1_5]) ).
fof(f_1_7,negated_conjecture,
( ! [U_2] :
( ~ big_p(sK2)
| big_p(b)
| ~ sP4(U_2) )
& ! [U_2] :
( big_p(a)
| ~ sP4(U_2) )
& ! [U_2] :
( ~ big_p(c)
| ~ sP4(U_2) )
& ! [U_2] :
( big_p(U_2)
| big_p(c)
| ~ big_p(a)
| ~ sP4(U_2) )
& ! [U_2] :
( big_p(c)
| ~ big_p(b)
| ~ big_p(a)
| ~ sP4(U_2) )
& ( ~ big_p(sK1)
| ~ sP2 )
& ( ~ big_p(c)
| ~ sP2 )
& ( big_p(a)
| ~ sP2 )
& ( ~ big_p(c)
| ~ sP1 )
& ( big_p(b)
| ~ sP1 )
& ( big_p(a)
| ~ sP1 )
& ! [U_0] :
( big_p(U_0)
| ~ sP0(U_0) )
& ! [U_0] :
( ~ big_p(b)
| ~ sP0(U_0) )
& ! [U_0] :
( sP2
| sP1
| ~ sP3(U_0) )
& ! [U_0] :
( sP0(U_0)
| ~ big_p(a)
| big_p(c)
| ~ sP3(U_0) )
& ! [U_0,U_2] :
( sP4(U_2)
| sP3(U_0) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1,sP2,sP3,sP4])],[f_1_6]) ).
cnf(f_1_8,negated_conjecture,
( sP4(U_2)
| sP3(U_0) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_9,negated_conjecture,
( sP0(U_0)
| ~ big_p(a)
| big_p(c)
| ~ sP3(U_0) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_10,negated_conjecture,
( sP2
| sP1
| ~ sP3(U_0) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_11,negated_conjecture,
( ~ big_p(b)
| ~ sP0(U_0) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_12,negated_conjecture,
( big_p(U_0)
| ~ sP0(U_0) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_13,negated_conjecture,
( big_p(a)
| ~ sP1 ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_14,negated_conjecture,
( big_p(b)
| ~ sP1 ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_15,negated_conjecture,
( ~ big_p(c)
| ~ sP1 ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_16,negated_conjecture,
( big_p(a)
| ~ sP2 ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_17,negated_conjecture,
( ~ big_p(c)
| ~ sP2 ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_18,negated_conjecture,
( ~ big_p(sK1)
| ~ sP2 ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_19,negated_conjecture,
( big_p(c)
| ~ big_p(b)
| ~ big_p(a)
| ~ sP4(U_2) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_20,negated_conjecture,
( big_p(U_2)
| big_p(c)
| ~ big_p(a)
| ~ sP4(U_2) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_21,negated_conjecture,
( ~ big_p(c)
| ~ sP4(U_2) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_22,negated_conjecture,
( big_p(a)
| ~ sP4(U_2) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(f_1_23,negated_conjecture,
( ~ big_p(sK2)
| big_p(b)
| ~ sP4(U_2) ),
inference(clausify,[status(thm)],[f_1_7]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN063+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.01 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.02 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/11.15 % Computer : n012.cluster.edu
% 0.03/11.15 % Model : x86_64 x86_64
% 0.03/11.15 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/11.15 % Memory : 8046.5625MB
% 0.03/11.15 % OS : Linux 6.8.0-71-generic
% 0.03/11.15 % CPULimit : 300
% 0.03/11.15 % WCLimit : 300
% 0.03/11.15 % DateTime : Sun Sep 20 06:23:20 UTC 2026
% 0.03/11.15 % CPUTime :
% 0.03/11.16 % SZS status Theorem for theBenchmark
% 0.03/11.16 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------