%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : PUZ002-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 : n014.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 08:22:42 AM UTC 2026
% Result : Unsatisfiable 0.08s 0.36s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 35 ( 7 unt; 0 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 61 ( 33 ~; 28 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 28 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(in_house_if_takes_to_me,axiom,
! [VAR_0] :
( in_house(VAR_0)
| ~ takes_to_me(VAR_0) ),
file('theBenchmark.p',in_house_if_takes_to_me) ).
cnf(c_1,plain,
( in_house(A)
| ~ takes_to_me(A) ),
inference(clausify,[status(thm)],[in_house_if_takes_to_me]) ).
fof(only_cats_in_house,axiom,
! [VAR_0] :
( cat(VAR_0)
| ~ in_house(VAR_0) ),
file('theBenchmark.p',only_cats_in_house) ).
cnf(c_2,plain,
( cat(A)
| ~ in_house(A) ),
inference(clausify,[status(thm)],[only_cats_in_house]) ).
fof(cats_are_mice_killers,axiom,
! [VAR_0] :
( mouse_killer(VAR_0)
| ~ cat(VAR_0) ),
file('theBenchmark.p',cats_are_mice_killers) ).
cnf(c_3,plain,
( mouse_killer(A)
| ~ cat(A) ),
inference(clausify,[status(thm)],[cats_are_mice_killers]) ).
cnf(c_4,plain,
( cat(A)
| ~ takes_to_me(A) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
fof(prowlers_are_gazers,axiom,
! [VAR_0] :
( gazer(VAR_0)
| ~ prowler(VAR_0) ),
file('theBenchmark.p',prowlers_are_gazers) ).
cnf(c_5,plain,
( gazer(A)
| ~ prowler(A) ),
inference(clausify,[status(thm)],[prowlers_are_gazers]) ).
fof(gazers_are_suitable_pets,axiom,
! [VAR_0] :
( suitable_pet(VAR_0)
| ~ gazer(VAR_0) ),
file('theBenchmark.p',gazers_are_suitable_pets) ).
cnf(c_6,plain,
( suitable_pet(A)
| ~ gazer(A) ),
inference(clausify,[status(thm)],[gazers_are_suitable_pets]) ).
fof(kangaroos_are_not_pets,axiom,
! [VAR_0] :
( ~ suitable_pet(VAR_0)
| ~ kangaroo(VAR_0) ),
file('theBenchmark.p',kangaroos_are_not_pets) ).
cnf(c_7,plain,
( ~ suitable_pet(A)
| ~ kangaroo(A) ),
inference(clausify,[status(thm)],[kangaroos_are_not_pets]) ).
cnf(c_8,plain,
( suitable_pet(A)
| ~ prowler(A) ),
inference(resolve,[status(thm)],[c_5,c_6]) ).
fof(takes_to_me_or_detested,axiom,
! [VAR_0] :
( detested(VAR_0)
| takes_to_me(VAR_0) ),
file('theBenchmark.p',takes_to_me_or_detested) ).
cnf(c_9,plain,
( detested(A)
| takes_to_me(A) ),
inference(clausify,[status(thm)],[takes_to_me_or_detested]) ).
fof(avoid_detested,axiom,
! [VAR_0] :
( avoided(VAR_0)
| ~ detested(VAR_0) ),
file('theBenchmark.p',avoid_detested) ).
cnf(c_10,plain,
( avoided(A)
| ~ detested(A) ),
inference(clausify,[status(thm)],[avoid_detested]) ).
fof(avoid_kangaroo,axiom,
~ avoided(the_kangaroo),
file('theBenchmark.p',avoid_kangaroo) ).
cnf(c_11,plain,
~ avoided(the_kangaroo),
inference(clausify,[status(thm)],[avoid_kangaroo]) ).
cnf(c_12,plain,
( avoided(A)
| takes_to_me(A) ),
inference(resolve,[status(thm)],[c_9,c_10]) ).
fof(mouse_killers_are_carnivores,axiom,
! [VAR_0] :
( carnivore(VAR_0)
| ~ mouse_killer(VAR_0) ),
file('theBenchmark.p',mouse_killers_are_carnivores) ).
cnf(c_13,plain,
( carnivore(A)
| ~ mouse_killer(A) ),
inference(clausify,[status(thm)],[mouse_killers_are_carnivores]) ).
fof(carnivores_are_prowlers,axiom,
! [VAR_0] :
( prowler(VAR_0)
| ~ carnivore(VAR_0) ),
file('theBenchmark.p',carnivores_are_prowlers) ).
cnf(c_14,plain,
( prowler(A)
| ~ carnivore(A) ),
inference(clausify,[status(thm)],[carnivores_are_prowlers]) ).
cnf(c_15,plain,
( ~ prowler(A)
| ~ kangaroo(A) ),
inference(resolve,[status(thm)],[c_7,c_8]) ).
cnf(c_16,plain,
( prowler(A)
| ~ mouse_killer(A) ),
inference(resolve,[status(thm)],[c_13,c_14]) ).
cnf(c_17,plain,
( ~ takes_to_me(A)
| mouse_killer(A) ),
inference(resolve,[status(thm)],[c_3,c_4]) ).
cnf(c_18,plain,
( ~ mouse_killer(A)
| ~ kangaroo(A) ),
inference(resolve,[status(thm)],[c_15,c_16]) ).
cnf(c_19,plain,
takes_to_me(the_kangaroo),
inference(resolve,[status(thm)],[c_11,c_12]) ).
cnf(c_20,plain,
( ~ kangaroo(A)
| ~ takes_to_me(A) ),
inference(resolve,[status(thm)],[c_17,c_18]) ).
fof(kangaroo_is_a_kangaroo,axiom,
kangaroo(the_kangaroo),
file('theBenchmark.p',kangaroo_is_a_kangaroo) ).
cnf(c_21,plain,
kangaroo(the_kangaroo),
inference(clausify,[status(thm)],[kangaroo_is_a_kangaroo]) ).
cnf(c_22,plain,
~ kangaroo(the_kangaroo),
inference(resolve,[status(thm)],[c_19,c_20]) ).
cnf(c_23,plain,
$false,
inference(resolve,[status(thm)],[c_21,c_22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ002-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.08/0.34 % Computer : n014.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Sat Sep 26 05:02:31 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 2197261 was started by sandbox on n014,
% 0.08/0.35 % Sat Sep 26 05:02:31 2026
% 0.08/0.35 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/0.35
% 0.08/0.35 % From the command line: assign(max_seconds, 300).
% 0.08/0.36
% 0.08/0.36 % SZS status Unsatisfiable for theBenchmark
% 0.08/0.36
% 0.08/0.36 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.08/0.36 % Length of proof is 23.
% 0.08/0.36 % Level of proof is 6.
% 0.08/0.36 % Maximum clause weight is 0.000.
% 0.08/0.36 % Given clauses 0.
% 0.08/0.36
% 0.08/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------