%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN932+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 : n009.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 : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
( ? [X] : c
<=> c ),
file('theBenchmark.p',prove_this) ).
fof(f_1_1,negated_conjecture,
~ ( ? [X] : c
<=> c ),
inference(negate,[status(cth)],[prove_this]) ).
fof(f_1_2,negated_conjecture,
( ( ! [X] : ~ c
& c )
| ( ~ c
& ? [X] : c ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
( ( ! [U_1] : ~ c
& c )
| ( ~ c
& ? [U_0] : c ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ( ~ c
& c )
| ( ~ c
& c ) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ( ~ c
| ~ sP1 )
& ( c
| ~ sP1 )
& ( ~ c
| ~ sP0 )
& ( c
| ~ sP0 )
& ( sP1
| sP0 ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1])],[f_1_4]) ).
cnf(f_1_6,negated_conjecture,
( sP1
| sP0 ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_7,negated_conjecture,
( c
| ~ sP0 ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_8,negated_conjecture,
( ~ c
| ~ sP0 ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_9,negated_conjecture,
( c
| ~ sP1 ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_10,negated_conjecture,
( ~ c
| ~ sP1 ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN932+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03 This is a FOF_THM_PRP 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 : n009.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:28:57 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
%------------------------------------------------------------------------------