%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN406+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 : 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:10:17 AM UTC 2026
% Result : Theorem 0.13s 0.37s
% Output : Proof 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(kalish240,conjecture,
( ( ? [Y] :
( h(Y)
& f(Y) )
& ! [X] :
( f(X)
=> g(X) ) )
=> ? [Z] :
( h(Z)
& g(Z) ) ),
file('theBenchmark.p',kalish240) ).
fof(f_1_1,negated_conjecture,
( ~ ? [Z] :
( h(Z)
& g(Z) )
& ? [Y] :
( h(Y)
& f(Y) )
& ! [X] :
( f(X)
=> g(X) ) ),
inference(negate,[status(cth)],[kalish240]) ).
fof(f_1_2,negated_conjecture,
( ! [Z] :
( ~ h(Z)
| ~ g(Z) )
& ? [Y] :
( h(Y)
& f(Y) )
& ! [X] :
( g(X)
| ~ f(X) ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
( ! [U_2] :
( ~ h(U_2)
| ~ g(U_2) )
& ? [U_1] :
( h(U_1)
& f(U_1) )
& ! [U_0] :
( g(U_0)
| ~ f(U_0) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ! [U_2] :
( ~ h(U_2)
| ~ g(U_2) )
& h(sK1)
& f(sK1)
& ! [U_0] :
( g(U_0)
| ~ f(U_0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_1,sK1)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ! [U_2] :
( ~ h(U_2)
| ~ g(U_2) )
& h(sK1)
& f(sK1)
& ! [U_0] :
( g(U_0)
| ~ f(U_0) ) ),
inference(definitional_conversion,[status(esa)],[f_1_4]) ).
cnf(f_1_6,negated_conjecture,
( g(U_0)
| ~ f(U_0) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_7,negated_conjecture,
f(sK1),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_8,negated_conjecture,
h(sK1),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(f_1_9,negated_conjecture,
( ~ h(U_2)
| ~ g(U_2) ),
inference(clausify,[status(thm)],[f_1_5]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN406+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/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n009.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sun Sep 20 06:30:43 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------