%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN082+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 : n015.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:26 AM UTC 2026
% Result : Theorem 0.13s 0.38s
% Output : Proof 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(pel60,conjecture,
! [X] :
( big_f(X,f(X))
<=> ? [Y] :
( big_f(X,Y)
& ! [Z] :
( big_f(Z,Y)
=> big_f(Z,f(X)) ) ) ),
file('theBenchmark.p',pel60) ).
fof(f_1_1,negated_conjecture,
~ ! [X] :
( big_f(X,f(X))
<=> ? [Y] :
( big_f(X,Y)
& ! [Z] :
( big_f(Z,Y)
=> big_f(Z,f(X)) ) ) ),
inference(negate,[status(cth)],[pel60]) ).
fof(f_1_2,negated_conjecture,
? [X] :
( ( ~ big_f(X,f(X))
& ? [Y] :
( big_f(X,Y)
& ! [Z] :
( big_f(Z,f(X))
| ~ big_f(Z,Y) ) ) )
| ( ! [Y] :
( ~ big_f(X,Y)
| ? [Z] :
( ~ big_f(Z,f(X))
& big_f(Z,Y) ) )
& big_f(X,f(X)) ) ),
inference(fof_nnf,[status(thm)],[f_1_1]) ).
fof(f_1_3,negated_conjecture,
? [U_4] :
( ( ~ big_f(U_4,f(U_4))
& ? [U_3] :
( big_f(U_4,U_3)
& ! [U_2] :
( big_f(U_2,f(U_4))
| ~ big_f(U_2,U_3) ) ) )
| ( ! [U_1] :
( ~ big_f(U_4,U_1)
| ? [U_0] :
( ~ big_f(U_0,f(U_4))
& big_f(U_0,U_1) ) )
& big_f(U_4,f(U_4)) ) ),
inference(variable_rename,[status(thm)],[f_1_2]) ).
fof(f_1_4,negated_conjecture,
( ? [U_6] :
( ~ big_f(U_6,f(U_6))
& ? [U_3] :
( big_f(U_6,U_3)
& ! [U_2] :
( big_f(U_2,f(U_6))
| ~ big_f(U_2,U_3) ) ) )
| ? [U_5] :
( ! [U_1] :
( ~ big_f(U_5,U_1)
| ? [U_0] :
( ~ big_f(U_0,f(U_5))
& big_f(U_0,U_1) ) )
& big_f(U_5,f(U_5)) ) ),
inference(miniscope,[status(thm)],[f_1_3]) ).
fof(f_1_5,negated_conjecture,
( ? [U_6] :
( ~ big_f(U_6,f(U_6))
& ? [U_3] :
( big_f(U_6,U_3)
& ! [U_2] :
( big_f(U_2,f(U_6))
| ~ big_f(U_2,U_3) ) ) )
| ( ! [U_1] :
( ~ big_f(sK1,U_1)
| ? [U_0] :
( ~ big_f(U_0,f(sK1))
& big_f(U_0,U_1) ) )
& big_f(sK1,f(sK1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_5,sK1)],[f_1_4]) ).
fof(f_1_6,negated_conjecture,
( ? [U_6] :
( ~ big_f(U_6,f(U_6))
& ? [U_3] :
( big_f(U_6,U_3)
& ! [U_2] :
( big_f(U_2,f(U_6))
| ~ big_f(U_2,U_3) ) ) )
| ( ! [U_1] :
( ~ big_f(sK1,U_1)
| ( ~ big_f(sK2(U_1),f(sK1))
& big_f(sK2(U_1),U_1) ) )
& big_f(sK1,f(sK1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_0,sK2(U_1))],[f_1_5]) ).
fof(f_1_7,negated_conjecture,
( ( ~ big_f(sK3,f(sK3))
& ? [U_3] :
( big_f(sK3,U_3)
& ! [U_2] :
( big_f(U_2,f(sK3))
| ~ big_f(U_2,U_3) ) ) )
| ( ! [U_1] :
( ~ big_f(sK1,U_1)
| ( ~ big_f(sK2(U_1),f(sK1))
& big_f(sK2(U_1),U_1) ) )
& big_f(sK1,f(sK1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_6,sK3)],[f_1_6]) ).
fof(f_1_8,negated_conjecture,
( ( ~ big_f(sK3,f(sK3))
& big_f(sK3,sK4)
& ! [U_2] :
( big_f(U_2,f(sK3))
| ~ big_f(U_2,sK4) ) )
| ( ! [U_1] :
( ~ big_f(sK1,U_1)
| ( ~ big_f(sK2(U_1),f(sK1))
& big_f(sK2(U_1),U_1) ) )
& big_f(sK1,f(sK1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_3,sK4)],[f_1_7]) ).
fof(f_1_9,negated_conjecture,
( ! [U_2] :
( ~ big_f(sK3,f(sK3))
| ~ sP2(U_2) )
& ! [U_2] :
( big_f(sK3,sK4)
| ~ sP2(U_2) )
& ! [U_2] :
( big_f(U_2,f(sK3))
| ~ big_f(U_2,sK4)
| ~ sP2(U_2) )
& ! [U_1] :
( ~ big_f(sK2(U_1),f(sK1))
| ~ sP0(U_1) )
& ! [U_1] :
( big_f(sK2(U_1),U_1)
| ~ sP0(U_1) )
& ! [U_1] :
( ~ big_f(sK1,U_1)
| sP0(U_1)
| ~ sP1(U_1) )
& ! [U_1] :
( big_f(sK1,f(sK1))
| ~ sP1(U_1) )
& ! [U_1,U_2] :
( sP2(U_2)
| sP1(U_1) ) ),
inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1,sP2])],[f_1_8]) ).
cnf(f_1_10,negated_conjecture,
( sP2(U_2)
| sP1(U_1) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_11,negated_conjecture,
( big_f(sK1,f(sK1))
| ~ sP1(U_1) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_12,negated_conjecture,
( ~ big_f(sK1,U_1)
| sP0(U_1)
| ~ sP1(U_1) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_13,negated_conjecture,
( big_f(sK2(U_1),U_1)
| ~ sP0(U_1) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_14,negated_conjecture,
( ~ big_f(sK2(U_1),f(sK1))
| ~ sP0(U_1) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_15,negated_conjecture,
( big_f(U_2,f(sK3))
| ~ big_f(U_2,sK4)
| ~ sP2(U_2) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_16,negated_conjecture,
( big_f(sK3,sK4)
| ~ sP2(U_2) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(f_1_17,negated_conjecture,
( ~ big_f(sK3,f(sK3))
| ~ sP2(U_2) ),
inference(clausify,[status(thm)],[f_1_9]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN082+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/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n015.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sun Sep 20 06:27:51 UTC 2026
% 0.09/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
%------------------------------------------------------------------------------