%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : PUZ149_13 : TPTP v9.3.1. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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 : Tue Sep 29 12:31:44 PM UTC 2026
% Result : Theorem 2.97s 1.24s
% Output : Refutation 3.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 60 ( 11 unt; 0 typ; 6 def)
% Number of atoms : 162 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 189 ( 87 ~; 67 |; 20 &)
% ( 6 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 7 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 13 con; 0-0 aty)
% Number of variables : 45 ( 0 sgn 31 !; 14 ?; 45 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
'$ki_world': $tType ).
tff(type_def_6,type,
'$ki_index': $tType ).
tff(func_def_0,type,
'$ki_local_world': '$ki_world' ).
tff(func_def_1,type,
'#idx(make_c)': '$ki_index' ).
tff(func_def_2,type,
'#idx(pour_b)': '$ki_index' ).
tff(func_def_3,type,
'#idx(pour_a)': '$ki_index' ).
tff(func_def_4,type,
sK0: '$ki_world' ).
tff(func_def_5,type,
sK1: '$ki_world' ).
tff(func_def_6,type,
sK2: '$ki_world' ).
tff(func_def_7,type,
sK3: '$ki_world' ).
tff(func_def_8,type,
sK4: '$ki_world' ).
tff(func_def_9,type,
sK5: '$ki_world' ).
tff(func_def_10,type,
sK6: '$ki_world' ).
tff(func_def_11,type,
sK7: '$ki_world' ).
tff(func_def_12,type,
sK8: '$ki_world' ).
tff(pred_def_1,type,
'$ki_accessible': ( '$ki_index' * '$ki_world' * '$ki_world' ) > $o ).
tff(pred_def_2,type,
acid: '$ki_world' > $o ).
tff(f2,axiom,
( ! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(pour_a)','$ki_local_world',X0)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(pour_b)',X0,X1)
=> ~ acid(X1) ) )
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(make_c)','$ki_local_world',X0)
=> ~ acid(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pour_ab_make_axiom_2) ).
tff(f5,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(pour_a)','$ki_local_world',X0)
=> ~ acid(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pour_a_acid) ).
tff(f6,axiom,
? [X0: '$ki_world'] :
( '$ki_accessible'('#idx(make_c)','$ki_local_world',X0)
& acid(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',make_c_acid) ).
tff(f7,conjecture,
( ? [X0: '$ki_world'] :
( '$ki_accessible'('#idx(pour_a)','$ki_local_world',X0)
& ~ acid(X0) )
& ? [X0: '$ki_world'] :
( '$ki_accessible'('#idx(pour_a)','$ki_local_world',X0)
& ? [X1: '$ki_world'] :
( '$ki_accessible'('#idx(pour_b)',X0,X1)
& acid(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f8,negated_conjecture,
~ ( ? [X0: '$ki_world'] :
( '$ki_accessible'('#idx(pour_a)','$ki_local_world',X0)
& ~ acid(X0) )
& ? [X0: '$ki_world'] :
( '$ki_accessible'('#idx(pour_a)','$ki_local_world',X0)
& ? [X1: '$ki_world'] :
( '$ki_accessible'('#idx(pour_b)',X0,X1)
& acid(X1) ) ) ),
inference(negated_conjecture,[status(cth)],[f7]) ).
tff(f10,plain,
( ! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(pour_a)','$ki_local_world',X0)
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('#idx(pour_b)',X0,X1)
=> ~ acid(X1) ) )
=> ! [X2: '$ki_world'] :
( '$ki_accessible'('#idx(make_c)','$ki_local_world',X2)
=> ~ acid(X2) ) ),
inference(rectify,[],[f2]) ).
tff(f13,plain,
~ ( ? [X0: '$ki_world'] :
( '$ki_accessible'('#idx(pour_a)','$ki_local_world',X0)
& ~ acid(X0) )
& ? [X1: '$ki_world'] :
( '$ki_accessible'('#idx(pour_a)','$ki_local_world',X1)
& ? [X2: '$ki_world'] :
( '$ki_accessible'('#idx(pour_b)',X1,X2)
& acid(X2) ) ) ),
inference(rectify,[],[f8]) ).
tff(f15,plain,
( ! [X2: '$ki_world'] :
( ~ acid(X2)
| ~ '$ki_accessible'('#idx(make_c)','$ki_local_world',X2) )
| ? [X0: '$ki_world'] :
( ? [X1: '$ki_world'] :
( acid(X1)
& '$ki_accessible'('#idx(pour_b)',X0,X1) )
& '$ki_accessible'('#idx(pour_a)','$ki_local_world',X0) ) ),
inference(ennf_transformation,[],[f10]) ).
tff(f18,plain,
! [X0: '$ki_world'] :
( ~ acid(X0)
| ~ '$ki_accessible'('#idx(pour_a)','$ki_local_world',X0) ),
inference(ennf_transformation,[],[f5]) ).
tff(f19,plain,
( ! [X0: '$ki_world'] :
( ~ '$ki_accessible'('#idx(pour_a)','$ki_local_world',X0)
| acid(X0) )
| ! [X1: '$ki_world'] :
( ~ '$ki_accessible'('#idx(pour_a)','$ki_local_world',X1)
| ! [X2: '$ki_world'] :
( ~ '$ki_accessible'('#idx(pour_b)',X1,X2)
| ~ acid(X2) ) ) ),
inference(ennf_transformation,[],[f13]) ).
tff(f22,plain,
( ! [X0: '$ki_world'] :
( ~ acid(X0)
| ~ '$ki_accessible'('#idx(make_c)','$ki_local_world',X0) )
| ? [X1: '$ki_world'] :
( ? [X2: '$ki_world'] :
( acid(X2)
& '$ki_accessible'('#idx(pour_b)',X1,X2) )
& '$ki_accessible'('#idx(pour_a)','$ki_local_world',X1) ) ),
inference(rectify,[],[f15]) ).
tff(f23,plain,
( ! [X0: '$ki_world'] :
( ~ acid(X0)
| ~ '$ki_accessible'('#idx(make_c)','$ki_local_world',X0) )
| ( acid(sK3)
& '$ki_accessible'('#idx(pour_b)',sK2,sK3)
& '$ki_accessible'('#idx(pour_a)','$ki_local_world',sK2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X1,sK2),skolemize(X2,sK3)],[f22]) ).
tff(f28,plain,
( '$ki_accessible'('#idx(make_c)','$ki_local_world',sK8)
& acid(sK8) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X0,sK8)],[f6]) ).
tff(f32,plain,
! [X0: '$ki_world'] :
( ~ acid(X0)
| ~ '$ki_accessible'('#idx(make_c)','$ki_local_world',X0)
| '$ki_accessible'('#idx(pour_a)','$ki_local_world',sK2) ),
inference(cnf_transformation,[],[f23]) ).
tff(f33,plain,
! [X0: '$ki_world'] :
( ~ acid(X0)
| ~ '$ki_accessible'('#idx(make_c)','$ki_local_world',X0)
| '$ki_accessible'('#idx(pour_b)',sK2,sK3) ),
inference(cnf_transformation,[],[f23]) ).
tff(f34,plain,
! [X0: '$ki_world'] :
( ~ acid(X0)
| ~ '$ki_accessible'('#idx(make_c)','$ki_local_world',X0)
| acid(sK3) ),
inference(cnf_transformation,[],[f23]) ).
tff(f41,plain,
! [X0: '$ki_world'] :
( ~ acid(X0)
| ~ '$ki_accessible'('#idx(pour_a)','$ki_local_world',X0) ),
inference(cnf_transformation,[],[f18]) ).
tff(f42,plain,
acid(sK8),
inference(cnf_transformation,[],[f28]) ).
tff(f43,plain,
'$ki_accessible'('#idx(make_c)','$ki_local_world',sK8),
inference(cnf_transformation,[],[f28]) ).
tff(f44,plain,
! [X2: '$ki_world',X0: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'('#idx(pour_a)','$ki_local_world',X0)
| acid(X0)
| ~ '$ki_accessible'('#idx(pour_a)','$ki_local_world',X1)
| ~ '$ki_accessible'('#idx(pour_b)',X1,X2)
| ~ acid(X2) ),
inference(cnf_transformation,[],[f19]) ).
tff(f46,definition,
( spl9_1
<=> ! [X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'('#idx(pour_a)','$ki_local_world',X1)
| ~ acid(X2)
| ~ '$ki_accessible'('#idx(pour_b)',X1,X2) ) ),
introduced(definition,[new_symbols(definition,[spl9_1])],[avatar_definition]) ).
tff(f47,plain,
( ! [X2: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'('#idx(pour_a)','$ki_local_world',X1)
| ~ acid(X2)
| ~ '$ki_accessible'('#idx(pour_b)',X1,X2) )
| ~ spl9_1 ),
inference(avatar_component_clause,[],[f46]) ).
tff(f49,definition,
( spl9_2
<=> ! [X0: '$ki_world'] :
( ~ '$ki_accessible'('#idx(pour_a)','$ki_local_world',X0)
| acid(X0) ) ),
introduced(definition,[new_symbols(definition,[spl9_2])],[avatar_definition]) ).
tff(f50,plain,
( ! [X0: '$ki_world'] :
( acid(X0)
| ~ '$ki_accessible'('#idx(pour_a)','$ki_local_world',X0) )
| ~ spl9_2 ),
inference(avatar_component_clause,[],[f49]) ).
tff(f51,plain,
( spl9_1
| spl9_2 ),
inference(avatar_split_clause,[],[f44,f49,f46]) ).
tff(f57,definition,
( spl9_4
<=> ! [X0: '$ki_world'] :
( ~ acid(X0)
| ~ '$ki_accessible'('#idx(make_c)','$ki_local_world',X0) ) ),
introduced(definition,[new_symbols(definition,[spl9_4])],[avatar_definition]) ).
tff(f58,plain,
( ! [X0: '$ki_world'] :
( ~ '$ki_accessible'('#idx(make_c)','$ki_local_world',X0)
| ~ acid(X0) )
| ~ spl9_4 ),
inference(avatar_component_clause,[],[f57]) ).
tff(f89,definition,
( spl9_11
<=> '$ki_accessible'('#idx(pour_a)','$ki_local_world',sK2) ),
introduced(definition,[new_symbols(definition,[spl9_11])],[avatar_definition]) ).
tff(f91,plain,
( '$ki_accessible'('#idx(pour_a)','$ki_local_world',sK2)
| ~ spl9_11 ),
inference(avatar_component_clause,[],[f89]) ).
tff(f92,plain,
( spl9_11
| spl9_4 ),
inference(avatar_split_clause,[],[f32,f57,f89]) ).
tff(f94,definition,
( spl9_12
<=> '$ki_accessible'('#idx(pour_b)',sK2,sK3) ),
introduced(definition,[new_symbols(definition,[spl9_12])],[avatar_definition]) ).
tff(f96,plain,
( '$ki_accessible'('#idx(pour_b)',sK2,sK3)
| ~ spl9_12 ),
inference(avatar_component_clause,[],[f94]) ).
tff(f97,plain,
( spl9_12
| spl9_4 ),
inference(avatar_split_clause,[],[f33,f57,f94]) ).
tff(f99,definition,
( spl9_13
<=> acid(sK3) ),
introduced(definition,[new_symbols(definition,[spl9_13])],[avatar_definition]) ).
tff(f101,plain,
( acid(sK3)
| ~ spl9_13 ),
inference(avatar_component_clause,[],[f99]) ).
tff(f102,plain,
( spl9_13
| spl9_4 ),
inference(avatar_split_clause,[],[f34,f57,f99]) ).
tff(f118,plain,
( ! [X0: '$ki_world'] : ~ '$ki_accessible'('#idx(pour_a)','$ki_local_world',X0)
| ~ spl9_2 ),
inference(forward_subsumption_resolution,[],[f41,f50]) ).
tff(f119,plain,
( ~ acid(sK8)
| ~ spl9_4 ),
inference(resolution,[],[f58,f43]) ).
tff(f120,plain,
( $false
| ~ spl9_4 ),
inference(forward_subsumption_resolution,[],[f119,f42]) ).
tff(f121,plain,
~ spl9_4,
inference(avatar_contradiction_clause,[],[f120]) ).
tff(f122,plain,
( $false
| ~ spl9_2
| ~ spl9_11 ),
inference(forward_subsumption_resolution,[],[f91,f118]) ).
tff(f123,plain,
( ~ spl9_2
| ~ spl9_11 ),
inference(avatar_contradiction_clause,[],[f122]) ).
tff(f124,plain,
( ! [X0: '$ki_world'] :
( ~ '$ki_accessible'('#idx(pour_b)',sK2,X0)
| ~ acid(X0) )
| ~ spl9_1
| ~ spl9_11 ),
inference(resolution,[],[f91,f47]) ).
tff(f125,plain,
( ~ acid(sK3)
| ~ spl9_1
| ~ spl9_11
| ~ spl9_12 ),
inference(resolution,[],[f96,f124]) ).
tff(f126,plain,
( $false
| ~ spl9_1
| ~ spl9_11
| ~ spl9_12
| ~ spl9_13 ),
inference(forward_subsumption_resolution,[],[f125,f101]) ).
tff(f127,plain,
( ~ spl9_1
| ~ spl9_11
| ~ spl9_12
| ~ spl9_13 ),
inference(avatar_contradiction_clause,[],[f126]) ).
cnf(s1,plain,
( spl9_1
| spl9_2 ),
inference(sat_conversion,[],[f51]) ).
cnf(s8,plain,
( spl9_4
| spl9_11 ),
inference(sat_conversion,[],[f92]) ).
cnf(s9,plain,
( spl9_4
| spl9_12 ),
inference(sat_conversion,[],[f97]) ).
cnf(s10,plain,
( spl9_4
| spl9_13 ),
inference(sat_conversion,[],[f102]) ).
cnf(s14,plain,
~ spl9_4,
inference(sat_conversion,[],[f121]) ).
cnf(s15,plain,
( ~ spl9_2
| ~ spl9_11 ),
inference(sat_conversion,[],[f123]) ).
cnf(s16,plain,
( ~ spl9_1
| ~ spl9_11
| ~ spl9_12
| ~ spl9_13 ),
inference(sat_conversion,[],[f127]) ).
cnf(s17,plain,
spl9_13,
inference(rat,[],[s10,s14]) ).
cnf(s18,plain,
spl9_12,
inference(rat,[],[s9,s14]) ).
cnf(s19,plain,
spl9_11,
inference(rat,[],[s8,s14]) ).
cnf(s20,plain,
~ spl9_1,
inference(rat,[],[s16,s17,s18,s19]) ).
cnf(s21,plain,
~ spl9_2,
inference(rat,[],[s15,s19]) ).
cnf(s25,plain,
$false,
inference(rat,[],[s1,s21,s20]) ).
tff(f128,plain,
$false,
inference(avatar_sat_refutation,[],[s25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ149_13 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n016.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 22:51:18 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.97/1.24 % (3068024)Detected formulas, will run a generic FOF schedule.
% 2.97/1.24 % (3068103)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2293203218:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.97/1.24 % (3068102)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2065661093:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.97/1.24 % (3068106)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1239712382:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.97/1.24 % (3068101)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3959114590:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.97/1.24 % (3068106)First to succeed.
% 2.97/1.24 % (3068106)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3068024"
% 2.97/1.24 % (3068105)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3602499699:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.97/1.24 % (3068107)dis-21_1_sil=8000:lcm=predicate:random_seed=882798473:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.97/1.24 % (3068104)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3533643043:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.97/1.24 % (3068104)Refutation not found, incomplete strategy
% 2.97/1.24 % (3068104)------------------------------
% 2.97/1.24 % (3068104)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.97/1.24 % (3068104)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.97/1.24 % (3068104)CaDiCaL version: 2.1.3
% 2.97/1.24 % (3068104)Termination reason: Refutation not found, incomplete strategy
% 2.97/1.24 % (3068104)Time elapsed: 0.001 s
% 2.97/1.24 % (3068104)Peak memory usage: 87 MB
% 2.97/1.24 % (3068105)Also succeeded, but the first one will report.
% 2.97/1.24 % (3068107)Also succeeded, but the first one will report.
% 2.97/1.24 % (3068104)------------------------------
% 2.97/1.24 % (3068104)------------------------------
% 2.97/1.24 % (3068106)Refutation found. Thanks to Tanya!
% 2.97/1.24 % SZS status Theorem for theBenchmark
% 2.97/1.24 % SZS output start Proof for theBenchmark
% See solution above
% 3.39/1.33 % (3068106)------------------------------
% 3.39/1.33 % (3068106)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.39/1.33 % (3068106)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.39/1.33 % (3068106)CaDiCaL version: 2.1.3
% 3.39/1.33 % (3068106)Termination reason: Refutation
% 3.39/1.33 % (3068106)Time elapsed: 0.003 s
% 3.39/1.33 % (3068106)Peak memory usage: 89 MB
% 3.39/1.33 % (3068106)Instructions burned: 2 (million)
% 3.39/1.33 % (3068106)------------------------------
% 3.39/1.33 % (3068106)------------------------------
% 3.39/1.33 % (3068024)Success in time 0.403 s
% 3.39/1.33 % Vampire exiting
%------------------------------------------------------------------------------