%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN061+1 : TPTP v9.3.1. Released v2.0.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 : n002.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:21 AM UTC 2026
% Result : Theorem 0.13s 0.38s
% Output : Proof 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(pel31_1,axiom,
~ ? [X] :
( ( big_h(X)
| big_g(X) )
& big_f(X) ),
file('theBenchmark.p',pel31_1) ).
fof(pel31_2,axiom,
? [X] :
( big_f(X)
& big_i(X) ),
file('theBenchmark.p',pel31_2) ).
fof(pel31_3,axiom,
! [X] :
( ~ big_h(X)
=> big_j(X) ),
file('theBenchmark.p',pel31_3) ).
fof(pel31,conjecture,
? [X] :
( big_j(X)
& big_i(X) ),
file('theBenchmark.p',pel31) ).
fof(f_1_1,plain,
! [X] :
( ( ~ big_h(X)
& ~ big_g(X) )
| ~ big_f(X) ),
inference(fof_nnf,[status(thm)],[pel31_1]) ).
fof(f_1_2,plain,
! [U_0] :
( ( ~ big_h(U_0)
& ~ big_g(U_0) )
| ~ big_f(U_0) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
cnf(f_1_3,plain,
( ~ big_g(U_0)
| ~ big_f(U_0) ),
inference(clausify,[status(thm)],[f_1_2]) ).
cnf(f_1_4,plain,
( ~ big_h(U_0)
| ~ big_f(U_0) ),
inference(clausify,[status(thm)],[f_1_2]) ).
fof(f_2_1,plain,
? [X] :
( big_f(X)
& big_i(X) ),
inference(fof_nnf,[status(thm)],[pel31_2]) ).
fof(f_2_2,plain,
? [U_1] :
( big_f(U_1)
& big_i(U_1) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
( big_f(sK1)
& big_i(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_1,sK1)],[f_2_2]) ).
cnf(f_2_4,plain,
big_i(sK1),
inference(clausify,[status(thm)],[f_2_3]) ).
cnf(f_2_5,plain,
big_f(sK1),
inference(clausify,[status(thm)],[f_2_3]) ).
fof(f_3_1,plain,
! [X] :
( big_j(X)
| big_h(X) ),
inference(fof_nnf,[status(thm)],[pel31_3]) ).
fof(f_3_2,plain,
! [U_2] :
( big_j(U_2)
| big_h(U_2) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
cnf(f_3_3,plain,
( big_j(U_2)
| big_h(U_2) ),
inference(clausify,[status(thm)],[f_3_2]) ).
fof(f_4_1,negated_conjecture,
~ ? [X] :
( big_j(X)
& big_i(X) ),
inference(negate,[status(cth)],[pel31]) ).
fof(f_4_2,negated_conjecture,
! [X] :
( ~ big_j(X)
| ~ big_i(X) ),
inference(fof_nnf,[status(thm)],[f_4_1]) ).
fof(f_4_3,negated_conjecture,
! [U_3] :
( ~ big_j(U_3)
| ~ big_i(U_3) ),
inference(variable_rename,[status(thm)],[f_4_2]) ).
fof(f_4_4,negated_conjecture,
! [U_3] :
( ~ big_j(U_3)
| ~ big_i(U_3) ),
inference(definitional_conversion,[status(esa)],[f_4_3]) ).
cnf(f_4_5,negated_conjecture,
( ~ big_j(U_3)
| ~ big_i(U_3) ),
inference(clausify,[status(thm)],[f_4_4]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN061+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/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35 % Computer : n002.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Sun Sep 20 06:26:17 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.13/0.38 % SZS status Theorem for theBenchmark
% 0.13/0.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------