%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SYN051-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 : n026.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.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 3 unt; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 21 ( 11 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 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 : 4 ( 2 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(clause_2,axiom,
( p
| ~ big_f(b) ),
file('theBenchmark.p',clause_2) ).
cnf(c_1,plain,
( p
| ~ big_f(b) ),
inference(clausify,[status(thm)],[clause_2]) ).
fof(clause_1,axiom,
( big_f(a)
| ~ p ),
file('theBenchmark.p',clause_1) ).
cnf(c_2,plain,
( big_f(a)
| ~ p ),
inference(clausify,[status(thm)],[clause_1]) ).
fof(clause_3,axiom,
! [VAR_0] :
( big_f(VAR_0)
| p ),
file('theBenchmark.p',clause_3) ).
cnf(c_3,plain,
( big_f(A)
| p ),
inference(clausify,[status(thm)],[clause_3]) ).
fof(clause_4,axiom,
! [VAR_0] :
( ~ p
| ~ big_f(VAR_0) ),
file('theBenchmark.p',clause_4) ).
cnf(c_4,plain,
( ~ p
| ~ big_f(A) ),
inference(clausify,[status(thm)],[clause_4]) ).
cnf(c_5,plain,
( ~ p
| ~ p ),
inference(resolve,[status(thm)],[c_4,c_2]) ).
cnf(c_6,plain,
~ p,
inference(copy,[status(thm)],[c_5]) ).
cnf(c_7,plain,
( p
| p ),
inference(resolve,[status(thm)],[c_3,c_1]) ).
cnf(c_9,plain,
p,
inference(copy,[status(thm)],[c_7]) ).
cnf(c_8,plain,
$false,
inference(resolve,[status(thm)],[c_6,c_9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SYN051-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.42 % Computer : n026.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.42 % CPULimit : 300
% 0.16/0.42 % WCLimit : 300
% 0.16/0.43 % DateTime : Sat Sep 26 17:09:40 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.43 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/0.43 % Process 1527311 was started by sandbox on n026,
% 0.16/0.43 % Sat Sep 26 17:09:40 2026
% 0.16/0.43 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.16/0.44
% 0.16/0.44 % From the command line: assign(max_seconds, 300).
% 0.16/0.44
% 0.16/0.44 % SZS status Unsatisfiable for theBenchmark
% 0.16/0.44
% 0.16/0.44 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.16/0.44 % Length of proof is 8.
% 0.16/0.44 % Level of proof is 3.
% 0.16/0.44 % Maximum clause weight is 1.000.
% 0.16/0.44 % Given clauses 0.
% 0.16/0.44
% 0.16/0.44 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------