%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SYN081+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 : n005.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.12s 0.37s
% Output : Proof 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(pel59_1,axiom,
! [X] :
( big_f(X)
<=> ~ big_f(f(X)) ),
file('theBenchmark.p',pel59_1) ).
fof(pel59,conjecture,
? [X] :
( ~ big_f(f(X))
& big_f(X) ),
file('theBenchmark.p',pel59) ).
fof(f_1_1,plain,
! [X] :
( ( big_f(X)
| big_f(f(X)) )
& ( ~ big_f(f(X))
| ~ big_f(X) ) ),
inference(fof_nnf,[status(thm)],[pel59_1]) ).
fof(f_1_2,plain,
! [U_0] :
( ( big_f(U_0)
| big_f(f(U_0)) )
& ( ~ big_f(f(U_0))
| ~ big_f(U_0) ) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
( ! [U_2] :
( big_f(U_2)
| big_f(f(U_2)) )
& ! [U_1] :
( ~ big_f(f(U_1))
| ~ big_f(U_1) ) ),
inference(miniscope,[status(thm)],[f_1_2]) ).
cnf(f_1_4,plain,
( ~ big_f(f(U_1))
| ~ big_f(U_1) ),
inference(clausify,[status(thm)],[f_1_3]) ).
cnf(f_1_5,plain,
( big_f(U_2)
| big_f(f(U_2)) ),
inference(clausify,[status(thm)],[f_1_3]) ).
fof(f_2_1,negated_conjecture,
~ ? [X] :
( ~ big_f(f(X))
& big_f(X) ),
inference(negate,[status(cth)],[pel59]) ).
fof(f_2_2,negated_conjecture,
! [X] :
( big_f(f(X))
| ~ big_f(X) ),
inference(fof_nnf,[status(thm)],[f_2_1]) ).
fof(f_2_3,negated_conjecture,
! [U_3] :
( big_f(f(U_3))
| ~ big_f(U_3) ),
inference(variable_rename,[status(thm)],[f_2_2]) ).
fof(f_2_4,negated_conjecture,
! [U_3] :
( big_f(f(U_3))
| ~ big_f(U_3) ),
inference(definitional_conversion,[status(esa)],[f_2_3]) ).
cnf(f_2_5,negated_conjecture,
( big_f(f(U_3))
| ~ big_f(U_3) ),
inference(clausify,[status(thm)],[f_2_4]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN081+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.10/0.34 % Computer : n005.cluster.edu
% 0.10/0.34 % Model : x86_64 x86_64
% 0.10/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34 % Memory : 8046.5625MB
% 0.10/0.34 % OS : Linux 6.8.0-71-generic
% 0.10/0.34 % CPULimit : 300
% 0.10/0.34 % WCLimit : 300
% 0.10/0.34 % DateTime : Sun Sep 20 06:24:35 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.12/0.37 % SZS status Theorem for theBenchmark
% 0.12/0.37 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------