%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN081+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n008.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 : Sun Sep 27 09:37:00 AM UTC 2026
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 3 unt; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 18 ( 9 ~; 6 |; 2 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 11 ( 2 sgn 1 !; 2 ?)
% 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(pel59_neg,negated_conjecture,
~ ? [X] :
( ~ big_f(f(X))
& big_f(X) ),
inference(assume_negation,[status(cth)],[pel59]) ).
cnf(c_3,plain,
( ~ big_f(f(A))
| ~ big_f(A) ),
inference(clausify,[status(thm)],[pel59_1]) ).
cnf(c_4,plain,
( big_f(f(A))
| big_f(A) ),
inference(clausify,[status(thm)],[pel59_1]) ).
cnf(c_5,negated_conjecture,
( big_f(f(A))
| ~ big_f(A) ),
inference(clausify,[status(thm)],[pel59_neg]) ).
cnf(c_6,plain,
( big_f(A)
| big_f(f(f(A))) ),
inference(resolve,[status(thm)],[c_5,c_4]) ).
cnf(c_8,plain,
( ~ big_f(f(A))
| big_f(A) ),
inference(resolve,[status(thm)],[c_6,c_3]) ).
cnf(c_11,plain,
( big_f(A)
| big_f(A) ),
inference(resolve,[status(thm)],[c_8,c_4]) ).
cnf(c_9,plain,
big_f(A),
inference(copy,[status(thm)],[c_11]) ).
cnf(c_12,plain,
~ big_f(f(A)),
inference(resolve,[status(thm)],[c_9,c_3]) ).
cnf(c_10,plain,
$false,
inference(resolve,[status(thm)],[c_9,c_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN081+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n008.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 26 17:10:54 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35 % Process 4122945 was started by sandbox2 on n008,
% 0.08/0.35 % Sat Sep 26 17:10:54 2026
% 0.08/0.35 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.36
% 0.08/0.36 % From the command line: assign(max_seconds, 300).
% 0.12/0.37
% 0.12/0.37 % SZS status Theorem for theBenchmark
% 0.12/0.37
% 0.12/0.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.12/0.37 % Length of proof is 9.
% 0.12/0.37 % Level of proof is 5.
% 0.12/0.37 % Maximum clause weight is 6.000.
% 0.12/0.37 % Given clauses 5.
% 0.12/0.37
% 0.12/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------