%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN918+1 : TPTP v9.3.1. Released v3.1.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 : n012.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:11 AM UTC 2026
% Result : Theorem 0.03s 0.94s
% Output : Proof 0.03s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
( ( ( ! [Z] :
( f(Z)
=> h(Z) )
| ! [W] :
( f(W)
=> g(W) ) )
& ! [X] :
( ( ( g(X)
& f(X) )
=> h(X) )
=> ? [Y] :
( ~ g(Y)
& f(Y) ) ) )
=> ( ! [R] :
( ( h(R)
& f(R) )
=> g(R) )
=> ? [V] :
( ~ h(V)
& g(V)
& f(V) ) ) ),
file('theBenchmark.p',prove_this) ).
fof(f_1_1,negated_conjecture,
( ~ ? [V] :
( ~ h(V)
& g(V)
& f(V) )
& ! [R] :
( ( h(R)
& f(R) )
=> g(R) )
& ( ! [Z] :
( f(Z)
=> h(Z) )
| ! [W] :
( f(W)
=> g(W) ) )
& ! [X] :
( ( ( g(X)
& f(X) )
=> h(X) )
=> ? [Y] :
( ~ g(Y)
& f(Y) ) ) ),
inference(negate,[status(cth)],[prove_this]) ).
fof(f_1_2,negated_conjecture,
( ! [V] :
( h(V)
| ~ g(V)
| ~ f(V) )
& ! [R] :
( g(R)
| ~ h(R)
| ~ f(R) )
& ( ! [Z] :
( h(Z)
| ~ f(Z) )
| ! [W] :
( g(W)
| ~ f(W) ) )
& ! [X] :
( ? [Y] :
( ~ g(Y)
& f(Y) )
| ( ~ h(X)
& g(X)
& f(X) ) ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
( ! [U_5] :
( h(U_5)
| ~ g(U_5)
| ~ f(U_5) )
& ! [U_4] :
( g(U_4)
| ~ h(U_4)
| ~ f(U_4) )
& ( ! [U_3] :
( h(U_3)
| ~ f(U_3) )
| ! [U_2] :
( g(U_2)
| ~ f(U_2) ) )
& ! [U_1] :
( ? [U_0] :
( ~ g(U_0)
& f(U_0) )
| ( ~ h(U_1)
& g(U_1)
& f(U_1) ) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ! [U_5] :
( h(U_5)
| ~ g(U_5)
| ~ f(U_5) )
& ! [U_4] :
( g(U_4)
| ~ h(U_4)
| ~ f(U_4) )
& ( ! [U_3] :
( h(U_3)
| ~ f(U_3) )
| ! [U_2] :
( g(U_2)
| ~ f(U_2) ) )
& ( ( ! [U_7] : ~ h(U_7)
& ! [U_9] : g(U_9)
& ! [U_8] : f(U_8) )
| ? [U_0] :
( ~ g(U_0)
& f(U_0) ) ) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ! [U_5] :
( h(U_5)
| ~ g(U_5)
| ~ f(U_5) )
& ! [U_4] :
( g(U_4)
| ~ h(U_4)
| ~ f(U_4) )
& ( ! [U_3] :
( h(U_3)
| ~ f(U_3) )
| ! [U_2] :
( g(U_2)
| ~ f(U_2) ) )
& ( ( ! [U_7] : ~ h(U_7)
& ! [U_9] : g(U_9)
& ! [U_8] : f(U_8) )
| ( ~ g(sK1)
& f(sK1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1)],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ! [U_8,U_7,U_9] :
( ~ h(U_7)
| ~ sP1(U_8,U_7,U_9) )
& ! [U_8,U_7,U_9] :
( g(U_9)
| ~ sP1(U_8,U_7,U_9) )
& ! [U_8,U_7,U_9] :
( f(U_8)
| ~ sP1(U_8,U_7,U_9) )
& ( ~ g(sK1)
| ~ sP0 )
& ( f(sK1)
| ~ sP0 )
& ! [U_5] :
( h(U_5)
| ~ g(U_5)
| ~ f(U_5) )
& ! [U_4] :
( g(U_4)
| ~ h(U_4)
| ~ f(U_4) )
& ! [U_2,U_3] :
( h(U_3)
| ~ f(U_3)
| g(U_2)
| ~ f(U_2) )
& ! [U_8,U_7,U_9] :
( sP1(U_8,U_7,U_9)
| sP0 ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1])],[f_1_5]) ).
cnf(f_1_7,negated_conjecture,
( sP1(U_8,U_7,U_9)
| sP0 ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_8,negated_conjecture,
( h(U_3)
| ~ f(U_3)
| g(U_2)
| ~ f(U_2) ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_9,negated_conjecture,
( g(U_4)
| ~ h(U_4)
| ~ f(U_4) ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_10,negated_conjecture,
( h(U_5)
| ~ g(U_5)
| ~ f(U_5) ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_11,negated_conjecture,
( f(sK1)
| ~ sP0 ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_12,negated_conjecture,
( ~ g(sK1)
| ~ sP0 ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_13,negated_conjecture,
( f(U_8)
| ~ sP1(U_8,U_7,U_9) ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_14,negated_conjecture,
( g(U_9)
| ~ sP1(U_8,U_7,U_9) ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(f_1_15,negated_conjecture,
( ~ h(U_7)
| ~ sP1(U_8,U_7,U_9) ),
inference(clausify,[status(thm)],[f_1_6]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN918+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.01 This is a FOF_THM_RFO_NEQ problem
% 0.00/0.02 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.92 % Computer : n012.cluster.edu
% 0.03/0.92 % Model : x86_64 x86_64
% 0.03/0.92 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.92 % Memory : 8046.5625MB
% 0.03/0.92 % OS : Linux 6.8.0-71-generic
% 0.03/0.92 % CPULimit : 300
% 0.03/0.92 % WCLimit : 300
% 0.03/0.92 % DateTime : Sun Sep 20 07:26:26 UTC 2026
% 0.03/0.92 % CPUTime :
% 0.03/0.94 % SZS status Theorem for theBenchmark
% 0.03/0.94 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------