%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : PUZ061+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n005.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 : Fri Sep 25 02:32:00 PM UTC 2026
% Result : Theorem 7.22s 1.39s
% Output : Proof 7.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 22 ( 15 unt; 0 def)
% Number of atoms : 90 ( 11 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 92 ( 24 ~; 18 |; 38 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-4 aty)
% Number of variables : 55 ( 3 sgn 36 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
! [Peanuts,John,Bill,Sue,Apples,Chicken] :
( ( ! [Y] :
( alive(Y)
=> ! [X] : not_killed_by(Y,X) )
& ! [X] :
( eats(Bill,X)
=> eats(Sue,X) )
& alive(Bill)
& eats(Bill,Peanuts)
& ! [X] :
( ? [Y] :
( not_killed_by(Y,X)
& eats(Y,X) )
=> food(X) )
& food(Chicken)
& food(Apples)
& ! [X] :
( food(X)
=> likes(John,X) )
& ! [X,Y] :
( ( eats(Y,Chicken)
& alive(Y) )
=> likes(Y,X) ) )
=> likes(John,Peanuts) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f0_neg,negated_conjecture,
~ ! [Peanuts,John,Bill,Sue,Apples,Chicken] :
( ( ! [Y] :
( alive(Y)
=> ! [X] : not_killed_by(Y,X) )
& ! [X] :
( eats(Bill,X)
=> eats(Sue,X) )
& alive(Bill)
& eats(Bill,Peanuts)
& ! [X] :
( ? [Y] :
( not_killed_by(Y,X)
& eats(Y,X) )
=> food(X) )
& food(Chicken)
& food(Apples)
& ! [X] :
( food(X)
=> likes(John,X) )
& ! [X,Y] :
( ( eats(Y,Chicken)
& alive(Y) )
=> likes(Y,X) ) )
=> likes(John,Peanuts) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
? [Peanuts,John,Bill,Sue,Apples,Chicken] :
( ~ likes(John,Peanuts)
& ! [Y] :
( ! [X] : not_killed_by(Y,X)
| ~ alive(Y) )
& ! [X] :
( eats(Sue,X)
| ~ eats(Bill,X) )
& alive(Bill)
& eats(Bill,Peanuts)
& ! [X] :
( food(X)
| ! [Y] :
( ~ not_killed_by(Y,X)
| ~ eats(Y,X) ) )
& food(Chicken)
& food(Apples)
& ! [X] :
( likes(John,X)
| ~ food(X) )
& ! [X,Y] :
( likes(Y,X)
| ~ eats(Y,Chicken)
| ~ alive(Y) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [Y,X] :
( ~ likes(sk1,sk0)
& ( not_killed_by(Y,X)
| ~ alive(Y) )
& ( eats(sk3,X)
| ~ eats(sk2,X) )
& alive(sk2)
& eats(sk2,sk0)
& ( food(X)
| ~ not_killed_by(Y,X)
| ~ eats(Y,X) )
& food(sk5)
& food(sk4)
& ( likes(sk1,X)
| ~ food(X) )
& ( likes(Y,X)
| ~ eats(Y,sk5)
| ~ alive(Y) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1,sk2,sk3,sk4,sk5])],[f0_nnf]) ).
cnf(c8,plain,
( not_killed_by(X7,X6)
| ~ alive(X7) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi8,negated_conjecture,
ifeq(alive(X0),true,not_killed_by(X0,X1),true) = true,
inference(equality_encoding,[status(esa)],[c8]) ).
cnf(c6,plain,
alive(sk2),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi6,negated_conjecture,
alive(sk2) = true,
inference(equality_encoding,[status(esa)],[c6]) ).
cnf(h3,plain,
not_killed_by(sk2,V0) = true,
inference(hyper_resolution,[status(thm)],[hi8,hi6]) ).
cnf(c4,plain,
( food(X6)
| ~ not_killed_by(X7,X6)
| ~ eats(X7,X6) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi4,negated_conjecture,
ifeq(eats(X0,X1),true,ifeq(not_killed_by(X0,X1),true,food(X1),true),true) = true,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(c5,plain,
eats(sk2,sk0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi5,negated_conjecture,
eats(sk2,sk0) = true,
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(h4,plain,
food(sk0) = true,
inference(hyper_resolution,[status(thm)],[hi4,hi5,h3]) ).
cnf(c1,plain,
( likes(sk1,X6)
| ~ food(X6) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi1,negated_conjecture,
ifeq(food(X0),true,likes(sk1,X0),true) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(t6,plain,
likes(sk1,sk0) = true,
inference(hyper_resolution,[status(thm)],[hi1,h4]) ).
cnf(t36,plain,
likes(sk1,sk0) = true,
inference(orient,[status(thm)],[t6]) ).
cnf(c9,plain,
~ likes(sk1,sk0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(goal_0,negated_conjecture,
likes(sk1,sk0) != true,
inference(equality_encoding,[status(esa)],[c9]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t36]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ061+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n005.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 : Thu Sep 24 06:51:19 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.22/1.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.22/1.39 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------