TSTP Solution File: PUZ012_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : PUZ012_1 : TPTP v8.2.0. Released v5.0.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n012.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 : Tue May 21 02:27:41 EDT 2024
% Result : Theorem 0.73s 0.90s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 23
% Syntax : Number of formulae : 56 ( 14 unt; 12 typ; 0 def)
% Number of atoms : 85 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 73 ( 32 ~; 34 |; 4 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 8 ( 4 >; 4 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 22 ( 22 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
box: $tType ).
tff(type_def_6,type,
fruit: $tType ).
tff(func_def_0,type,
boxa: box ).
tff(func_def_1,type,
boxb: box ).
tff(func_def_2,type,
boxc: box ).
tff(func_def_3,type,
apples: fruit ).
tff(func_def_4,type,
bananas: fruit ).
tff(func_def_5,type,
oranges: fruit ).
tff(pred_def_1,type,
equal_fruits: ( fruit * fruit ) > $o ).
tff(pred_def_2,type,
equal_boxes: ( box * box ) > $o ).
tff(pred_def_3,type,
contains: ( box * fruit ) > $o ).
tff(pred_def_4,type,
label: ( box * fruit ) > $o ).
tff(f99,plain,
$false,
inference(avatar_sat_refutation,[],[f52,f72,f98]) ).
tff(f98,plain,
( ~ spl0_1
| spl0_2 ),
inference(avatar_contradiction_clause,[],[f97]) ).
tff(f97,plain,
( $false
| ~ spl0_1
| spl0_2 ),
inference(subsumption_resolution,[],[f94,f39]) ).
tff(f39,plain,
~ equal_fruits(bananas,oranges),
inference(cnf_transformation,[],[f12]) ).
tff(f12,axiom,
~ equal_fruits(bananas,oranges),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bananas_not_oranges) ).
tff(f94,plain,
( equal_fruits(bananas,oranges)
| ~ spl0_1
| spl0_2 ),
inference(resolution,[],[f84,f46]) ).
tff(f46,plain,
( contains(boxa,bananas)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f45]) ).
tff(f45,plain,
( spl0_1
<=> contains(boxa,bananas) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
tff(f84,plain,
( ! [X0: fruit] :
( ~ contains(boxa,X0)
| equal_fruits(X0,oranges) )
| spl0_2 ),
inference(resolution,[],[f82,f42]) ).
tff(f42,plain,
! [X2: fruit,X0: box,X1: fruit] :
( ~ contains(X0,X2)
| equal_fruits(X1,X2)
| ~ contains(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
tff(f25,plain,
! [X0: box,X1: fruit,X2: fruit] :
( equal_fruits(X1,X2)
| ~ contains(X0,X2)
| ~ contains(X0,X1) ),
inference(flattening,[],[f24]) ).
tff(f24,plain,
! [X0: box,X1: fruit,X2: fruit] :
( equal_fruits(X1,X2)
| ~ contains(X0,X2)
| ~ contains(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
tff(f6,axiom,
! [X0: box,X1: fruit,X2: fruit] :
( ( contains(X0,X2)
& contains(X0,X1) )
=> equal_fruits(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',contains_is_well_defined1) ).
tff(f82,plain,
( contains(boxa,oranges)
| spl0_2 ),
inference(subsumption_resolution,[],[f80,f54]) ).
tff(f54,plain,
~ contains(boxb,oranges),
inference(resolution,[],[f27,f37]) ).
tff(f37,plain,
! [X0: box,X1: fruit] :
( ~ label(X0,X1)
| ~ contains(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
tff(f21,plain,
! [X0: box,X1: fruit] :
( ~ contains(X0,X1)
| ~ label(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
tff(f3,axiom,
! [X0: box,X1: fruit] :
~ ( contains(X0,X1)
& label(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',label_is_wrong) ).
tff(f27,plain,
label(boxb,oranges),
inference(cnf_transformation,[],[f15]) ).
tff(f15,axiom,
label(boxb,oranges),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',boxb_labelled_oranges) ).
tff(f80,plain,
( contains(boxb,oranges)
| contains(boxa,oranges)
| spl0_2 ),
inference(resolution,[],[f51,f33]) ).
tff(f33,plain,
! [X0: fruit] :
( contains(boxc,X0)
| contains(boxb,X0)
| contains(boxa,X0) ),
inference(cnf_transformation,[],[f4]) ).
tff(f4,axiom,
! [X0: fruit] :
( contains(boxc,X0)
| contains(boxb,X0)
| contains(boxa,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',each_thing_is_in_a_box) ).
tff(f51,plain,
( ~ contains(boxc,oranges)
| spl0_2 ),
inference(avatar_component_clause,[],[f49]) ).
tff(f49,plain,
( spl0_2
<=> contains(boxc,oranges) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
tff(f72,plain,
spl0_1,
inference(avatar_contradiction_clause,[],[f71]) ).
tff(f71,plain,
( $false
| spl0_1 ),
inference(subsumption_resolution,[],[f68,f35]) ).
tff(f35,plain,
~ equal_fruits(apples,bananas),
inference(cnf_transformation,[],[f11]) ).
tff(f11,axiom,
~ equal_fruits(apples,bananas),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',apples_not_bananas) ).
tff(f68,plain,
( equal_fruits(apples,bananas)
| spl0_1 ),
inference(resolution,[],[f61,f29]) ).
tff(f29,plain,
contains(boxb,apples),
inference(cnf_transformation,[],[f17]) ).
tff(f17,axiom,
contains(boxb,apples),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',boxb_contains_apples) ).
tff(f61,plain,
( ! [X0: fruit] :
( ~ contains(boxb,X0)
| equal_fruits(X0,bananas) )
| spl0_1 ),
inference(resolution,[],[f60,f42]) ).
tff(f60,plain,
( contains(boxb,bananas)
| spl0_1 ),
inference(subsumption_resolution,[],[f59,f47]) ).
tff(f47,plain,
( ~ contains(boxa,bananas)
| spl0_1 ),
inference(avatar_component_clause,[],[f45]) ).
tff(f59,plain,
( contains(boxb,bananas)
| contains(boxa,bananas) ),
inference(resolution,[],[f55,f33]) ).
tff(f55,plain,
~ contains(boxc,bananas),
inference(resolution,[],[f28,f37]) ).
tff(f28,plain,
label(boxc,bananas),
inference(cnf_transformation,[],[f16]) ).
tff(f16,axiom,
label(boxc,bananas),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',boxc_labelled_bananas) ).
tff(f52,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f30,f49,f45]) ).
tff(f30,plain,
( ~ contains(boxc,oranges)
| ~ contains(boxa,bananas) ),
inference(cnf_transformation,[],[f20]) ).
tff(f20,plain,
( ~ contains(boxc,oranges)
| ~ contains(boxa,bananas) ),
inference(ennf_transformation,[],[f19]) ).
tff(f19,negated_conjecture,
~ ( contains(boxc,oranges)
& contains(boxa,bananas) ),
inference(negated_conjecture,[],[f18]) ).
tff(f18,conjecture,
( contains(boxc,oranges)
& contains(boxa,bananas) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_boxa_contains_bananas_and_boxc_oranges) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : PUZ012_1 : TPTP v8.2.0. Released v5.0.0.
% 0.08/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.38 % Computer : n012.cluster.edu
% 0.14/0.38 % Model : x86_64 x86_64
% 0.14/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38 % Memory : 8042.1875MB
% 0.14/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.38 % CPULimit : 300
% 0.14/0.38 % WCLimit : 300
% 0.14/0.38 % DateTime : Sat May 18 10:41:23 EDT 2024
% 0.14/0.39 % CPUTime :
% 0.14/0.39 This is a TF0_THM_NEQ_NAR problem
% 0.14/0.39 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.73/0.90 % (13410)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.73/0.90 % (13408)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 theBenchmark for (2994ds/34Mi)
% 0.73/0.90 % (13409)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 theBenchmark for (2994ds/51Mi)
% 0.73/0.90 % (13411)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.73/0.90 % (13412)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 theBenchmark for (2994ds/34Mi)
% 0.73/0.90 % (13413)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.73/0.90 % (13414)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 theBenchmark for (2994ds/83Mi)
% 0.73/0.90 % (13415)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2994ds/56Mi)
% 0.73/0.90 % (13412)Refutation not found, incomplete strategy% (13412)------------------------------
% 0.73/0.90 % (13412)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.90 % (13412)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.90
% 0.73/0.90 % (13412)Memory used [KB]: 970
% 0.73/0.90 % (13412)Time elapsed: 0.003 s
% 0.73/0.90 % (13412)Instructions burned: 2 (million)
% 0.73/0.90 % (13411)Refutation not found, incomplete strategy% (13411)------------------------------
% 0.73/0.90 % (13411)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.90 % (13411)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.90
% 0.73/0.90 % (13411)Memory used [KB]: 971
% 0.73/0.90 % (13411)Time elapsed: 0.003 s
% 0.73/0.90 % (13411)Instructions burned: 3 (million)
% 0.73/0.90 % (13415)Refutation not found, incomplete strategy% (13415)------------------------------
% 0.73/0.90 % (13415)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.90 % (13415)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.90
% 0.73/0.90 % (13415)Memory used [KB]: 956
% 0.73/0.90 % (13415)Time elapsed: 0.003 s
% 0.73/0.90 % (13415)Instructions burned: 2 (million)
% 0.73/0.90 % (13412)------------------------------
% 0.73/0.90 % (13412)------------------------------
% 0.73/0.90 % (13408)Also succeeded, but the first one will report.
% 0.73/0.90 % (13413)First to succeed.
% 0.73/0.90 % (13411)------------------------------
% 0.73/0.90 % (13411)------------------------------
% 0.73/0.90 % (13415)------------------------------
% 0.73/0.90 % (13415)------------------------------
% 0.73/0.90 % (13414)Also succeeded, but the first one will report.
% 0.73/0.90 % (13410)Also succeeded, but the first one will report.
% 0.73/0.90 % (13413)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-13407"
% 0.73/0.90 % (13409)Also succeeded, but the first one will report.
% 0.73/0.90 % (13413)Refutation found. Thanks to Tanya!
% 0.73/0.90 % SZS status Theorem for theBenchmark
% 0.73/0.90 % SZS output start Proof for theBenchmark
% See solution above
% 0.73/0.90 % (13413)------------------------------
% 0.73/0.90 % (13413)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.90 % (13413)Termination reason: Refutation
% 0.73/0.90
% 0.73/0.90 % (13413)Memory used [KB]: 990
% 0.73/0.90 % (13413)Time elapsed: 0.004 s
% 0.73/0.90 % (13413)Instructions burned: 4 (million)
% 0.73/0.90 % (13407)Success in time 0.509 s
% 0.73/0.90 % Vampire---4.8 exiting
%------------------------------------------------------------------------------