TSTP Solution File: PUZ060+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : PUZ060+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 31 18:11:57 EDT 2022
% Result : Theorem 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 25 ( 10 unt; 0 def)
% Number of atoms : 152 ( 0 equ)
% Maximal formula atoms : 28 ( 6 avg)
% Number of connectives : 177 ( 50 ~; 39 |; 72 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 108 ( 81 !; 27 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f31,plain,
$false,
inference(subsumption_resolution,[],[f30,f27]) ).
fof(f27,plain,
~ food(sK2),
inference(resolution,[],[f20,f24]) ).
fof(f24,plain,
~ likes(sK5,sK2),
inference(literal_reordering,[],[f11]) ).
fof(f11,plain,
~ likes(sK5,sK2),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
( ! [X6] :
( ~ eats(sK4,X6)
| eats(sK3,X6) )
& ! [X7] :
( food(X7)
| ! [X8] :
( ~ not_killed_by(X8,X7)
| ~ eats(X8,X7) ) )
& food(sK1)
& eats(sK4,sK2)
& alive(sK4)
& ! [X9] :
( ! [X10] : not_killed_by(X9,X10)
| ~ alive(X9) )
& ~ likes(sK5,sK2)
& ! [X11] :
( likes(sK5,X11)
| ~ food(X11) )
& food(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f6,f7]) ).
fof(f7,plain,
( ? [X0,X1,X2,X3,X4,X5] :
( ! [X6] :
( ~ eats(X4,X6)
| eats(X3,X6) )
& ! [X7] :
( food(X7)
| ! [X8] :
( ~ not_killed_by(X8,X7)
| ~ eats(X8,X7) ) )
& food(X1)
& eats(X4,X2)
& alive(X4)
& ! [X9] :
( ! [X10] : not_killed_by(X9,X10)
| ~ alive(X9) )
& ~ likes(X5,X2)
& ! [X11] :
( likes(X5,X11)
| ~ food(X11) )
& food(X0) )
=> ( ! [X6] :
( ~ eats(sK4,X6)
| eats(sK3,X6) )
& ! [X7] :
( food(X7)
| ! [X8] :
( ~ not_killed_by(X8,X7)
| ~ eats(X8,X7) ) )
& food(sK1)
& eats(sK4,sK2)
& alive(sK4)
& ! [X9] :
( ! [X10] : not_killed_by(X9,X10)
| ~ alive(X9) )
& ~ likes(sK5,sK2)
& ! [X11] :
( likes(sK5,X11)
| ~ food(X11) )
& food(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
? [X0,X1,X2,X3,X4,X5] :
( ! [X6] :
( ~ eats(X4,X6)
| eats(X3,X6) )
& ! [X7] :
( food(X7)
| ! [X8] :
( ~ not_killed_by(X8,X7)
| ~ eats(X8,X7) ) )
& food(X1)
& eats(X4,X2)
& alive(X4)
& ! [X9] :
( ! [X10] : not_killed_by(X9,X10)
| ~ alive(X9) )
& ~ likes(X5,X2)
& ! [X11] :
( likes(X5,X11)
| ~ food(X11) )
& food(X0) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
? [X3,X0,X2,X4,X1,X5] :
( ! [X6] :
( ~ eats(X1,X6)
| eats(X4,X6) )
& ! [X10] :
( food(X10)
| ! [X11] :
( ~ not_killed_by(X11,X10)
| ~ eats(X11,X10) ) )
& food(X0)
& eats(X1,X2)
& alive(X1)
& ! [X7] :
( ! [X8] : not_killed_by(X7,X8)
| ~ alive(X7) )
& ~ likes(X5,X2)
& ! [X9] :
( likes(X5,X9)
| ~ food(X9) )
& food(X3) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
? [X5,X1,X4,X2,X0,X3] :
( ~ likes(X5,X2)
& ! [X6] :
( ~ eats(X1,X6)
| eats(X4,X6) )
& eats(X1,X2)
& food(X0)
& alive(X1)
& food(X3)
& ! [X9] :
( likes(X5,X9)
| ~ food(X9) )
& ! [X7] :
( ! [X8] : not_killed_by(X7,X8)
| ~ alive(X7) )
& ! [X10] :
( food(X10)
| ! [X11] :
( ~ not_killed_by(X11,X10)
| ~ eats(X11,X10) ) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ! [X5,X1,X4,X2,X0,X3] :
( ( ! [X6] :
( eats(X1,X6)
=> eats(X4,X6) )
& eats(X1,X2)
& food(X0)
& alive(X1)
& food(X3)
& ! [X9] :
( food(X9)
=> likes(X5,X9) )
& ! [X7] :
( alive(X7)
=> ! [X8] : not_killed_by(X7,X8) )
& ! [X10] :
( ? [X11] :
( eats(X11,X10)
& not_killed_by(X11,X10) )
=> food(X10) ) )
=> likes(X5,X2) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X5,X2,X0,X4,X3,X1] :
( ( food(X5)
& ! [X6] :
( eats(X2,X6)
=> eats(X3,X6) )
& ! [X7] :
( alive(X7)
=> ! [X6] : not_killed_by(X7,X6) )
& food(X4)
& ! [X6] :
( food(X6)
=> likes(X1,X6) )
& eats(X2,X0)
& ! [X6] :
( ? [X7] :
( eats(X7,X6)
& not_killed_by(X7,X6) )
=> food(X6) )
& alive(X2) )
=> likes(X1,X0) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X5,X2,X0,X4,X3,X1] :
( ( food(X5)
& ! [X6] :
( eats(X2,X6)
=> eats(X3,X6) )
& ! [X7] :
( alive(X7)
=> ! [X6] : not_killed_by(X7,X6) )
& food(X4)
& ! [X6] :
( food(X6)
=> likes(X1,X6) )
& eats(X2,X0)
& ! [X6] :
( ? [X7] :
( eats(X7,X6)
& not_killed_by(X7,X6) )
=> food(X6) )
& alive(X2) )
=> likes(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f20,plain,
! [X11] :
( likes(sK5,X11)
| ~ food(X11) ),
inference(literal_reordering,[],[f10]) ).
fof(f10,plain,
! [X11] :
( likes(sK5,X11)
| ~ food(X11) ),
inference(cnf_transformation,[],[f8]) ).
fof(f30,plain,
food(sK2),
inference(resolution,[],[f29,f22]) ).
fof(f22,plain,
eats(sK4,sK2),
inference(literal_reordering,[],[f14]) ).
fof(f14,plain,
eats(sK4,sK2),
inference(cnf_transformation,[],[f8]) ).
fof(f29,plain,
! [X0] :
( ~ eats(sK4,X0)
| food(X0) ),
inference(resolution,[],[f28,f23]) ).
fof(f23,plain,
! [X8,X7] :
( ~ not_killed_by(X8,X7)
| ~ eats(X8,X7)
| food(X7) ),
inference(literal_reordering,[],[f16]) ).
fof(f16,plain,
! [X8,X7] :
( food(X7)
| ~ eats(X8,X7)
| ~ not_killed_by(X8,X7) ),
inference(cnf_transformation,[],[f8]) ).
fof(f28,plain,
! [X0] : not_killed_by(sK4,X0),
inference(resolution,[],[f21,f18]) ).
fof(f18,plain,
alive(sK4),
inference(literal_reordering,[],[f13]) ).
fof(f13,plain,
alive(sK4),
inference(cnf_transformation,[],[f8]) ).
fof(f21,plain,
! [X10,X9] :
( ~ alive(X9)
| not_killed_by(X9,X10) ),
inference(literal_reordering,[],[f12]) ).
fof(f12,plain,
! [X10,X9] :
( ~ alive(X9)
| not_killed_by(X9,X10) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PUZ060+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 10:42:41 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.48 % (2337)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.20/0.49 % (2328)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.20/0.49 % (2337)First to succeed.
% 0.20/0.49 Detected maximum model sizes of [6]
% 0.20/0.49 TRYING [1]
% 0.20/0.49 TRYING [2]
% 0.20/0.49 % (2328)Also succeeded, but the first one will report.
% 0.20/0.49 % (2337)Refutation found. Thanks to Tanya!
% 0.20/0.49 % SZS status Theorem for theBenchmark
% 0.20/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.49 % (2337)------------------------------
% 0.20/0.49 % (2337)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (2337)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (2337)Termination reason: Refutation
% 0.20/0.49
% 0.20/0.49 % (2337)Memory used [KB]: 5628
% 0.20/0.49 % (2337)Time elapsed: 0.008 s
% 0.20/0.49 % (2337)Instructions burned: 3 (million)
% 0.20/0.49 % (2337)------------------------------
% 0.20/0.49 % (2337)------------------------------
% 0.20/0.49 % (2321)Success in time 0.143 s
%------------------------------------------------------------------------------