%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN070+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 : n004.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:24 AM UTC 2026
% Result : Theorem 0.14s 5.40s
% Output : Proof 0.14s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(pel46_1,axiom,
! [X,Y] :
( ( ( ( big_h(Y,X)
& big_f(Y) )
=> big_g(Y) )
& big_f(X) )
=> big_g(X) ),
file('theBenchmark.p',pel46_1) ).
fof(pel46_2,axiom,
( ? [X] :
( ~ big_g(X)
& big_f(X) )
=> ? [X1] :
( ! [Y] :
( ( ~ big_g(Y)
& big_f(Y) )
=> big_j(X1,Y) )
& ~ big_g(X1)
& big_f(X1) ) ),
file('theBenchmark.p',pel46_2) ).
fof(pel46_3,axiom,
! [X,Y] :
( ( big_h(X,Y)
& big_f(Y)
& big_f(X) )
=> ~ big_j(Y,X) ),
file('theBenchmark.p',pel46_3) ).
fof(pel46,conjecture,
! [X] :
( big_f(X)
=> big_g(X) ),
file('theBenchmark.p',pel46) ).
fof(f_1_1,plain,
! [X,Y] :
( big_g(X)
| ( ~ big_g(Y)
& big_h(Y,X)
& big_f(Y) )
| ~ big_f(X) ),
inference(fof_nnf,[status(thm)],[pel46_1]) ).
fof(f_1_2,plain,
! [U_1,U_0] :
( big_g(U_1)
| ( ~ big_g(U_0)
& big_h(U_0,U_1)
& big_f(U_0) )
| ~ big_f(U_1) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
! [U_1] :
( ( ! [U_3] : ~ big_g(U_3)
& ! [U_5] : big_h(U_5,U_1)
& ! [U_4] : big_f(U_4) )
| ~ big_f(U_1)
| big_g(U_1) ),
inference(miniscope,[status(thm)],[f_1_2]) ).
cnf(f_1_4,plain,
( big_f(U_4)
| ~ big_f(U_1)
| big_g(U_1) ),
inference(clausify,[status(thm)],[f_1_3]) ).
cnf(f_1_5,plain,
( big_h(U_5,U_1)
| ~ big_f(U_1)
| big_g(U_1) ),
inference(clausify,[status(thm)],[f_1_3]) ).
cnf(f_1_6,plain,
( ~ big_g(U_3)
| ~ big_f(U_1)
| big_g(U_1) ),
inference(clausify,[status(thm)],[f_1_3]) ).
fof(f_2_1,plain,
( ? [X1] :
( ! [Y] :
( big_j(X1,Y)
| big_g(Y)
| ~ big_f(Y) )
& ~ big_g(X1)
& big_f(X1) )
| ! [X] :
( big_g(X)
| ~ big_f(X) ) ),
inference(fof_nnf,[status(thm)],[pel46_2]) ).
fof(f_2_2,plain,
( ? [U_8] :
( ! [U_7] :
( big_j(U_8,U_7)
| big_g(U_7)
| ~ big_f(U_7) )
& ~ big_g(U_8)
& big_f(U_8) )
| ! [U_6] :
( big_g(U_6)
| ~ big_f(U_6) ) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
( ( ! [U_7] :
( big_j(sK1,U_7)
| big_g(U_7)
| ~ big_f(U_7) )
& ~ big_g(sK1)
& big_f(sK1) )
| ! [U_6] :
( big_g(U_6)
| ~ big_f(U_6) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_8,sK1)],[f_2_2]) ).
cnf(f_2_4,plain,
( big_f(sK1)
| big_g(U_6)
| ~ big_f(U_6) ),
inference(clausify,[status(thm)],[f_2_3]) ).
cnf(f_2_5,plain,
( ~ big_g(sK1)
| big_g(U_6)
| ~ big_f(U_6) ),
inference(clausify,[status(thm)],[f_2_3]) ).
cnf(f_2_6,plain,
( big_j(sK1,U_7)
| big_g(U_7)
| ~ big_f(U_7)
| big_g(U_6)
| ~ big_f(U_6) ),
inference(clausify,[status(thm)],[f_2_3]) ).
fof(f_3_1,plain,
! [X,Y] :
( ~ big_j(Y,X)
| ~ big_h(X,Y)
| ~ big_f(Y)
| ~ big_f(X) ),
inference(fof_nnf,[status(thm)],[pel46_3]) ).
fof(f_3_2,plain,
! [U_10,U_9] :
( ~ big_j(U_9,U_10)
| ~ big_h(U_10,U_9)
| ~ big_f(U_9)
| ~ big_f(U_10) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
cnf(f_3_3,plain,
( ~ big_j(U_9,U_10)
| ~ big_h(U_10,U_9)
| ~ big_f(U_9)
| ~ big_f(U_10) ),
inference(clausify,[status(thm)],[f_3_2]) ).
fof(f_4_1,negated_conjecture,
~ ! [X] :
( big_f(X)
=> big_g(X) ),
inference(negate,[status(cth)],[pel46]) ).
fof(f_4_2,negated_conjecture,
? [X] :
( ~ big_g(X)
& big_f(X) ),
inference(fof_nnf,[status(thm)],[f_4_1]) ).
fof(f_4_3,negated_conjecture,
? [U_11] :
( ~ big_g(U_11)
& big_f(U_11) ),
inference(variable_rename,[status(thm)],[f_4_2]) ).
fof(f_4_4,negated_conjecture,
( ~ big_g(sK2)
& big_f(sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_11,sK2)],[f_4_3]) ).
fof(f_4_5,negated_conjecture,
( ~ big_g(sK2)
& big_f(sK2) ),
inference(definitional_conversion,[status(esa)],[f_4_4]) ).
cnf(f_4_6,negated_conjecture,
big_f(sK2),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_7,negated_conjecture,
~ big_g(sK2),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN070+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 This is a FOF_THM_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/5.37 % Computer : n004.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Sun Sep 20 06:24:11 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.14/5.40 % SZS status Theorem for theBenchmark
% 0.14/5.40 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------