0.00/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.12 % Command : run_vampire %s %d 0.11/0.32 % Computer : n024.cluster.edu 0.11/0.32 % Model : x86_64 x86_64 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 % Memory : 8042.1875MB 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.32 % CPULimit : 960 0.11/0.32 % WCLimit : 120 0.11/0.32 % DateTime : Thu Jul 2 07:00:11 EDT 2020 0.11/0.32 % CPUTime : 0.18/0.39 % (25139)lrs+1_1024_av=off:bs=on:fde=none:inw=on:irw=on:nm=64:nwc=1.2:stl=60:sp=reverse_arity:tha=off:urr=on:updr=off:uhcvi=on_595 on theBenchmark 0.18/0.39 % (25140)dis+1002_8:1_awrs=converge:awrsf=256:anc=all_dependent:br=off:fsr=off:fde=none:gs=on:gsaa=from_current:gsem=on:irw=on:nm=64:nwc=1:sas=z3:s2a=on:sp=frequency:thf=on:uwa=interpreted_only:urr=on_229 on theBenchmark 0.18/0.39 % (25138)lrs+10_2_add=off:afr=on:afp=4000:afq=2.0:amm=off:anc=none:cond=fast:fsr=off:fde=unused:gs=on:gsaa=full_model:gsem=on:inw=on:nm=64:nwc=1:sas=z3:stl=30:sos=all:sp=occurrence:tha=off:thf=on:urr=on:updr=off:uhcvi=on_2 on theBenchmark 0.18/0.43 % (25143)dis+11_3_afr=on:afp=4000:afq=1.4:amm=off:anc=none:bd=preordered:bce=on:fsr=off:fde=none:gs=on:gsem=on:irw=on:lma=on:nm=6:nwc=1:sd=10:ss=axioms:st=5.0:sac=on:sp=occurrence:tha=off:urr=ec_only_85 on theBenchmark 0.18/0.43 % (25141)dis+10_10_add=large:afp=4000:afq=1.1:amm=sco:anc=none:irw=on:lcm=reverse:lma=on:nm=6:nwc=1:sos=all:sac=on:sp=reverse_arity:urr=on_30 on theBenchmark 0.18/0.43 % (25136)dis+10_1_add=off:afp=40000:afq=1.1:amm=off:anc=none:cond=on:fsr=off:irw=on:nm=64:nwc=1:sas=z3:sac=on_2 on theBenchmark 0.18/0.43 % (25142)ott-2_64_add=large:afr=on:afp=4000:afq=1.1:amm=sco:anc=none:bd=off:bs=unit_only:bsr=on:bce=on:cond=on:fde=none:gs=on:gsem=on:newcnf=on:nwc=1:sac=on:sp=occurrence:thf=on:updr=off:uhcvi=on_154 on theBenchmark 0.18/0.44 % (25133)ott+1010_2:1_awrs=decay:awrsf=512:acc=on:add=off:afr=on:afp=100000:afq=1.1:amm=off:anc=none:bd=off:ccuc=first:fsr=off:fde=unused:gsp=input_only:gs=on:gsaa=from_current:irw=on:nm=32:newcnf=on:nwc=1:sos=theory:sp=occurrence:tha=some:uwa=interpreted_only:updr=off_8 on theBenchmark 0.18/0.44 % (25134)lrs+1010_4:1_aac=none:add=off:afp=40000:afq=1.0:amm=sco:anc=none:bd=off:cond=on:gs=on:gsem=on:irw=on:nm=0:nwc=2.5:sas=z3:stl=30:sos=theory:sp=reverse_arity:updr=off_2 on theBenchmark 0.18/0.44 % (25135)dis+10_5_add=off:afp=4000:afq=1.1:anc=none:cond=fast:ep=RSTC:fsr=off:gs=on:gsem=on:lwlo=on:nm=64:nwc=1:sp=reverse_arity:thi=all_3 on theBenchmark 0.18/0.44 % (25137)dis+11_3_add=off:afp=10000:afq=2.0:amm=sco:anc=none:ep=RST:gs=on:gsaa=from_current:gsem=on:inw=on:nm=64:nwc=1:sd=10:ss=axioms:st=5.0:sos=all:tha=off:updr=off:uhcvi=on_59 on theBenchmark 0.18/0.45 % (25132)dis+11_4_afp=100000:afq=1.1:anc=none:cond=on:gs=on:gsaa=full_model:nm=64:nwc=1:sac=on:sp=reverse_arity:thi=all_2 on theBenchmark 0.18/0.46 % (25133)Refutation found. Thanks to Tanya! 0.18/0.46 % SZS status Theorem for theBenchmark 0.18/0.46 % SZS output start Proof for theBenchmark 0.18/0.46 tff(type_def_5, type, 'Tree': $tType). 0.18/0.46 tff(func_def_0, type, 'empty:Tree': 'Tree'). 0.18/0.46 tff(func_def_1, type, 'left:(Tree)>Tree': 'Tree' > 'Tree'). 0.18/0.46 tff(func_def_2, type, 'val:(Tree)>Int': 'Tree' > $int). 0.18/0.46 tff(func_def_3, type, 'node:(Int*Tree*Tree)>Tree': ($int * 'Tree' * 'Tree') > 'Tree'). 0.18/0.46 tff(func_def_4, type, 'right:(Tree)>Tree': 'Tree' > 'Tree'). 0.18/0.46 tff(func_def_9, type, sK0: 'Tree'). 0.18/0.46 tff(func_def_10, type, sK1: $int). 0.18/0.46 tff(func_def_11, type, sK2: 'Tree'). 0.18/0.46 tff(func_def_12, type, sK3: 'Tree'). 0.18/0.46 tff(func_def_13, type, sK4: 'Tree' > $int). 0.18/0.46 tff(func_def_14, type, sK5: 'Tree' > $int). 0.18/0.46 tff(pred_def_1, type, searchtree: 'Tree' > $o). 0.18/0.46 tff(pred_def_2, type, in: ($int * 'Tree') > $o). 0.18/0.46 tff(f300,plain,( 0.18/0.46 $false), 0.18/0.46 inference(avatar_sat_refutation,[],[f92,f111,f117,f123,f136,f142,f144,f246,f249,f259,f260,f268,f288,f290,f292,f295,f297,f299])). 0.18/0.46 tff(f299,plain,( 0.18/0.46 sK2 != 'left:(Tree)>Tree'(sK0) | in(sK1,'left:(Tree)>Tree'(sK0)) | ~in(sK1,sK2)), 0.18/0.46 introduced(theory_tautology_sat_conflict,[])). 0.18/0.46 tff(f297,plain,( 0.18/0.46 spl6_4 | ~spl6_7), 0.18/0.46 inference(avatar_split_clause,[],[f296,f107,f94])). 0.18/0.46 tff(f94,plain,( 0.18/0.46 spl6_4 <=> in(sK1,sK0)), 0.18/0.46 introduced(avatar_definition,[new_symbols(naming,[spl6_4])])). 0.18/0.46 tff(f107,plain,( 0.18/0.46 spl6_7 <=> in(sK1,'left:(Tree)>Tree'(sK0))), 0.18/0.46 introduced(avatar_definition,[new_symbols(naming,[spl6_7])])). 0.18/0.46 tff(f296,plain,( 0.18/0.46 in(sK1,sK0) | ~spl6_7), 0.18/0.46 inference(global_subsumption,[],[f42,f253])). 0.18/0.46 tff(f253,plain,( 0.18/0.46 'empty:Tree' = sK0 | in(sK1,sK0) | ~spl6_7), 0.18/0.46 inference(resolution,[],[f108,f61])). 0.18/0.46 tff(f61,plain,( 0.18/0.46 ( ! [X0:$int,X1:'Tree'] : (~in(X0,'left:(Tree)>Tree'(X1)) | 'empty:Tree' = X1 | in(X0,X1)) )), 0.18/0.46 inference(cnf_transformation,[],[f30])). 0.18/0.46 tff(f30,plain,( 0.18/0.46 ! [X0 : $int,X1 : 'Tree'] : (in(X0,X1) <=> (($false | 'empty:Tree' != X1) & ('val:(Tree)>Int'(X1) = X0 | in(X0,'right:(Tree)>Tree'(X1)) | in(X0,'left:(Tree)>Tree'(X1)) | 'empty:Tree' = X1)))), 0.18/0.46 inference(flattening,[],[f29])). 0.18/0.46 tff(f29,plain,( 0.18/0.46 ! [X0 : $int,X1 : 'Tree'] : (in(X0,X1) <=> (($false | 'empty:Tree' != X1) & (('val:(Tree)>Int'(X1) = X0 | in(X0,'right:(Tree)>Tree'(X1)) | in(X0,'left:(Tree)>Tree'(X1))) | 'empty:Tree' = X1)))), 0.18/0.46 inference(ennf_transformation,[],[f26])). 0.18/0.46 tff(f26,plain,( 0.18/0.46 ! [X0 : $int,X1 : 'Tree'] : (in(X0,X1) <=> (('empty:Tree' = X1 => $false) & ('empty:Tree' != X1 => ('val:(Tree)>Int'(X1) = X0 | in(X0,'right:(Tree)>Tree'(X1)) | in(X0,'left:(Tree)>Tree'(X1))))))), 0.18/0.46 inference(rectify,[],[f4])). 0.18/0.46 tff(f4,axiom,( 0.18/0.46 ! [X4 : $int,X3 : 'Tree'] : (in(X4,X3) <=> (('empty:Tree' = X3 => $false) & ('empty:Tree' != X3 => ('val:(Tree)>Int'(X3) = X4 | in(X4,'right:(Tree)>Tree'(X3)) | in(X4,'left:(Tree)>Tree'(X3))))))), 0.18/0.46 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_005)). 0.18/0.46 tff(f108,plain,( 0.18/0.46 in(sK1,'left:(Tree)>Tree'(sK0)) | ~spl6_7), 0.18/0.46 inference(avatar_component_clause,[],[f107])). 0.18/0.46 tff(f42,plain,( 0.18/0.46 'empty:Tree' != sK0 | in(sK1,sK0)), 0.18/0.46 inference(cnf_transformation,[],[f27])). 0.18/0.46 tff(f27,plain,( 0.18/0.46 ? [X0 : 'Tree',X1 : $int] : ((in(X1,X0) <~> ((((((? [X2 : 'Tree'] : ('right:(Tree)>Tree'(X0) = X2 & in(X1,X2)) | $less(X1,'val:(Tree)>Int'(X0))) & (? [X3 : 'Tree'] : (in(X1,X3) & 'left:(Tree)>Tree'(X0) = X3) | ~$less(X1,'val:(Tree)>Int'(X0)))) | 'val:(Tree)>Int'(X0) = X1) & ($true | 'val:(Tree)>Int'(X0) != X1)) | 'empty:Tree' = X0) & ($false | 'empty:Tree' != X0))) & searchtree(X0))), 0.18/0.46 inference(ennf_transformation,[],[f23])). 0.18/0.46 tff(f23,plain,( 0.18/0.46 ~! [X0 : 'Tree',X1 : $int] : (searchtree(X0) => (in(X1,X0) <=> (('empty:Tree' != X0 => (('val:(Tree)>Int'(X0) != X1 => ((~$less(X1,'val:(Tree)>Int'(X0)) => ? [X2 : 'Tree'] : ('right:(Tree)>Tree'(X0) = X2 & in(X1,X2))) & ($less(X1,'val:(Tree)>Int'(X0)) => ? [X3 : 'Tree'] : (in(X1,X3) & 'left:(Tree)>Tree'(X0) = X3)))) & ('val:(Tree)>Int'(X0) = X1 => $true))) & ('empty:Tree' = X0 => $false))))), 0.18/0.46 inference(rectify,[],[f7])). 0.18/0.46 tff(f7,negated_conjecture,( 0.18/0.46 ~! [X3 : 'Tree',X4 : $int] : (searchtree(X3) => (in(X4,X3) <=> (('empty:Tree' != X3 => (('val:(Tree)>Int'(X3) != X4 => ((~$less(X4,'val:(Tree)>Int'(X3)) => ? [X6 : 'Tree'] : ('right:(Tree)>Tree'(X3) = X6 & in(X4,X6))) & ($less(X4,'val:(Tree)>Int'(X3)) => ? [X5 : 'Tree'] : (in(X4,X5) & 'left:(Tree)>Tree'(X3) = X5)))) & ('val:(Tree)>Int'(X3) = X4 => $true))) & ('empty:Tree' = X3 => $false))))), 0.18/0.46 inference(negated_conjecture,[],[f6])). 0.18/0.46 tff(f6,conjecture,( 0.18/0.46 ! [X3 : 'Tree',X4 : $int] : (searchtree(X3) => (in(X4,X3) <=> (('empty:Tree' != X3 => (('val:(Tree)>Int'(X3) != X4 => ((~$less(X4,'val:(Tree)>Int'(X3)) => ? [X6 : 'Tree'] : ('right:(Tree)>Tree'(X3) = X6 & in(X4,X6))) & ($less(X4,'val:(Tree)>Int'(X3)) => ? [X5 : 'Tree'] : (in(X4,X5) & 'left:(Tree)>Tree'(X3) = X5)))) & ('val:(Tree)>Int'(X3) = X4 => $true))) & ('empty:Tree' = X3 => $false))))), 0.18/0.46 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_007)). 0.18/0.46 tff(f295,plain,( 0.18/0.46 ~spl6_4 | spl6_5 | spl6_3 | spl6_7 | spl6_10), 0.18/0.46 inference(avatar_split_clause,[],[f234,f125,f107,f89,f98,f94])). 0.18/0.46 % (25144)ott-11_3_add=large:afp=100000:afq=1.2:anc=none:bs=on:cond=fast:fde=none:gs=on:gsem=off:lma=on:lwlo=on:nm=64:newcnf=on:nwc=1:sos=all:sp=occurrence:tha=off:urr=on:uhcvi=on_268 on theBenchmark 0.18/0.46 tff(f98,plain,( 0.18/0.46 spl6_5 <=> sK1 = 'val:(Tree)>Int'(sK0)), 0.18/0.46 introduced(avatar_definition,[new_symbols(naming,[spl6_5])])). 0.18/0.46 tff(f89,plain,( 0.18/0.46 spl6_3 <=> 'empty:Tree' = sK0), 0.18/0.46 introduced(avatar_definition,[new_symbols(naming,[spl6_3])])). 0.18/0.46 tff(f125,plain,( 0.18/0.46 spl6_10 <=> in(sK1,'right:(Tree)>Tree'(sK0))), 0.18/0.46 introduced(avatar_definition,[new_symbols(naming,[spl6_10])])). 0.18/0.46 tff(f234,plain,( 0.18/0.46 in(sK1,'left:(Tree)>Tree'(sK0)) | 'empty:Tree' = sK0 | sK1 = 'val:(Tree)>Int'(sK0) | ~in(sK1,sK0) | spl6_10), 0.18/0.46 inference(resolution,[],[f62,f127])). 0.18/0.46 tff(f127,plain,( 0.18/0.46 ~in(sK1,'right:(Tree)>Tree'(sK0)) | spl6_10), 0.18/0.46 inference(avatar_component_clause,[],[f125])). 0.18/0.46 tff(f62,plain,( 0.18/0.46 ( ! [X0:$int,X1:'Tree'] : (in(X0,'right:(Tree)>Tree'(X1)) | in(X0,'left:(Tree)>Tree'(X1)) | 'empty:Tree' = X1 | 'val:(Tree)>Int'(X1) = X0 | ~in(X0,X1)) )), 0.18/0.46 inference(cnf_transformation,[],[f30])). 0.18/0.46 tff(f292,plain,( 0.18/0.46 ~spl6_14 | ~spl6_6), 0.18/0.46 inference(avatar_split_clause,[],[f175,f103,f154])). 0.18/0.46 tff(f154,plain,( 0.18/0.46 spl6_14 <=> $less('val:(Tree)>Int'(sK0),sK1)), 0.18/0.46 introduced(avatar_definition,[new_symbols(naming,[spl6_14])])). 0.18/0.46 tff(f103,plain,( 0.18/0.46 spl6_6 <=> $less(sK1,'val:(Tree)>Int'(sK0))), 0.18/0.46 introduced(avatar_definition,[new_symbols(naming,[spl6_6])])). 0.18/0.46 tff(f175,plain,( 0.18/0.46 ~$less('val:(Tree)>Int'(sK0),sK1) | ~spl6_6), 0.18/0.46 inference(resolution,[],[f159,f16])). 0.18/0.46 tff(f16,plain,( 0.18/0.46 ( ! [X0:$int] : (~$less(X0,X0)) )), 0.18/0.46 introduced(theory_axiom,[])). 0.18/0.46 tff(f159,plain,( 0.18/0.46 ( ! [X0:$int] : ($less(X0,'val:(Tree)>Int'(sK0)) | ~$less(X0,sK1)) ) | ~spl6_6), 0.18/0.46 inference(resolution,[],[f104,f17])). 0.18/0.46 tff(f17,plain,( 0.18/0.46 ( ! [X2:$int,X0:$int,X1:$int] : (~$less(X0,X1) | ~$less(X1,X2) | $less(X0,X2)) )), 0.18/0.46 introduced(theory_axiom,[])). 0.18/0.46 tff(f104,plain,( 0.18/0.46 $less(sK1,'val:(Tree)>Int'(sK0)) | ~spl6_6), 0.18/0.46 inference(avatar_component_clause,[],[f103])). 0.18/0.46 tff(f290,plain,( 0.18/0.46 spl6_4 | ~spl6_10), 0.18/0.46 inference(avatar_split_clause,[],[f289,f125,f94])). 0.18/0.46 tff(f289,plain,( 0.18/0.46 in(sK1,sK0) | ~spl6_10), 0.18/0.46 inference(global_subsumption,[],[f42,f244])). 0.18/0.46 tff(f244,plain,( 0.18/0.46 'empty:Tree' = sK0 | in(sK1,sK0) | ~spl6_10), 0.18/0.46 inference(resolution,[],[f126,f60])). 0.18/0.46 tff(f60,plain,( 0.18/0.46 ( ! [X0:$int,X1:'Tree'] : (~in(X0,'right:(Tree)>Tree'(X1)) | 'empty:Tree' = X1 | in(X0,X1)) )), 0.18/0.46 inference(cnf_transformation,[],[f30])). 0.18/0.46 tff(f126,plain,( 0.18/0.46 in(sK1,'right:(Tree)>Tree'(sK0)) | ~spl6_10), 0.18/0.46 inference(avatar_component_clause,[],[f125])). 0.18/0.46 tff(f288,plain,( 0.18/0.46 spl6_3 | ~spl6_5), 0.18/0.46 inference(avatar_split_clause,[],[f287,f98,f89])). 0.18/0.46 tff(f287,plain,( 0.18/0.46 'empty:Tree' = sK0 | ~spl6_5), 0.18/0.46 inference(global_subsumption,[],[f41,f99,f275])). 0.18/0.46 tff(f275,plain,( 0.18/0.46 in(sK1,sK0) | 'empty:Tree' = sK0 | ~spl6_5), 0.18/0.46 inference(superposition,[],[f76,f99])). 0.18/0.46 tff(f76,plain,( 0.18/0.46 ( ! [X1:'Tree'] : (in('val:(Tree)>Int'(X1),X1) | 'empty:Tree' = X1) )), 0.18/0.46 inference(equality_resolution,[],[f59])). 0.18/0.46 tff(f59,plain,( 0.18/0.46 ( ! [X0:$int,X1:'Tree'] : ('val:(Tree)>Int'(X1) != X0 | 'empty:Tree' = X1 | in(X0,X1)) )), 0.18/0.46 inference(cnf_transformation,[],[f30])). 0.18/0.46 tff(f99,plain,( 0.18/0.46 sK1 = 'val:(Tree)>Int'(sK0) | ~spl6_5), 0.18/0.46 inference(avatar_component_clause,[],[f98])). 0.18/0.46 tff(f41,plain,( 0.18/0.46 'empty:Tree' = sK0 | sK1 != 'val:(Tree)>Int'(sK0) | ~in(sK1,sK0)), 0.18/0.46 inference(cnf_transformation,[],[f27])). 0.18/0.46 tff(f268,plain,( 0.18/0.46 spl6_5 | spl6_6 | spl6_14), 0.18/0.46 inference(avatar_split_clause,[],[f162,f154,f103,f98])). 0.18/0.46 tff(f162,plain,( 0.18/0.46 $less(sK1,'val:(Tree)>Int'(sK0)) | sK1 = 'val:(Tree)>Int'(sK0) | spl6_14), 0.18/0.46 inference(resolution,[],[f155,f18])). 0.18/0.46 tff(f18,plain,( 0.18/0.46 ( ! [X0:$int,X1:$int] : ($less(X0,X1) | $less(X1,X0) | X0 = X1) )), 0.18/0.46 introduced(theory_axiom,[])). 0.18/0.46 tff(f155,plain,( 0.18/0.46 ~$less('val:(Tree)>Int'(sK0),sK1) | spl6_14), 0.18/0.46 inference(avatar_component_clause,[],[f154])). 0.18/0.46 tff(f260,plain,( 0.18/0.46 sK3 != 'right:(Tree)>Tree'(sK0) | ~in(sK1,sK3) | in(sK1,'right:(Tree)>Tree'(sK0))), 0.18/0.46 introduced(theory_tautology_sat_conflict,[])). 0.18/0.46 tff(f259,plain,( 0.18/0.46 spl6_3 | ~spl6_7 | ~spl6_14), 0.18/0.46 inference(avatar_split_clause,[],[f258,f154,f107,f89])). 0.18/0.46 tff(f258,plain,( 0.18/0.46 ~in(sK1,'left:(Tree)>Tree'(sK0)) | 'empty:Tree' = sK0 | ~spl6_14), 0.18/0.46 inference(global_subsumption,[],[f43,f255])). 0.18/0.46 tff(f255,plain,( 0.18/0.46 'empty:Tree' = sK0 | ~in(sK1,'left:(Tree)>Tree'(sK0)) | ~searchtree(sK0) | ~spl6_14), 0.18/0.46 inference(resolution,[],[f156,f45])). 0.18/0.46 tff(f45,plain,( 0.18/0.46 ( ! [X0:'Tree',X1:$int] : (~$less('val:(Tree)>Int'(X0),X1) | 'empty:Tree' = X0 | ~in(X1,'left:(Tree)>Tree'(X0)) | ~searchtree(X0)) )), 0.18/0.46 inference(cnf_transformation,[],[f28])). 0.18/0.46 tff(f28,plain,( 0.18/0.46 ! [X0 : 'Tree'] : ((($true | 'empty:Tree' != X0) & ((searchtree('left:(Tree)>Tree'(X0)) & searchtree('right:(Tree)>Tree'(X0)) & ! [X1 : $int] : (~$less('val:(Tree)>Int'(X0),X1) | ~in(X1,'left:(Tree)>Tree'(X0))) & ! [X2 : $int] : ($less('val:(Tree)>Int'(X0),X2) | ~in(X2,'right:(Tree)>Tree'(X0)))) | 'empty:Tree' = X0)) <=> searchtree(X0))), 0.18/0.46 inference(ennf_transformation,[],[f25])). 0.18/0.46 tff(f25,plain,( 0.18/0.46 ! [X0 : 'Tree'] : ((('empty:Tree' = X0 => $true) & ('empty:Tree' != X0 => (searchtree('left:(Tree)>Tree'(X0)) & searchtree('right:(Tree)>Tree'(X0)) & ! [X1 : $int] : (in(X1,'left:(Tree)>Tree'(X0)) => ~$less('val:(Tree)>Int'(X0),X1)) & ! [X2 : $int] : (in(X2,'right:(Tree)>Tree'(X0)) => $less('val:(Tree)>Int'(X0),X2))))) <=> searchtree(X0))), 0.18/0.46 inference(rectify,[],[f10])). 0.18/0.46 tff(f10,plain,( 0.18/0.46 ! [X3 : 'Tree'] : ((('empty:Tree' = X3 => $true) & ('empty:Tree' != X3 => (searchtree('left:(Tree)>Tree'(X3)) & searchtree('right:(Tree)>Tree'(X3)) & ! [X4 : $int] : (in(X4,'left:(Tree)>Tree'(X3)) => ~$less('val:(Tree)>Int'(X3),X4)) & ! [X4 : $int] : (in(X4,'right:(Tree)>Tree'(X3)) => $less('val:(Tree)>Int'(X3),X4))))) <=> searchtree(X3))), 0.18/0.46 inference(theory_normalization,[],[f2])). 0.18/0.46 tff(f2,axiom,( 0.18/0.46 ! [X3 : 'Tree'] : ((('empty:Tree' = X3 => $true) & ('empty:Tree' != X3 => (searchtree('left:(Tree)>Tree'(X3)) & searchtree('right:(Tree)>Tree'(X3)) & ! [X4 : $int] : (in(X4,'left:(Tree)>Tree'(X3)) => $lesseq(X4,'val:(Tree)>Int'(X3))) & ! [X4 : $int] : (in(X4,'right:(Tree)>Tree'(X3)) => $greater(X4,'val:(Tree)>Int'(X3)))))) <=> searchtree(X3))), 0.18/0.46 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_006)). 0.18/0.46 tff(f156,plain,( 0.18/0.46 $less('val:(Tree)>Int'(sK0),sK1) | ~spl6_14), 0.18/0.46 inference(avatar_component_clause,[],[f154])). 0.18/0.46 tff(f43,plain,( 0.18/0.46 searchtree(sK0)), 0.18/0.46 inference(cnf_transformation,[],[f27])). 0.18/0.46 tff(f249,plain,( 0.18/0.46 ~spl6_2), 0.18/0.46 inference(avatar_contradiction_clause,[],[f248])). 0.18/0.46 tff(f248,plain,( 0.18/0.46 $false | ~spl6_2), 0.18/0.46 inference(resolution,[],[f87,f77])). 0.18/0.46 tff(f77,plain,( 0.18/0.46 ( ! [X0:$int] : (~in(X0,'empty:Tree')) )), 0.18/0.46 inference(equality_resolution,[],[f58])). 0.18/0.46 tff(f58,plain,( 0.18/0.46 ( ! [X0:$int,X1:'Tree'] : ('empty:Tree' != X1 | ~in(X0,X1)) )), 0.18/0.46 inference(cnf_transformation,[],[f30])). 0.18/0.46 tff(f87,plain,( 0.18/0.46 in(sK1,'empty:Tree') | ~spl6_2), 0.18/0.46 inference(avatar_component_clause,[],[f85])). 0.18/0.46 tff(f85,plain,( 0.18/0.46 spl6_2 <=> in(sK1,'empty:Tree')), 0.18/0.46 introduced(avatar_definition,[new_symbols(naming,[spl6_2])])). 0.18/0.46 tff(f246,plain,( 0.18/0.46 spl6_3 | spl6_14 | ~spl6_10), 0.18/0.46 inference(avatar_split_clause,[],[f245,f125,f154,f89])). 0.18/0.46 tff(f245,plain,( 0.18/0.46 $less('val:(Tree)>Int'(sK0),sK1) | 'empty:Tree' = sK0 | ~spl6_10), 0.18/0.46 inference(global_subsumption,[],[f43,f243])). 0.18/0.46 tff(f243,plain,( 0.18/0.46 'empty:Tree' = sK0 | ~searchtree(sK0) | $less('val:(Tree)>Int'(sK0),sK1) | ~spl6_10), 0.18/0.46 inference(resolution,[],[f126,f54])). 0.18/0.46 tff(f54,plain,( 0.18/0.46 ( ! [X2:$int,X0:'Tree'] : (~in(X2,'right:(Tree)>Tree'(X0)) | 'empty:Tree' = X0 | ~searchtree(X0) | $less('val:(Tree)>Int'(X0),X2)) )), 0.18/0.46 inference(cnf_transformation,[],[f28])). 0.18/0.46 tff(f144,plain,( 0.18/0.46 ~spl6_4 | ~spl6_10 | spl6_6 | spl6_3), 0.18/0.46 inference(avatar_split_clause,[],[f74,f89,f103,f125,f94])). 0.18/0.46 tff(f74,plain,( 0.18/0.46 'empty:Tree' = sK0 | $less(sK1,'val:(Tree)>Int'(sK0)) | ~in(sK1,'right:(Tree)>Tree'(sK0)) | ~in(sK1,sK0)), 0.18/0.46 inference(equality_resolution,[],[f31])). 0.18/0.46 tff(f31,plain,( 0.18/0.46 ( ! [X2:'Tree'] : ('empty:Tree' = sK0 | $less(sK1,'val:(Tree)>Int'(sK0)) | ~in(sK1,X2) | 'right:(Tree)>Tree'(sK0) != X2 | ~in(sK1,sK0)) )), 0.18/0.46 inference(cnf_transformation,[],[f27])). 0.18/0.46 tff(f142,plain,( 0.18/0.46 spl6_4 | spl6_12 | spl6_5 | spl6_6), 0.18/0.46 inference(avatar_split_clause,[],[f137,f103,f98,f139,f94])). 0.18/0.46 tff(f139,plain,( 0.18/0.46 spl6_12 <=> in(sK1,sK3)), 0.18/0.46 introduced(avatar_definition,[new_symbols(naming,[spl6_12])])). 0.18/0.46 tff(f137,plain,( 0.18/0.46 $less(sK1,'val:(Tree)>Int'(sK0)) | sK1 = 'val:(Tree)>Int'(sK0) | in(sK1,sK3) | in(sK1,sK0)), 0.18/0.46 inference(global_subsumption,[],[f42,f33])). 0.18/0.46 tff(f33,plain,( 0.18/0.46 'empty:Tree' = sK0 | sK1 = 'val:(Tree)>Int'(sK0) | $less(sK1,'val:(Tree)>Int'(sK0)) | in(sK1,sK3) | in(sK1,sK0)), 0.18/0.46 inference(cnf_transformation,[],[f27])). 0.18/0.46 tff(f136,plain,( 0.18/0.46 spl6_11 | spl6_5 | spl6_4 | spl6_6), 0.18/0.46 inference(avatar_split_clause,[],[f131,f103,f94,f98,f133])). 0.18/0.46 tff(f133,plain,( 0.18/0.46 spl6_11 <=> sK3 = 'right:(Tree)>Tree'(sK0)), 0.18/0.46 introduced(avatar_definition,[new_symbols(naming,[spl6_11])])). 0.18/0.46 tff(f131,plain,( 0.18/0.46 $less(sK1,'val:(Tree)>Int'(sK0)) | in(sK1,sK0) | sK1 = 'val:(Tree)>Int'(sK0) | sK3 = 'right:(Tree)>Tree'(sK0)), 0.18/0.46 inference(global_subsumption,[],[f42,f34])). 0.18/0.46 tff(f34,plain,( 0.18/0.46 'empty:Tree' = sK0 | sK1 = 'val:(Tree)>Int'(sK0) | $less(sK1,'val:(Tree)>Int'(sK0)) | sK3 = 'right:(Tree)>Tree'(sK0) | in(sK1,sK0)), 0.18/0.46 inference(cnf_transformation,[],[f27])). 0.18/0.46 tff(f123,plain,( 0.18/0.46 spl6_4 | spl6_9 | ~spl6_6 | spl6_5), 0.18/0.46 inference(avatar_split_clause,[],[f118,f98,f103,f120,f94])). 0.18/0.46 tff(f120,plain,( 0.18/0.46 spl6_9 <=> sK2 = 'left:(Tree)>Tree'(sK0)), 0.18/0.46 introduced(avatar_definition,[new_symbols(naming,[spl6_9])])). 0.18/0.46 tff(f118,plain,( 0.18/0.46 sK1 = 'val:(Tree)>Int'(sK0) | ~$less(sK1,'val:(Tree)>Int'(sK0)) | sK2 = 'left:(Tree)>Tree'(sK0) | in(sK1,sK0)), 0.18/0.46 inference(global_subsumption,[],[f42,f37])). 0.18/0.46 tff(f37,plain,( 0.18/0.46 'empty:Tree' = sK0 | sK1 = 'val:(Tree)>Int'(sK0) | ~$less(sK1,'val:(Tree)>Int'(sK0)) | sK2 = 'left:(Tree)>Tree'(sK0) | in(sK1,sK0)), 0.18/0.46 inference(cnf_transformation,[],[f27])). 0.18/0.46 tff(f117,plain,( 0.18/0.46 spl6_5 | ~spl6_6 | spl6_8 | spl6_4), 0.18/0.46 inference(avatar_split_clause,[],[f112,f94,f114,f103,f98])). 0.18/0.46 tff(f114,plain,( 0.18/0.46 spl6_8 <=> in(sK1,sK2)), 0.18/0.46 introduced(avatar_definition,[new_symbols(naming,[spl6_8])])). 0.18/0.46 tff(f112,plain,( 0.18/0.46 in(sK1,sK0) | in(sK1,sK2) | ~$less(sK1,'val:(Tree)>Int'(sK0)) | sK1 = 'val:(Tree)>Int'(sK0)), 0.18/0.46 inference(global_subsumption,[],[f42,f38])). 0.18/0.46 tff(f38,plain,( 0.18/0.46 'empty:Tree' = sK0 | sK1 = 'val:(Tree)>Int'(sK0) | ~$less(sK1,'val:(Tree)>Int'(sK0)) | in(sK1,sK2) | in(sK1,sK0)), 0.18/0.46 inference(cnf_transformation,[],[f27])). 0.18/0.46 tff(f111,plain,( 0.18/0.46 ~spl6_4 | ~spl6_6 | ~spl6_7 | spl6_3), 0.18/0.46 inference(avatar_split_clause,[],[f68,f89,f107,f103,f94])). 0.18/0.46 tff(f68,plain,( 0.18/0.46 'empty:Tree' = sK0 | ~in(sK1,'left:(Tree)>Tree'(sK0)) | ~$less(sK1,'val:(Tree)>Int'(sK0)) | ~in(sK1,sK0)), 0.18/0.46 inference(equality_resolution,[],[f39])). 0.18/0.46 tff(f39,plain,( 0.18/0.46 ( ! [X3:'Tree'] : ('empty:Tree' = sK0 | 'left:(Tree)>Tree'(sK0) != X3 | ~in(sK1,X3) | ~$less(sK1,'val:(Tree)>Int'(sK0)) | ~in(sK1,sK0)) )), 0.18/0.46 inference(cnf_transformation,[],[f27])). 0.18/0.46 tff(f92,plain,( 0.18/0.46 spl6_2 | ~spl6_3), 0.18/0.46 inference(avatar_split_clause,[],[f83,f89,f85])). 0.18/0.46 tff(f83,plain,( 0.18/0.46 'empty:Tree' != sK0 | in(sK1,'empty:Tree')), 0.18/0.46 inference(inner_rewriting,[],[f42])). 0.18/0.46 % SZS output end Proof for theBenchmark 0.18/0.46 % (25133)------------------------------ 0.18/0.46 % (25133)Version: Vampire 4.5.0 (commit 2ee491ce on 2020-06-19 13:55:12 +0100) 0.18/0.46 % (25133)Termination reason: Refutation 0.18/0.46 0.18/0.46 % (25133)Memory used [KB]: 10746 0.18/0.46 % (25133)Time elapsed: 0.056 s 0.18/0.46 % (25133)------------------------------ 0.18/0.46 % (25133)------------------------------ 0.18/0.46 % (25131)Success in time 0.125 s 0.18/0.46 EOF