TSTP Solution File: PUZ060+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : PUZ060+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n015.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 May 1 03:38:36 EDT 2024
% Result : Theorem 0.57s 0.75s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 7 unt; 0 def)
% Number of atoms : 128 ( 0 equ)
% Maximal formula atoms : 28 ( 7 avg)
% Number of connectives : 149 ( 39 ~; 30 |; 64 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 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 : 91 ( 70 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f21,plain,
$false,
inference(subsumption_resolution,[],[f20,f17]) ).
fof(f17,plain,
~ food(sK0),
inference(resolution,[],[f8,f16]) ).
fof(f16,plain,
~ likes(sK1,sK0),
inference(cnf_transformation,[],[f7]) ).
fof(f7,plain,
( ~ likes(sK1,sK0)
& ! [X6] :
( ! [X7] : not_killed_by(X6,X7)
| ~ alive(X6) )
& ! [X8] :
( eats(sK3,X8)
| ~ eats(sK2,X8) )
& alive(sK2)
& eats(sK2,sK0)
& ! [X9] :
( food(X9)
| ! [X10] :
( ~ not_killed_by(X10,X9)
| ~ eats(X10,X9) ) )
& food(sK5)
& food(sK4)
& ! [X11] :
( likes(sK1,X11)
| ~ food(X11) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f5,f6]) ).
fof(f6,plain,
( ? [X0,X1,X2,X3,X4,X5] :
( ~ likes(X1,X0)
& ! [X6] :
( ! [X7] : not_killed_by(X6,X7)
| ~ alive(X6) )
& ! [X8] :
( eats(X3,X8)
| ~ eats(X2,X8) )
& alive(X2)
& eats(X2,X0)
& ! [X9] :
( food(X9)
| ! [X10] :
( ~ not_killed_by(X10,X9)
| ~ eats(X10,X9) ) )
& food(X5)
& food(X4)
& ! [X11] :
( likes(X1,X11)
| ~ food(X11) ) )
=> ( ~ likes(sK1,sK0)
& ! [X6] :
( ! [X7] : not_killed_by(X6,X7)
| ~ alive(X6) )
& ! [X8] :
( eats(sK3,X8)
| ~ eats(sK2,X8) )
& alive(sK2)
& eats(sK2,sK0)
& ! [X9] :
( food(X9)
| ! [X10] :
( ~ not_killed_by(X10,X9)
| ~ eats(X10,X9) ) )
& food(sK5)
& food(sK4)
& ! [X11] :
( likes(sK1,X11)
| ~ food(X11) ) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
? [X0,X1,X2,X3,X4,X5] :
( ~ likes(X1,X0)
& ! [X6] :
( ! [X7] : not_killed_by(X6,X7)
| ~ alive(X6) )
& ! [X8] :
( eats(X3,X8)
| ~ eats(X2,X8) )
& alive(X2)
& eats(X2,X0)
& ! [X9] :
( food(X9)
| ! [X10] :
( ~ not_killed_by(X10,X9)
| ~ eats(X10,X9) ) )
& food(X5)
& food(X4)
& ! [X11] :
( likes(X1,X11)
| ~ food(X11) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
? [X0,X1,X2,X3,X4,X5] :
( ~ likes(X1,X0)
& ! [X6] :
( ! [X7] : not_killed_by(X6,X7)
| ~ alive(X6) )
& ! [X8] :
( eats(X3,X8)
| ~ eats(X2,X8) )
& alive(X2)
& eats(X2,X0)
& ! [X9] :
( food(X9)
| ! [X10] :
( ~ not_killed_by(X10,X9)
| ~ eats(X10,X9) ) )
& food(X5)
& food(X4)
& ! [X11] :
( likes(X1,X11)
| ~ food(X11) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ! [X0,X1,X2,X3,X4,X5] :
( ( ! [X6] :
( alive(X6)
=> ! [X7] : not_killed_by(X6,X7) )
& ! [X8] :
( eats(X2,X8)
=> eats(X3,X8) )
& alive(X2)
& eats(X2,X0)
& ! [X9] :
( ? [X10] :
( not_killed_by(X10,X9)
& eats(X10,X9) )
=> food(X9) )
& food(X5)
& food(X4)
& ! [X11] :
( food(X11)
=> likes(X1,X11) ) )
=> likes(X1,X0) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X0,X1,X2,X3,X4,X5] :
( ( ! [X7] :
( alive(X7)
=> ! [X6] : not_killed_by(X7,X6) )
& ! [X6] :
( eats(X2,X6)
=> eats(X3,X6) )
& alive(X2)
& eats(X2,X0)
& ! [X6] :
( ? [X7] :
( not_killed_by(X7,X6)
& eats(X7,X6) )
=> food(X6) )
& food(X5)
& food(X4)
& ! [X6] :
( food(X6)
=> likes(X1,X6) ) )
=> likes(X1,X0) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X0,X1,X2,X3,X4,X5] :
( ( ! [X7] :
( alive(X7)
=> ! [X6] : not_killed_by(X7,X6) )
& ! [X6] :
( eats(X2,X6)
=> eats(X3,X6) )
& alive(X2)
& eats(X2,X0)
& ! [X6] :
( ? [X7] :
( not_killed_by(X7,X6)
& eats(X7,X6) )
=> food(X6) )
& food(X5)
& food(X4)
& ! [X6] :
( food(X6)
=> likes(X1,X6) ) )
=> likes(X1,X0) ),
file('/export/starexec/sandbox/tmp/tmp.D51s2htXea/Vampire---4.8_6465',prove_this) ).
fof(f8,plain,
! [X11] :
( likes(sK1,X11)
| ~ food(X11) ),
inference(cnf_transformation,[],[f7]) ).
fof(f20,plain,
food(sK0),
inference(resolution,[],[f19,f12]) ).
fof(f12,plain,
eats(sK2,sK0),
inference(cnf_transformation,[],[f7]) ).
fof(f19,plain,
! [X0] :
( ~ eats(sK2,X0)
| food(X0) ),
inference(resolution,[],[f11,f18]) ).
fof(f18,plain,
! [X0] : not_killed_by(sK2,X0),
inference(resolution,[],[f15,f13]) ).
fof(f13,plain,
alive(sK2),
inference(cnf_transformation,[],[f7]) ).
fof(f15,plain,
! [X6,X7] :
( ~ alive(X6)
| not_killed_by(X6,X7) ),
inference(cnf_transformation,[],[f7]) ).
fof(f11,plain,
! [X10,X9] :
( ~ not_killed_by(X10,X9)
| food(X9)
| ~ eats(X10,X9) ),
inference(cnf_transformation,[],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : PUZ060+1 : TPTP v8.1.2. Released v3.1.0.
% 0.08/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 17:49:33 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_EPR_NEQ problem
% 0.15/0.37 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.D51s2htXea/Vampire---4.8_6465
% 0.57/0.75 % (6862)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.57/0.75 % (6862)First to succeed.
% 0.57/0.75 % (6855)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.57/0.75 % (6857)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.57/0.75 % (6856)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.57/0.75 % (6858)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.57/0.75 % (6860)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.57/0.75 % (6859)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.57/0.75 % (6861)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.57/0.75 % (6862)Refutation found. Thanks to Tanya!
% 0.57/0.75 % SZS status Theorem for Vampire---4
% 0.57/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.75 % (6862)------------------------------
% 0.57/0.75 % (6862)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.57/0.75 % (6862)Termination reason: Refutation
% 0.57/0.75
% 0.57/0.75 % (6862)Memory used [KB]: 960
% 0.57/0.75 % (6862)Time elapsed: 0.002 s
% 0.57/0.75 % (6862)Instructions burned: 3 (million)
% 0.57/0.75 % (6862)------------------------------
% 0.57/0.75 % (6862)------------------------------
% 0.57/0.75 % (6713)Success in time 0.374 s
% 0.57/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------