%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN081-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/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 : Sun Sep 27 09:37:00 AM UTC 2026
% Result : Unsatisfiable 0.11s 0.38s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 3 unt; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 8 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(clause_1,axiom,
! [VAR_0] :
( ~ big_f(f(VAR_0))
| ~ big_f(VAR_0) ),
file('theBenchmark.p',clause_1) ).
cnf(c_1,plain,
( ~ big_f(f(A))
| ~ big_f(A) ),
inference(clausify,[status(thm)],[clause_1]) ).
fof(clause_2,axiom,
! [VAR_0] :
( big_f(VAR_0)
| big_f(f(VAR_0)) ),
file('theBenchmark.p',clause_2) ).
cnf(c_2,plain,
( big_f(A)
| big_f(f(A)) ),
inference(clausify,[status(thm)],[clause_2]) ).
fof(prove_this,axiom,
! [VAR_0] :
( big_f(f(VAR_0))
| ~ big_f(VAR_0) ),
file('theBenchmark.p',prove_this) ).
cnf(c_3,plain,
( big_f(f(A))
| ~ big_f(A) ),
inference(clausify,[status(thm)],[prove_this]) ).
cnf(c_4,plain,
( big_f(A)
| big_f(f(f(A))) ),
inference(resolve,[status(thm)],[c_3,c_2]) ).
cnf(c_6,plain,
( ~ big_f(f(A))
| big_f(A) ),
inference(resolve,[status(thm)],[c_4,c_1]) ).
cnf(c_9,plain,
( big_f(A)
| big_f(A) ),
inference(resolve,[status(thm)],[c_6,c_2]) ).
cnf(c_7,plain,
big_f(A),
inference(copy,[status(thm)],[c_9]) ).
cnf(c_10,plain,
~ big_f(f(A)),
inference(resolve,[status(thm)],[c_7,c_1]) ).
cnf(c_8,plain,
$false,
inference(resolve,[status(thm)],[c_7,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN081-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36 % Computer : n015.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sat Sep 26 17:13:28 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.36 % Process 359761 was started by sandbox on n015,
% 0.11/0.36 % Sat Sep 26 17:13:28 2026
% 0.11/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.11/0.36
% 0.11/0.36 % From the command line: assign(max_seconds, 300).
% 0.11/0.38
% 0.11/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.38
% 0.11/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.11/0.38 % Length of proof is 7.
% 0.11/0.38 % Level of proof is 4.
% 0.11/0.38 % Maximum clause weight is 6.000.
% 0.11/0.38 % Given clauses 5.
% 0.11/0.38
% 0.11/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------