%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN069+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 : n013.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:23 AM UTC 2026
% Result : Theorem 0.10s 0.38s
% Output : Proof 0.10s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(pel45_1,axiom,
! [X] :
( ( ! [Y] :
( ( big_h(X,Y)
& big_g(Y) )
=> big_j(X,Y) )
& big_f(X) )
=> ! [Y1] :
( big_k(Y1)
& big_h(X,Y1)
& big_g(Y1) ) ),
file('theBenchmark.p',pel45_1) ).
fof(pel45_2,axiom,
~ ? [Y] :
( big_k(Y)
& big_l(Y) ),
file('theBenchmark.p',pel45_2) ).
fof(pel45_3,axiom,
? [X] :
( ! [Y1] :
( ( big_h(X,Y1)
& big_g(Y1) )
=> big_j(X,Y1) )
& ! [Y] :
( big_h(X,Y)
=> big_l(Y) )
& big_f(X) ),
file('theBenchmark.p',pel45_3) ).
fof(pel45,conjecture,
? [X] :
( ~ ? [Y] :
( big_h(X,Y)
& big_g(Y) )
& big_f(X) ),
file('theBenchmark.p',pel45) ).
fof(f_1_1,plain,
! [X] :
( ! [Y1] :
( big_k(Y1)
& big_h(X,Y1)
& big_g(Y1) )
| ? [Y] :
( ~ big_j(X,Y)
& big_h(X,Y)
& big_g(Y) )
| ~ big_f(X) ),
inference(fof_nnf,[status(thm)],[pel45_1]) ).
fof(f_1_2,plain,
! [U_2] :
( ! [U_1] :
( big_k(U_1)
& big_h(U_2,U_1)
& big_g(U_1) )
| ? [U_0] :
( ~ big_j(U_2,U_0)
& big_h(U_2,U_0)
& big_g(U_0) )
| ~ big_f(U_2) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
! [U_2] :
( ( ! [U_5] : big_k(U_5)
& ! [U_4] : big_h(U_2,U_4)
& ! [U_3] : big_g(U_3) )
| ? [U_0] :
( ~ big_j(U_2,U_0)
& big_h(U_2,U_0)
& big_g(U_0) )
| ~ big_f(U_2) ),
inference(miniscope,[status(thm)],[f_1_2]) ).
fof(f_1_4,plain,
! [U_2] :
( ( ! [U_5] : big_k(U_5)
& ! [U_4] : big_h(U_2,U_4)
& ! [U_3] : big_g(U_3) )
| ( ~ big_j(U_2,sK1(U_2))
& big_h(U_2,sK1(U_2))
& big_g(sK1(U_2)) )
| ~ big_f(U_2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1(U_2))],[f_1_3]) ).
cnf(f_1_5,plain,
( big_g(sK1(U_2))
| ~ big_f(U_2)
| big_g(U_3) ),
inference(clausify,[status(thm)],[f_1_4]) ).
cnf(f_1_6,plain,
( big_h(U_2,sK1(U_2))
| ~ big_f(U_2)
| big_g(U_3) ),
inference(clausify,[status(thm)],[f_1_4]) ).
cnf(f_1_7,plain,
( ~ big_j(U_2,sK1(U_2))
| ~ big_f(U_2)
| big_g(U_3) ),
inference(clausify,[status(thm)],[f_1_4]) ).
cnf(f_1_8,plain,
( big_g(sK1(U_2))
| ~ big_f(U_2)
| big_h(U_2,U_4) ),
inference(clausify,[status(thm)],[f_1_4]) ).
cnf(f_1_9,plain,
( big_h(U_2,sK1(U_2))
| ~ big_f(U_2)
| big_h(U_2,U_4) ),
inference(clausify,[status(thm)],[f_1_4]) ).
cnf(f_1_10,plain,
( ~ big_j(U_2,sK1(U_2))
| ~ big_f(U_2)
| big_h(U_2,U_4) ),
inference(clausify,[status(thm)],[f_1_4]) ).
cnf(f_1_11,plain,
( big_g(sK1(U_2))
| ~ big_f(U_2)
| big_k(U_5) ),
inference(clausify,[status(thm)],[f_1_4]) ).
cnf(f_1_12,plain,
( big_h(U_2,sK1(U_2))
| ~ big_f(U_2)
| big_k(U_5) ),
inference(clausify,[status(thm)],[f_1_4]) ).
cnf(f_1_13,plain,
( ~ big_j(U_2,sK1(U_2))
| ~ big_f(U_2)
| big_k(U_5) ),
inference(clausify,[status(thm)],[f_1_4]) ).
fof(f_2_1,plain,
! [Y] :
( ~ big_k(Y)
| ~ big_l(Y) ),
inference(fof_nnf,[status(thm)],[pel45_2]) ).
fof(f_2_2,plain,
! [U_6] :
( ~ big_k(U_6)
| ~ big_l(U_6) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
cnf(f_2_3,plain,
( ~ big_k(U_6)
| ~ big_l(U_6) ),
inference(clausify,[status(thm)],[f_2_2]) ).
fof(f_3_1,plain,
? [X] :
( ! [Y1] :
( big_j(X,Y1)
| ~ big_h(X,Y1)
| ~ big_g(Y1) )
& ! [Y] :
( big_l(Y)
| ~ big_h(X,Y) )
& big_f(X) ),
inference(fof_nnf,[status(thm)],[pel45_3]) ).
fof(f_3_2,plain,
? [U_9] :
( ! [U_8] :
( big_j(U_9,U_8)
| ~ big_h(U_9,U_8)
| ~ big_g(U_8) )
& ! [U_7] :
( big_l(U_7)
| ~ big_h(U_9,U_7) )
& big_f(U_9) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
fof(f_3_3,plain,
( ! [U_8] :
( big_j(sK2,U_8)
| ~ big_h(sK2,U_8)
| ~ big_g(U_8) )
& ! [U_7] :
( big_l(U_7)
| ~ big_h(sK2,U_7) )
& big_f(sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_9,sK2)],[f_3_2]) ).
cnf(f_3_4,plain,
big_f(sK2),
inference(clausify,[status(thm)],[f_3_3]) ).
cnf(f_3_5,plain,
( big_l(U_7)
| ~ big_h(sK2,U_7) ),
inference(clausify,[status(thm)],[f_3_3]) ).
cnf(f_3_6,plain,
( big_j(sK2,U_8)
| ~ big_h(sK2,U_8)
| ~ big_g(U_8) ),
inference(clausify,[status(thm)],[f_3_3]) ).
fof(f_4_1,negated_conjecture,
~ ? [X] :
( ~ ? [Y] :
( big_h(X,Y)
& big_g(Y) )
& big_f(X) ),
inference(negate,[status(cth)],[pel45]) ).
fof(f_4_2,negated_conjecture,
! [X] :
( ? [Y] :
( big_h(X,Y)
& big_g(Y) )
| ~ big_f(X) ),
inference(fof_nnf,[status(thm)],[f_4_1]) ).
fof(f_4_3,negated_conjecture,
! [U_11] :
( ? [U_10] :
( big_h(U_11,U_10)
& big_g(U_10) )
| ~ big_f(U_11) ),
inference(variable_rename,[status(thm)],[f_4_2]) ).
fof(f_4_4,negated_conjecture,
! [U_11] :
( ( big_h(U_11,sK3(U_11))
& big_g(sK3(U_11)) )
| ~ big_f(U_11) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_10,sK3(U_11))],[f_4_3]) ).
fof(f_4_5,negated_conjecture,
( ! [U_11] :
( big_h(U_11,sK3(U_11))
| ~ sP0(U_11) )
& ! [U_11] :
( big_g(sK3(U_11))
| ~ sP0(U_11) )
& ! [U_11] :
( sP0(U_11)
| ~ big_f(U_11) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0])],[f_4_4]) ).
cnf(f_4_6,negated_conjecture,
( sP0(U_11)
| ~ big_f(U_11) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_7,negated_conjecture,
( big_g(sK3(U_11))
| ~ sP0(U_11) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_8,negated_conjecture,
( big_h(U_11,sK3(U_11))
| ~ sP0(U_11) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN069+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 This is a FOF_CAX_RFO_NEQ problem
% 0.00/0.03 % 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.36 % Computer : n013.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 06:23:22 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.38 % SZS status Theorem for theBenchmark
% 0.10/0.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------