%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN053-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:36:52 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.38s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 5 unt; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 14 ( 7 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 6 ( 4 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(clause_1,axiom,
! [VAR_0,VAR_1] :
( big_f(VAR_1)
| big_f(VAR_0)
| p ),
file('theBenchmark.p',clause_1) ).
cnf(c_1,plain,
( big_f(B)
| big_f(A)
| p ),
inference(clausify,[status(thm)],[clause_1]) ).
fof(clause_3,axiom,
~ p,
file('theBenchmark.p',clause_3) ).
cnf(c_2,plain,
~ p,
inference(clausify,[status(thm)],[clause_3]) ).
fof(clause_5,axiom,
( ~ big_f(b)
| ~ big_f(a) ),
file('theBenchmark.p',clause_5) ).
cnf(c_5,plain,
( ~ big_f(b)
| ~ big_f(a) ),
inference(clausify,[status(thm)],[clause_5]) ).
cnf(c_8,plain,
( big_f(A)
| p ),
inference(factor,[status(thm)],[c_1]) ).
cnf(c_6,plain,
big_f(A),
inference(resolve,[status(thm)],[c_2,c_8]) ).
cnf(c_9,plain,
~ big_f(b),
inference(resolve,[status(thm)],[c_6,c_5]) ).
cnf(c_7,plain,
$false,
inference(resolve,[status(thm)],[c_6,c_9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN053-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.09/0.36 % Computer : n015.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 26 17:10:29 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 353526 was started by sandbox on n015,
% 0.09/0.37 % Sat Sep 26 17:10:29 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.37
% 0.09/0.37 % From the command line: assign(max_seconds, 300).
% 0.09/0.38
% 0.09/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.38
% 0.09/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.38 % Length of proof is 5.
% 0.09/0.38 % Level of proof is 2.
% 0.09/0.38 % Maximum clause weight is 5.000.
% 0.09/0.38 % Given clauses 0.
% 0.09/0.38
% 0.09/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------