0.04/0.14 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 8 -t %s %d 0.14/0.37 % Computer : n022.cluster.edu 0.14/0.37 % Model : x86_64 x86_64 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.37 % Memory : 8042.1875MB 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.37 % CPULimit : 960 0.14/0.37 % WCLimit : 120 0.14/0.37 % DateTime : Tue Aug 9 04:59:16 EDT 2022 0.22/0.38 % CPUTime : 0.46/0.54 % (32043)lrs+10_1:32_s2a=on:s2agt=10:sgt=8:ss=axioms:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (1199ds/15Mi) 0.51/0.57 % (32043)Instruction limit reached! 0.51/0.57 % (32043)------------------------------ 0.51/0.57 % (32043)Version: Vampire 4.7 (commit 01f454171 on 2022-07-15 16:59:05 +0200) 0.51/0.57 % (32043)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 0.51/0.57 % (32043)Termination reason: Unknown 0.51/0.57 % (32043)Termination phase: Saturation 0.51/0.57 0.51/0.57 % (32043)Memory used [KB]: 5884 0.51/0.57 % (32043)Time elapsed: 0.092 s 0.51/0.57 % (32043)Instructions burned: 15 (million) 0.51/0.57 % (32043)------------------------------ 0.51/0.57 % (32043)------------------------------ 0.51/0.59 % (32041)dis+1011_1:64_drc=off:flr=on:nwc=2.0:sac=on:urr=ec_only:i=9:si=on:rawr=on:rtra=on_0 on theBenchmark for (1199ds/9Mi) 0.51/0.59 % (32044)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (1199ds/24Mi) 0.51/0.60 % (32040)lrs+1010_1:1_aac=none:bce=on:nicw=on:nm=0:plsq=on:plsql=on:sac=on:sos=on:sp=frequency:spb=units:to=lpo:i=41:si=on:rawr=on:rtra=on_0 on theBenchmark for (1199ds/41Mi) 0.51/0.61 % (32045)ott+0_1:1_av=off:bce=on:bsr=unit_only:ep=R:sos=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (1199ds/2Mi) 0.51/0.61 % (32045)Instruction limit reached! 0.51/0.61 % (32045)------------------------------ 0.51/0.61 % (32045)Version: Vampire 4.7 (commit 01f454171 on 2022-07-15 16:59:05 +0200) 0.51/0.61 % (32045)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 0.51/0.61 % (32045)Termination reason: Unknown 0.51/0.61 % (32045)Termination phase: Property scanning 0.51/0.61 0.51/0.61 % (32045)Memory used [KB]: 1023 0.51/0.61 % (32045)Time elapsed: 0.003 s 0.51/0.61 % (32045)Instructions burned: 3 (million) 0.51/0.61 % (32045)------------------------------ 0.51/0.61 % (32045)------------------------------ 0.51/0.61 % (32041)Instruction limit reached! 0.51/0.61 % (32041)------------------------------ 0.51/0.61 % (32041)Version: Vampire 4.7 (commit 01f454171 on 2022-07-15 16:59:05 +0200) 0.51/0.61 % (32041)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 0.51/0.61 % (32041)Termination reason: Unknown 0.51/0.61 % (32041)Termination phase: Function definition elimination 0.51/0.61 0.51/0.61 % (32041)Memory used [KB]: 1279 0.51/0.61 % (32041)Time elapsed: 0.008 s 0.51/0.61 % (32041)Instructions burned: 9 (million) 0.51/0.61 % (32041)------------------------------ 0.51/0.61 % (32041)------------------------------ 0.68/0.65 % (32042)lrs+10_1:1_ep=R:newcnf=on:sd=2:ss=axioms:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (1199ds/2Mi) 0.68/0.65 % (32042)Instruction limit reached! 0.68/0.65 % (32042)------------------------------ 0.68/0.65 % (32042)Version: Vampire 4.7 (commit 01f454171 on 2022-07-15 16:59:05 +0200) 0.68/0.65 % (32042)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 0.68/0.65 % (32042)Termination reason: Unknown 0.68/0.65 % (32042)Termination phase: Property scanning 0.68/0.65 0.68/0.65 % (32042)Memory used [KB]: 1023 0.68/0.65 % (32042)Time elapsed: 0.003 s 0.68/0.65 % (32042)Instructions burned: 2 (million) 0.68/0.65 % (32042)------------------------------ 0.68/0.65 % (32042)------------------------------ 0.68/0.65 % (32044)Instruction limit reached! 0.68/0.65 % (32044)------------------------------ 0.68/0.65 % (32044)Version: Vampire 4.7 (commit 01f454171 on 2022-07-15 16:59:05 +0200) 0.68/0.65 % (32044)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 0.68/0.65 % (32044)Termination reason: Unknown 0.68/0.65 % (32044)Termination phase: Saturation 0.68/0.65 0.68/0.65 % (32044)Memory used [KB]: 6140 0.68/0.65 % (32044)Time elapsed: 0.120 s 0.68/0.65 % (32044)Instructions burned: 25 (million) 0.68/0.65 % (32044)------------------------------ 0.68/0.65 % (32044)------------------------------ 0.68/0.65 % (32039)dis+1010_1:4_aac=none:abs=on:atotf=0.5:avsq=on:avsqc=2:avsqr=215,247:awrs=converge:awrsf=128:bsd=on:erd=off:fde=none:gve=cautious:newcnf=on:nwc=5.0:rnwc=on:sac=on:sas=z3:sp=const_min:tgt=ground:thsq=on:thsqc=64:thsqr=1,4:i=59608:si=on:rawr=on:rtra=on_0 on theBenchmark for (1199ds/59608Mi) 0.68/0.67 % (32046)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=28:si=on:rawr=on:rtra=on_0 on theBenchmark for (1199ds/28Mi) 0.75/0.73 % (32040)Instruction limit reached! 0.75/0.73 % (32040)------------------------------ 0.75/0.73 % (32040)Version: Vampire 4.7 (commit 01f454171 on 2022-07-15 16:59:05 +0200) 0.75/0.73 % (32040)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 0.75/0.73 % (32040)Termination reason: Unknown 0.75/0.73 % (32040)Termination phase: Saturation 0.75/0.73 0.75/0.73 % (32040)Memory used [KB]: 6268 0.75/0.73 % (32040)Time elapsed: 0.188 s 0.75/0.73 % (32040)Instructions burned: 41 (million) 0.75/0.73 % (32040)------------------------------ 0.75/0.73 % (32040)------------------------------ 0.78/0.75 % (32046)Instruction limit reached! 0.78/0.75 % (32046)------------------------------ 0.78/0.75 % (32046)Version: Vampire 4.7 (commit 01f454171 on 2022-07-15 16:59:05 +0200) 0.78/0.75 % (32046)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 0.78/0.75 % (32046)Termination reason: Unknown 0.78/0.75 % (32046)Termination phase: Saturation 0.78/0.75 0.78/0.75 % (32046)Memory used [KB]: 6268 0.78/0.75 % (32046)Time elapsed: 0.258 s 0.78/0.75 % (32046)Instructions burned: 29 (million) 0.78/0.75 % (32046)------------------------------ 0.78/0.75 % (32046)------------------------------ 0.79/0.79 % (32048)lrs+10_1:1_av=off:drc=off:newcnf=on:sd=1:sos=on:ss=axioms:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (1198ds/2Mi) 0.79/0.79 % (32048)Instruction limit reached! 0.79/0.79 % (32048)------------------------------ 0.79/0.79 % (32048)Version: Vampire 4.7 (commit 01f454171 on 2022-07-15 16:59:05 +0200) 0.79/0.79 % (32048)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 0.79/0.79 % (32048)Termination reason: Unknown 0.79/0.79 % (32048)Termination phase: Property scanning 0.79/0.79 0.79/0.79 % (32048)Memory used [KB]: 1023 0.79/0.79 % (32048)Time elapsed: 0.003 s 0.79/0.79 % (32048)Instructions burned: 3 (million) 0.79/0.79 % (32048)------------------------------ 0.79/0.79 % (32048)------------------------------ 0.79/0.80 % (32049)dis+1011_1:1_av=off:plsq=on:sd=1:sos=all:ss=axioms:st=1.2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (1197ds/3Mi) 0.79/0.80 % (32049)Instruction limit reached! 0.79/0.80 % (32049)------------------------------ 0.79/0.80 % (32049)Version: Vampire 4.7 (commit 01f454171 on 2022-07-15 16:59:05 +0200) 0.79/0.80 % (32049)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 0.79/0.80 % (32049)Termination reason: Unknown 0.79/0.80 % (32049)Termination phase: Including theory axioms 0.79/0.80 0.79/0.80 % (32049)Memory used [KB]: 1023 0.79/0.80 % (32049)Time elapsed: 0.003 s 0.79/0.80 % (32049)Instructions burned: 3 (million) 0.79/0.80 % (32049)------------------------------ 0.79/0.80 % (32049)------------------------------ 0.93/0.82 % (32047)lrs+10_1:1_flr=on:nm=2:sos=on:spb=goal:ss=axioms:i=36:si=on:rawr=on:rtra=on_0 on theBenchmark for (1198ds/36Mi) 0.93/0.83 % (32053)dis+20_1:4_av=off:bd=off:cond=fast:fd=off:nwc=2.0:s2a=on:s2at=5.0:sp=reverse_arity:to=lpo:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (1196ds/2Mi) 0.93/0.83 % (32053)Instruction limit reached! 0.93/0.83 % (32053)------------------------------ 0.93/0.83 % (32053)Version: Vampire 4.7 (commit 01f454171 on 2022-07-15 16:59:05 +0200) 0.93/0.83 % (32053)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 0.93/0.83 % (32053)Termination reason: Unknown 0.93/0.83 % (32053)Termination phase: Property scanning 0.93/0.83 0.93/0.83 % (32053)Memory used [KB]: 1023 0.93/0.83 % (32053)Time elapsed: 0.003 s 0.93/0.83 % (32053)Instructions burned: 3 (million) 0.93/0.83 % (32053)------------------------------ 0.93/0.83 % (32053)------------------------------ 1.01/0.86 % (32050)lrs+1010_1:1_ep=RST:s2a=on:s2at=5.0:sos=all:i=28:si=on:rawr=on:rtra=on_0 on theBenchmark for (1197ds/28Mi) 1.01/0.91 % (32051)lrs+10_1:8_ep=R:erd=off:fs=off:fsr=off:gve=force:nwc=2.0:uwa=one_side_interpreted:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (1197ds/3Mi) 1.01/0.92 % (32050)Instruction limit reached! 1.01/0.92 % (32050)------------------------------ 1.01/0.92 % (32050)Version: Vampire 4.7 (commit 01f454171 on 2022-07-15 16:59:05 +0200) 1.01/0.92 % (32050)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 1.01/0.92 % (32050)Termination reason: Unknown 1.01/0.92 % (32050)Termination phase: Saturation 1.01/0.92 1.01/0.92 % (32050)Memory used [KB]: 6140 1.01/0.92 % (32050)Time elapsed: 0.198 s 1.01/0.92 % (32050)Instructions burned: 28 (million) 1.01/0.92 % (32050)------------------------------ 1.01/0.92 % (32050)------------------------------ 1.01/0.92 % (32054)lrs+1_3:1_ep=RSTC:sos=on:urr=on:i=32:si=on:rawr=on:rtra=on_0 on theBenchmark for (1196ds/32Mi) 1.13/0.93 % (32047)Instruction limit reached! 1.13/0.93 % (32047)------------------------------ 1.13/0.93 % (32047)Version: Vampire 4.7 (commit 01f454171 on 2022-07-15 16:59:05 +0200) 1.13/0.93 % (32047)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 1.13/0.93 % (32047)Termination reason: Unknown 1.13/0.93 % (32047)Termination phase: Saturation 1.13/0.93 1.13/0.93 % (32047)Memory used [KB]: 6140 1.13/0.93 % (32047)Time elapsed: 0.326 s 1.13/0.93 % (32047)Instructions burned: 36 (million) 1.13/0.93 % (32047)------------------------------ 1.13/0.93 % (32047)------------------------------ 1.13/0.93 % (32051)Instruction limit reached! 1.13/0.93 % (32051)------------------------------ 1.13/0.93 % (32051)Version: Vampire 4.7 (commit 01f454171 on 2022-07-15 16:59:05 +0200) 1.13/0.93 % (32051)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 1.13/0.93 % (32051)Termination reason: Unknown 1.13/0.93 % (32051)Termination phase: Including theory axioms 1.13/0.93 1.13/0.93 % (32051)Memory used [KB]: 1023 1.13/0.93 % (32051)Time elapsed: 0.004 s 1.13/0.93 % (32051)Instructions burned: 4 (million) 1.13/0.93 % (32051)------------------------------ 1.13/0.93 % (32051)------------------------------ 1.13/0.97 % (32054)Instruction limit reached! 1.13/0.97 % (32054)------------------------------ 1.13/0.97 % (32054)Version: Vampire 4.7 (commit 01f454171 on 2022-07-15 16:59:05 +0200) 1.13/0.97 % (32054)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 1.13/0.97 % (32054)Termination reason: Unknown 1.13/0.97 % (32054)Termination phase: Saturation 1.13/0.97 1.13/0.97 % (32054)Memory used [KB]: 6268 1.13/0.97 % (32054)Time elapsed: 0.113 s 1.13/0.97 % (32054)Instructions burned: 32 (million) 1.13/0.97 % (32054)------------------------------ 1.13/0.97 % (32054)------------------------------ 1.13/0.97 % (32052)lrs+10_1:1_canc=force:tha=some:to=lpo:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (1196ds/37Mi) 1.13/0.97 % (32055)dis+10_1:64_nwc=1.4:tha=off:i=19:si=on:rawr=on:rtra=on_0 on theBenchmark for (1196ds/19Mi) 1.38/1.00 % (32058)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (1194ds/50Mi) 1.38/1.00 % (32055)Instruction limit reached! 1.38/1.00 % (32055)------------------------------ 1.38/1.00 % (32055)Version: Vampire 4.7 (commit 01f454171 on 2022-07-15 16:59:05 +0200) 1.38/1.00 % (32055)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 1.38/1.00 % (32055)Termination reason: Unknown 1.38/1.00 % (32055)Termination phase: Saturation 1.38/1.00 1.38/1.00 % (32055)Memory used [KB]: 5884 1.38/1.00 % (32055)Time elapsed: 0.135 s 1.38/1.00 % (32055)Instructions burned: 19 (million) 1.38/1.00 % (32055)------------------------------ 1.38/1.00 % (32055)------------------------------ 1.38/1.03 % (32052)Instruction limit reached! 1.38/1.03 % (32052)------------------------------ 1.38/1.03 % (32052)Version: Vampire 4.7 (commit 01f454171 on 2022-07-15 16:59:05 +0200) 1.38/1.03 % (32052)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 1.38/1.03 % (32052)Termination reason: Unknown 1.38/1.03 % (32052)Termination phase: Saturation 1.38/1.03 1.38/1.03 % (32052)Memory used [KB]: 6140 1.38/1.03 % (32052)Time elapsed: 0.251 s 1.38/1.03 % (32052)Instructions burned: 37 (million) 1.38/1.03 % (32052)------------------------------ 1.38/1.03 % (32052)------------------------------ 1.38/1.03 % (32058)First to succeed. 1.38/1.03 % (32056)lrs+22_1:1_amm=sco:fsr=off:gve=force:sos=on:uwa=all:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (1195ds/49Mi) 1.38/1.04 % (32058)Refutation found. Thanks to Tanya! 1.38/1.04 % SZS status Theorem for theBenchmark 1.38/1.04 % SZS output start Proof for theBenchmark 1.38/1.04 tff(type_def_5, type, uni: $tType). 1.38/1.04 tff(type_def_6, type, ty: $tType). 1.38/1.04 tff(type_def_7, type, bool1: $tType). 1.38/1.04 tff(type_def_8, type, tuple02: $tType). 1.38/1.04 tff(type_def_9, type, vertex1: $tType). 1.38/1.04 tff(type_def_10, type, set_vertex: $tType). 1.38/1.04 tff(func_def_0, type, witness1: (ty) > uni). 1.38/1.04 tff(func_def_1, type, int: ty). 1.38/1.04 tff(func_def_2, type, real: ty). 1.38/1.04 tff(func_def_3, type, bool: ty). 1.38/1.04 tff(func_def_4, type, true1: bool1). 1.38/1.04 tff(func_def_5, type, false1: bool1). 1.38/1.04 tff(func_def_6, type, match_bool1: (ty * bool1 * uni * uni) > uni). 1.38/1.04 tff(func_def_7, type, tuple0: ty). 1.38/1.04 tff(func_def_8, type, tuple03: tuple02). 1.38/1.04 tff(func_def_9, type, qtmark: ty). 1.38/1.04 tff(func_def_10, type, set: (ty) > ty). 1.38/1.04 tff(func_def_11, type, empty: (ty) > uni). 1.38/1.04 tff(func_def_12, type, add: (ty * uni * uni) > uni). 1.38/1.04 tff(func_def_13, type, remove: (ty * uni * uni) > uni). 1.38/1.04 tff(func_def_14, type, union: (ty * uni * uni) > uni). 1.38/1.04 tff(func_def_15, type, inter: (ty * uni * uni) > uni). 1.38/1.04 tff(func_def_16, type, diff: (ty * uni * uni) > uni). 1.38/1.04 tff(func_def_17, type, choose: (ty * uni) > uni). 1.38/1.04 tff(func_def_18, type, cardinal1: (ty * uni) > $int). 1.38/1.04 tff(func_def_19, type, vertex: ty). 1.38/1.04 tff(func_def_20, type, succ1: (vertex1) > set_vertex). 1.38/1.04 tff(func_def_21, type, t2tb: (set_vertex) > uni). 1.38/1.04 tff(func_def_22, type, tb2t: (uni) > set_vertex). 1.38/1.04 tff(func_def_23, type, t2tb1: (vertex1) > uni). 1.38/1.04 tff(func_def_24, type, tb2t1: (uni) > vertex1). 1.38/1.04 tff(func_def_25, type, ref: (ty) > ty). 1.38/1.04 tff(func_def_26, type, mk_ref: (ty * uni) > uni). 1.38/1.04 tff(func_def_27, type, contents: (ty * uni) > uni). 1.38/1.04 tff(func_def_33, type, sK2: ($int * vertex1 * vertex1) > $int). 1.38/1.04 tff(func_def_34, type, sK3: ($int * vertex1 * vertex1) > $int). 1.38/1.04 tff(func_def_35, type, sK4: (uni * uni * ty) > uni). 1.38/1.04 tff(func_def_36, type, sK5: ($int * vertex1 * vertex1) > vertex1). 1.38/1.04 tff(func_def_37, type, sK6: (ty * uni * uni) > uni). 1.38/1.04 tff(func_def_38, type, sK7: (vertex1 * set_vertex) > vertex1). 1.38/1.04 tff(func_def_39, type, sK8: (set_vertex) > vertex1). 1.38/1.04 tff(func_def_40, type, sK9: (set_vertex) > vertex1). 1.38/1.04 tff(func_def_41, type, sK10: (vertex1 * $int * vertex1) > vertex1). 1.38/1.04 tff(func_def_42, type, sK11: (vertex1 * $int * vertex1) > $int). 1.38/1.04 tff(func_def_43, type, sK12: (vertex1 * $int * vertex1) > vertex1). 1.38/1.04 tff(func_def_44, type, sK13: (vertex1 * $int * vertex1) > vertex1). 1.38/1.04 tff(func_def_45, type, sK14: (vertex1 * vertex1 * $int) > vertex1). 1.38/1.04 tff(func_def_46, type, sK15: set_vertex). 1.38/1.04 tff(func_def_47, type, sK16: set_vertex). 1.38/1.04 tff(func_def_48, type, sK17: vertex1). 1.38/1.04 tff(func_def_49, type, sK18: set_vertex). 1.38/1.04 tff(func_def_50, type, sK19: $int). 1.38/1.04 tff(func_def_51, type, sK20: vertex1). 1.38/1.04 tff(func_def_52, type, sK21: bool1). 1.38/1.04 tff(func_def_53, type, sK22: vertex1). 1.38/1.04 tff(func_def_54, type, sK23: set_vertex). 1.38/1.04 tff(func_def_55, type, sK24: set_vertex). 1.38/1.04 tff(func_def_56, type, sK25: set_vertex). 1.38/1.04 tff(func_def_57, type, sK26: bool1). 1.38/1.04 tff(func_def_58, type, sK27: set_vertex). 1.38/1.04 tff(func_def_59, type, sK28: set_vertex). 1.38/1.04 tff(func_def_60, type, sK29: $int). 1.38/1.04 tff(func_def_61, type, sK30: vertex1). 1.38/1.04 tff(func_def_62, type, sK31: (ty * uni) > uni). 1.38/1.04 tff(pred_def_1, type, sort1: (ty * uni) > $o). 1.38/1.04 tff(pred_def_2, type, mem: (ty * uni * uni) > $o). 1.38/1.04 tff(pred_def_3, type, infix_eqeq: (ty * uni * uni) > $o). 1.38/1.04 tff(pred_def_4, type, subset: (ty * uni * uni) > $o). 1.38/1.04 tff(pred_def_5, type, is_empty: (ty * uni) > $o). 1.38/1.04 tff(pred_def_6, type, path1: (vertex1 * vertex1 * $int) > $o). 1.38/1.04 tff(pred_def_7, type, shortest_path1: (vertex1 * vertex1 * $int) > $o). 1.38/1.04 tff(pred_def_8, type, inv1: (vertex1 * vertex1 * set_vertex * set_vertex * set_vertex * $int) > $o). 1.38/1.04 tff(pred_def_9, type, closure1: (set_vertex * set_vertex * set_vertex * vertex1) > $o). 1.38/1.04 tff(pred_def_12, type, sP0: (set_vertex * $int * vertex1) > $o). 1.38/1.04 tff(pred_def_13, type, sP1: (vertex1 * $int * vertex1) > $o). 1.38/1.04 tff(f984,plain,( 1.38/1.04 $false), 1.38/1.04 inference(avatar_sat_refutation,[],[f434,f446,f983])). 1.38/1.04 tff(f983,plain,( 1.38/1.04 ~spl32_4), 1.38/1.04 inference(avatar_contradiction_clause,[],[f974])). 1.38/1.04 tff(f974,plain,( 1.38/1.04 $false | ~spl32_4), 1.38/1.04 inference(unit_resulting_resolution,[],[f392,f606,f470,f605,f684,f708,f352])). 1.38/1.04 tff(f352,plain,( 1.38/1.04 ( ! [X2 : vertex1,X3 : set_vertex,X0 : set_vertex,X1 : set_vertex,X4 : vertex1] : (~closure1(X3,X1,X0,X2) | ~mem(vertex,t2tb1(X4),t2tb(succ1(X2))) | ~mem(vertex,t2tb1(X2),t2tb(X3)) | mem(vertex,t2tb1(X2),t2tb(X1)) | mem(vertex,t2tb1(X4),t2tb(X3)) | mem(vertex,t2tb1(X2),t2tb(X0))) )), 1.38/1.04 inference(cnf_transformation,[],[f240])). 1.38/1.04 tff(f240,plain,( 1.38/1.04 ! [X0 : set_vertex,X1 : set_vertex,X2 : vertex1,X3 : set_vertex] : ((mem(vertex,t2tb1(X2),t2tb(X1)) | ~mem(vertex,t2tb1(X2),t2tb(X3)) | ! [X4 : vertex1] : (mem(vertex,t2tb1(X4),t2tb(X3)) | ~mem(vertex,t2tb1(X4),t2tb(succ1(X2)))) | mem(vertex,t2tb1(X2),t2tb(X0)) | ~closure1(X3,X1,X0,X2)) & (closure1(X3,X1,X0,X2) | (~mem(vertex,t2tb1(X2),t2tb(X1)) & mem(vertex,t2tb1(X2),t2tb(X3)) & (~mem(vertex,t2tb1(sK7(X2,X3)),t2tb(X3)) & mem(vertex,t2tb1(sK7(X2,X3)),t2tb(succ1(X2)))) & ~mem(vertex,t2tb1(X2),t2tb(X0)))))), 1.38/1.04 inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f238,f239])). 1.38/1.04 tff(f239,plain,( 1.38/1.04 ! [X2 : vertex1,X3 : set_vertex] : (? [X5 : vertex1] : (~mem(vertex,t2tb1(X5),t2tb(X3)) & mem(vertex,t2tb1(X5),t2tb(succ1(X2)))) => (~mem(vertex,t2tb1(sK7(X2,X3)),t2tb(X3)) & mem(vertex,t2tb1(sK7(X2,X3)),t2tb(succ1(X2)))))), 1.38/1.04 introduced(choice_axiom,[])). 1.38/1.04 tff(f238,plain,( 1.38/1.04 ! [X0 : set_vertex,X1 : set_vertex,X2 : vertex1,X3 : set_vertex] : ((mem(vertex,t2tb1(X2),t2tb(X1)) | ~mem(vertex,t2tb1(X2),t2tb(X3)) | ! [X4 : vertex1] : (mem(vertex,t2tb1(X4),t2tb(X3)) | ~mem(vertex,t2tb1(X4),t2tb(succ1(X2)))) | mem(vertex,t2tb1(X2),t2tb(X0)) | ~closure1(X3,X1,X0,X2)) & (closure1(X3,X1,X0,X2) | (~mem(vertex,t2tb1(X2),t2tb(X1)) & mem(vertex,t2tb1(X2),t2tb(X3)) & ? [X5 : vertex1] : (~mem(vertex,t2tb1(X5),t2tb(X3)) & mem(vertex,t2tb1(X5),t2tb(succ1(X2)))) & ~mem(vertex,t2tb1(X2),t2tb(X0)))))), 1.38/1.04 inference(rectify,[],[f237])). 1.38/1.04 tff(f237,plain,( 1.38/1.04 ! [X1 : set_vertex,X2 : set_vertex,X3 : vertex1,X0 : set_vertex] : ((mem(vertex,t2tb1(X3),t2tb(X2)) | ~mem(vertex,t2tb1(X3),t2tb(X0)) | ! [X4 : vertex1] : (mem(vertex,t2tb1(X4),t2tb(X0)) | ~mem(vertex,t2tb1(X4),t2tb(succ1(X3)))) | mem(vertex,t2tb1(X3),t2tb(X1)) | ~closure1(X0,X2,X1,X3)) & (closure1(X0,X2,X1,X3) | (~mem(vertex,t2tb1(X3),t2tb(X2)) & mem(vertex,t2tb1(X3),t2tb(X0)) & ? [X4 : vertex1] : (~mem(vertex,t2tb1(X4),t2tb(X0)) & mem(vertex,t2tb1(X4),t2tb(succ1(X3)))) & ~mem(vertex,t2tb1(X3),t2tb(X1)))))), 1.38/1.04 inference(flattening,[],[f236])). 1.38/1.04 tff(f236,plain,( 1.38/1.04 ! [X1 : set_vertex,X2 : set_vertex,X3 : vertex1,X0 : set_vertex] : (((mem(vertex,t2tb1(X3),t2tb(X2)) | ~mem(vertex,t2tb1(X3),t2tb(X0)) | ! [X4 : vertex1] : (mem(vertex,t2tb1(X4),t2tb(X0)) | ~mem(vertex,t2tb1(X4),t2tb(succ1(X3)))) | mem(vertex,t2tb1(X3),t2tb(X1))) | ~closure1(X0,X2,X1,X3)) & (closure1(X0,X2,X1,X3) | (~mem(vertex,t2tb1(X3),t2tb(X2)) & mem(vertex,t2tb1(X3),t2tb(X0)) & ? [X4 : vertex1] : (~mem(vertex,t2tb1(X4),t2tb(X0)) & mem(vertex,t2tb1(X4),t2tb(succ1(X3)))) & ~mem(vertex,t2tb1(X3),t2tb(X1)))))), 1.38/1.04 inference(nnf_transformation,[],[f186])). 1.38/1.04 tff(f186,plain,( 1.38/1.04 ! [X1 : set_vertex,X2 : set_vertex,X3 : vertex1,X0 : set_vertex] : ((mem(vertex,t2tb1(X3),t2tb(X2)) | ~mem(vertex,t2tb1(X3),t2tb(X0)) | ! [X4 : vertex1] : (mem(vertex,t2tb1(X4),t2tb(X0)) | ~mem(vertex,t2tb1(X4),t2tb(succ1(X3)))) | mem(vertex,t2tb1(X3),t2tb(X1))) <=> closure1(X0,X2,X1,X3))), 1.38/1.04 inference(flattening,[],[f185])). 1.38/1.04 tff(f185,plain,( 1.38/1.04 ! [X3 : vertex1,X1 : set_vertex,X2 : set_vertex,X0 : set_vertex] : (closure1(X0,X2,X1,X3) <=> (((! [X4 : vertex1] : (mem(vertex,t2tb1(X4),t2tb(X0)) | ~mem(vertex,t2tb1(X4),t2tb(succ1(X3)))) | mem(vertex,t2tb1(X3),t2tb(X1))) | mem(vertex,t2tb1(X3),t2tb(X2))) | ~mem(vertex,t2tb1(X3),t2tb(X0))))), 1.38/1.04 inference(ennf_transformation,[],[f121])). 1.38/1.04 tff(f121,plain,( 1.38/1.04 ! [X3 : vertex1,X1 : set_vertex,X2 : set_vertex,X0 : set_vertex] : (closure1(X0,X2,X1,X3) <=> (mem(vertex,t2tb1(X3),t2tb(X0)) => (~mem(vertex,t2tb1(X3),t2tb(X2)) => (~mem(vertex,t2tb1(X3),t2tb(X1)) => ! [X4 : vertex1] : (mem(vertex,t2tb1(X4),t2tb(succ1(X3))) => mem(vertex,t2tb1(X4),t2tb(X0)))))))), 1.38/1.04 inference(rectify,[],[f48])). 1.38/1.04 tff(f48,axiom,( 1.38/1.04 ! [X15 : set_vertex,X17 : set_vertex,X16 : set_vertex,X11 : vertex1] : (closure1(X15,X16,X17,X11) <=> (mem(vertex,t2tb1(X11),t2tb(X15)) => (~mem(vertex,t2tb1(X11),t2tb(X16)) => (~mem(vertex,t2tb1(X11),t2tb(X17)) => ! [X20 : vertex1] : (mem(vertex,t2tb1(X20),t2tb(succ1(X11))) => mem(vertex,t2tb1(X20),t2tb(X15)))))))), 1.38/1.04 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',closure_def)). 1.38/1.04 tff(f708,plain,( 1.38/1.04 mem(vertex,t2tb1(sK7(sK30,sK25)),t2tb(succ1(sK30)))), 1.38/1.04 inference(resolution,[],[f348,f448])). 1.38/1.04 tff(f448,plain,( 1.38/1.04 ~closure1(sK25,sK24,sK28,sK30)), 1.38/1.04 inference(forward_demodulation,[],[f397,f396])). 1.38/1.04 tff(f396,plain,( 1.38/1.04 sK24 = sK27), 1.38/1.04 inference(cnf_transformation,[],[f279])). 1.38/1.04 tff(f279,plain,( 1.38/1.04 ~$less(sK19,0) & (~is_empty(vertex,t2tb(sK18)) & true1 != sK21 & (mem(vertex,t2tb1(sK22),t2tb(sK18)) & tb2t(remove(vertex,t2tb1(sK22),t2tb(sK18))) = sK23 & shortest_path1(sK20,sK22,sK19) & sK22 != sK17 & ((true1 = sK26 & ((tb2t(empty(vertex)) = sK28 & ($sum(sK19,1) = sK29 & ~closure1(sK25,sK27,sK28,sK30))) & sK24 = sK27) & (true1 = sK26 | ~is_empty(vertex,t2tb(sK23))) & (is_empty(vertex,t2tb(sK23)) | true1 != sK26)) & inv1(sK20,sK17,sK25,sK23,sK24,sK19) & ! [X16 : vertex1] : closure1(sK25,sK23,sK24,X16) & subset(vertex,t2tb(succ1(sK22)),t2tb(sK25))) & inv1(sK20,sK17,sK16,sK23,sK15,sK19) & ! [X17 : vertex1] : (sK22 = X17 | closure1(sK16,sK23,sK15,X17))) & (is_empty(vertex,t2tb(sK18)) | true1 != sK21) & (true1 = sK21 | ~is_empty(vertex,t2tb(sK18)))) & (is_empty(vertex,t2tb(sK15)) | ~is_empty(vertex,t2tb(sK18))) & ! [X18 : vertex1] : closure1(sK16,sK18,sK15,X18) & inv1(sK20,sK17,sK16,sK18,sK15,sK19)), 1.38/1.04 inference(skolemisation,[status(esa),new_symbols(skolem,[sK15,sK16,sK17,sK18,sK19,sK20,sK21,sK22,sK23,sK24,sK25,sK26,sK27,sK28,sK29,sK30])],[f269,f278,f277,f276,f275,f274,f273,f272,f271,f270])). 1.38/1.04 tff(f270,plain,( 1.38/1.04 ? [X0 : set_vertex,X1 : set_vertex,X2 : vertex1,X3 : set_vertex,X4 : $int,X5 : vertex1] : (~$less(X4,0) & ? [X6 : bool1] : (~is_empty(vertex,t2tb(X3)) & true1 != X6 & ? [X7 : vertex1,X8 : set_vertex] : (mem(vertex,t2tb1(X7),t2tb(X3)) & tb2t(remove(vertex,t2tb1(X7),t2tb(X3))) = X8 & shortest_path1(X5,X7,X4) & X2 != X7 & ? [X9 : set_vertex,X10 : set_vertex] : (? [X11 : bool1] : (true1 = X11 & ? [X12 : set_vertex] : (? [X13 : set_vertex] : (tb2t(empty(vertex)) = X13 & ? [X14 : $int] : ($sum(X4,1) = X14 & ? [X15 : vertex1] : ~closure1(X10,X12,X13,X15))) & X9 = X12) & (true1 = X11 | ~is_empty(vertex,t2tb(X8))) & (is_empty(vertex,t2tb(X8)) | true1 != X11)) & inv1(X5,X2,X10,X8,X9,X4) & ! [X16 : vertex1] : closure1(X10,X8,X9,X16) & subset(vertex,t2tb(succ1(X7)),t2tb(X10))) & inv1(X5,X2,X1,X8,X0,X4) & ! [X17 : vertex1] : (X7 = X17 | closure1(X1,X8,X0,X17))) & (is_empty(vertex,t2tb(X3)) | true1 != X6) & (true1 = X6 | ~is_empty(vertex,t2tb(X3)))) & (is_empty(vertex,t2tb(X0)) | ~is_empty(vertex,t2tb(X3))) & ! [X18 : vertex1] : closure1(X1,X3,X0,X18) & inv1(X5,X2,X1,X3,X0,X4)) => (~$less(sK19,0) & ? [X6 : bool1] : (~is_empty(vertex,t2tb(sK18)) & true1 != X6 & ? [X8 : set_vertex,X7 : vertex1] : (mem(vertex,t2tb1(X7),t2tb(sK18)) & tb2t(remove(vertex,t2tb1(X7),t2tb(sK18))) = X8 & shortest_path1(sK20,X7,sK19) & sK17 != X7 & ? [X10 : set_vertex,X9 : set_vertex] : (? [X11 : bool1] : (true1 = X11 & ? [X12 : set_vertex] : (? [X13 : set_vertex] : (tb2t(empty(vertex)) = X13 & ? [X14 : $int] : ($sum(sK19,1) = X14 & ? [X15 : vertex1] : ~closure1(X10,X12,X13,X15))) & X9 = X12) & (true1 = X11 | ~is_empty(vertex,t2tb(X8))) & (is_empty(vertex,t2tb(X8)) | true1 != X11)) & inv1(sK20,sK17,X10,X8,X9,sK19) & ! [X16 : vertex1] : closure1(X10,X8,X9,X16) & subset(vertex,t2tb(succ1(X7)),t2tb(X10))) & inv1(sK20,sK17,sK16,X8,sK15,sK19) & ! [X17 : vertex1] : (X7 = X17 | closure1(sK16,X8,sK15,X17))) & (is_empty(vertex,t2tb(sK18)) | true1 != X6) & (true1 = X6 | ~is_empty(vertex,t2tb(sK18)))) & (is_empty(vertex,t2tb(sK15)) | ~is_empty(vertex,t2tb(sK18))) & ! [X18 : vertex1] : closure1(sK16,sK18,sK15,X18) & inv1(sK20,sK17,sK16,sK18,sK15,sK19))), 1.38/1.04 introduced(choice_axiom,[])). 1.38/1.04 tff(f271,plain,( 1.38/1.04 ? [X6 : bool1] : (~is_empty(vertex,t2tb(sK18)) & true1 != X6 & ? [X8 : set_vertex,X7 : vertex1] : (mem(vertex,t2tb1(X7),t2tb(sK18)) & tb2t(remove(vertex,t2tb1(X7),t2tb(sK18))) = X8 & shortest_path1(sK20,X7,sK19) & sK17 != X7 & ? [X10 : set_vertex,X9 : set_vertex] : (? [X11 : bool1] : (true1 = X11 & ? [X12 : set_vertex] : (? [X13 : set_vertex] : (tb2t(empty(vertex)) = X13 & ? [X14 : $int] : ($sum(sK19,1) = X14 & ? [X15 : vertex1] : ~closure1(X10,X12,X13,X15))) & X9 = X12) & (true1 = X11 | ~is_empty(vertex,t2tb(X8))) & (is_empty(vertex,t2tb(X8)) | true1 != X11)) & inv1(sK20,sK17,X10,X8,X9,sK19) & ! [X16 : vertex1] : closure1(X10,X8,X9,X16) & subset(vertex,t2tb(succ1(X7)),t2tb(X10))) & inv1(sK20,sK17,sK16,X8,sK15,sK19) & ! [X17 : vertex1] : (X7 = X17 | closure1(sK16,X8,sK15,X17))) & (is_empty(vertex,t2tb(sK18)) | true1 != X6) & (true1 = X6 | ~is_empty(vertex,t2tb(sK18)))) => (~is_empty(vertex,t2tb(sK18)) & true1 != sK21 & ? [X8 : set_vertex,X7 : vertex1] : (mem(vertex,t2tb1(X7),t2tb(sK18)) & tb2t(remove(vertex,t2tb1(X7),t2tb(sK18))) = X8 & shortest_path1(sK20,X7,sK19) & sK17 != X7 & ? [X10 : set_vertex,X9 : set_vertex] : (? [X11 : bool1] : (true1 = X11 & ? [X12 : set_vertex] : (? [X13 : set_vertex] : (tb2t(empty(vertex)) = X13 & ? [X14 : $int] : ($sum(sK19,1) = X14 & ? [X15 : vertex1] : ~closure1(X10,X12,X13,X15))) & X9 = X12) & (true1 = X11 | ~is_empty(vertex,t2tb(X8))) & (is_empty(vertex,t2tb(X8)) | true1 != X11)) & inv1(sK20,sK17,X10,X8,X9,sK19) & ! [X16 : vertex1] : closure1(X10,X8,X9,X16) & subset(vertex,t2tb(succ1(X7)),t2tb(X10))) & inv1(sK20,sK17,sK16,X8,sK15,sK19) & ! [X17 : vertex1] : (X7 = X17 | closure1(sK16,X8,sK15,X17))) & (is_empty(vertex,t2tb(sK18)) | true1 != sK21) & (true1 = sK21 | ~is_empty(vertex,t2tb(sK18))))), 1.38/1.04 introduced(choice_axiom,[])). 1.38/1.04 tff(f272,plain,( 1.38/1.04 ? [X8 : set_vertex,X7 : vertex1] : (mem(vertex,t2tb1(X7),t2tb(sK18)) & tb2t(remove(vertex,t2tb1(X7),t2tb(sK18))) = X8 & shortest_path1(sK20,X7,sK19) & sK17 != X7 & ? [X10 : set_vertex,X9 : set_vertex] : (? [X11 : bool1] : (true1 = X11 & ? [X12 : set_vertex] : (? [X13 : set_vertex] : (tb2t(empty(vertex)) = X13 & ? [X14 : $int] : ($sum(sK19,1) = X14 & ? [X15 : vertex1] : ~closure1(X10,X12,X13,X15))) & X9 = X12) & (true1 = X11 | ~is_empty(vertex,t2tb(X8))) & (is_empty(vertex,t2tb(X8)) | true1 != X11)) & inv1(sK20,sK17,X10,X8,X9,sK19) & ! [X16 : vertex1] : closure1(X10,X8,X9,X16) & subset(vertex,t2tb(succ1(X7)),t2tb(X10))) & inv1(sK20,sK17,sK16,X8,sK15,sK19) & ! [X17 : vertex1] : (X7 = X17 | closure1(sK16,X8,sK15,X17))) => (mem(vertex,t2tb1(sK22),t2tb(sK18)) & tb2t(remove(vertex,t2tb1(sK22),t2tb(sK18))) = sK23 & shortest_path1(sK20,sK22,sK19) & sK22 != sK17 & ? [X10 : set_vertex,X9 : set_vertex] : (? [X11 : bool1] : (true1 = X11 & ? [X12 : set_vertex] : (? [X13 : set_vertex] : (tb2t(empty(vertex)) = X13 & ? [X14 : $int] : ($sum(sK19,1) = X14 & ? [X15 : vertex1] : ~closure1(X10,X12,X13,X15))) & X9 = X12) & (true1 = X11 | ~is_empty(vertex,t2tb(sK23))) & (is_empty(vertex,t2tb(sK23)) | true1 != X11)) & inv1(sK20,sK17,X10,sK23,X9,sK19) & ! [X16 : vertex1] : closure1(X10,sK23,X9,X16) & subset(vertex,t2tb(succ1(sK22)),t2tb(X10))) & inv1(sK20,sK17,sK16,sK23,sK15,sK19) & ! [X17 : vertex1] : (sK22 = X17 | closure1(sK16,sK23,sK15,X17)))), 1.38/1.04 introduced(choice_axiom,[])). 1.38/1.04 tff(f273,plain,( 1.38/1.04 ? [X10 : set_vertex,X9 : set_vertex] : (? [X11 : bool1] : (true1 = X11 & ? [X12 : set_vertex] : (? [X13 : set_vertex] : (tb2t(empty(vertex)) = X13 & ? [X14 : $int] : ($sum(sK19,1) = X14 & ? [X15 : vertex1] : ~closure1(X10,X12,X13,X15))) & X9 = X12) & (true1 = X11 | ~is_empty(vertex,t2tb(sK23))) & (is_empty(vertex,t2tb(sK23)) | true1 != X11)) & inv1(sK20,sK17,X10,sK23,X9,sK19) & ! [X16 : vertex1] : closure1(X10,sK23,X9,X16) & subset(vertex,t2tb(succ1(sK22)),t2tb(X10))) => (? [X11 : bool1] : (true1 = X11 & ? [X12 : set_vertex] : (? [X13 : set_vertex] : (tb2t(empty(vertex)) = X13 & ? [X14 : $int] : ($sum(sK19,1) = X14 & ? [X15 : vertex1] : ~closure1(sK25,X12,X13,X15))) & sK24 = X12) & (true1 = X11 | ~is_empty(vertex,t2tb(sK23))) & (is_empty(vertex,t2tb(sK23)) | true1 != X11)) & inv1(sK20,sK17,sK25,sK23,sK24,sK19) & ! [X16 : vertex1] : closure1(sK25,sK23,sK24,X16) & subset(vertex,t2tb(succ1(sK22)),t2tb(sK25)))), 1.38/1.04 introduced(choice_axiom,[])). 1.38/1.04 tff(f274,plain,( 1.38/1.04 ? [X11 : bool1] : (true1 = X11 & ? [X12 : set_vertex] : (? [X13 : set_vertex] : (tb2t(empty(vertex)) = X13 & ? [X14 : $int] : ($sum(sK19,1) = X14 & ? [X15 : vertex1] : ~closure1(sK25,X12,X13,X15))) & sK24 = X12) & (true1 = X11 | ~is_empty(vertex,t2tb(sK23))) & (is_empty(vertex,t2tb(sK23)) | true1 != X11)) => (true1 = sK26 & ? [X12 : set_vertex] : (? [X13 : set_vertex] : (tb2t(empty(vertex)) = X13 & ? [X14 : $int] : ($sum(sK19,1) = X14 & ? [X15 : vertex1] : ~closure1(sK25,X12,X13,X15))) & sK24 = X12) & (true1 = sK26 | ~is_empty(vertex,t2tb(sK23))) & (is_empty(vertex,t2tb(sK23)) | true1 != sK26))), 1.38/1.04 introduced(choice_axiom,[])). 1.38/1.04 tff(f275,plain,( 1.38/1.04 ? [X12 : set_vertex] : (? [X13 : set_vertex] : (tb2t(empty(vertex)) = X13 & ? [X14 : $int] : ($sum(sK19,1) = X14 & ? [X15 : vertex1] : ~closure1(sK25,X12,X13,X15))) & sK24 = X12) => (? [X13 : set_vertex] : (tb2t(empty(vertex)) = X13 & ? [X14 : $int] : ($sum(sK19,1) = X14 & ? [X15 : vertex1] : ~closure1(sK25,sK27,X13,X15))) & sK24 = sK27)), 1.38/1.04 introduced(choice_axiom,[])). 1.38/1.04 tff(f276,plain,( 1.38/1.04 ? [X13 : set_vertex] : (tb2t(empty(vertex)) = X13 & ? [X14 : $int] : ($sum(sK19,1) = X14 & ? [X15 : vertex1] : ~closure1(sK25,sK27,X13,X15))) => (tb2t(empty(vertex)) = sK28 & ? [X14 : $int] : ($sum(sK19,1) = X14 & ? [X15 : vertex1] : ~closure1(sK25,sK27,sK28,X15)))), 1.38/1.04 introduced(choice_axiom,[])). 1.38/1.04 tff(f277,plain,( 1.38/1.04 ? [X14 : $int] : ($sum(sK19,1) = X14 & ? [X15 : vertex1] : ~closure1(sK25,sK27,sK28,X15)) => ($sum(sK19,1) = sK29 & ? [X15 : vertex1] : ~closure1(sK25,sK27,sK28,X15))), 1.38/1.04 introduced(choice_axiom,[])). 1.38/1.04 tff(f278,plain,( 1.38/1.04 ? [X15 : vertex1] : ~closure1(sK25,sK27,sK28,X15) => ~closure1(sK25,sK27,sK28,sK30)), 1.38/1.04 introduced(choice_axiom,[])). 1.38/1.04 tff(f269,plain,( 1.38/1.04 ? [X0 : set_vertex,X1 : set_vertex,X2 : vertex1,X3 : set_vertex,X4 : $int,X5 : vertex1] : (~$less(X4,0) & ? [X6 : bool1] : (~is_empty(vertex,t2tb(X3)) & true1 != X6 & ? [X7 : vertex1,X8 : set_vertex] : (mem(vertex,t2tb1(X7),t2tb(X3)) & tb2t(remove(vertex,t2tb1(X7),t2tb(X3))) = X8 & shortest_path1(X5,X7,X4) & X2 != X7 & ? [X9 : set_vertex,X10 : set_vertex] : (? [X11 : bool1] : (true1 = X11 & ? [X12 : set_vertex] : (? [X13 : set_vertex] : (tb2t(empty(vertex)) = X13 & ? [X14 : $int] : ($sum(X4,1) = X14 & ? [X15 : vertex1] : ~closure1(X10,X12,X13,X15))) & X9 = X12) & (true1 = X11 | ~is_empty(vertex,t2tb(X8))) & (is_empty(vertex,t2tb(X8)) | true1 != X11)) & inv1(X5,X2,X10,X8,X9,X4) & ! [X16 : vertex1] : closure1(X10,X8,X9,X16) & subset(vertex,t2tb(succ1(X7)),t2tb(X10))) & inv1(X5,X2,X1,X8,X0,X4) & ! [X17 : vertex1] : (X7 = X17 | closure1(X1,X8,X0,X17))) & (is_empty(vertex,t2tb(X3)) | true1 != X6) & (true1 = X6 | ~is_empty(vertex,t2tb(X3)))) & (is_empty(vertex,t2tb(X0)) | ~is_empty(vertex,t2tb(X3))) & ! [X18 : vertex1] : closure1(X1,X3,X0,X18) & inv1(X5,X2,X1,X3,X0,X4))), 1.38/1.04 inference(rectify,[],[f268])). 1.38/1.04 tff(f268,plain,( 1.38/1.04 ? [X2 : set_vertex,X4 : set_vertex,X5 : vertex1,X0 : set_vertex,X3 : $int,X1 : vertex1] : (~$less(X3,0) & ? [X7 : bool1] : (~is_empty(vertex,t2tb(X0)) & true1 != X7 & ? [X8 : vertex1,X9 : set_vertex] : (mem(vertex,t2tb1(X8),t2tb(X0)) & tb2t(remove(vertex,t2tb1(X8),t2tb(X0))) = X9 & shortest_path1(X1,X8,X3) & X5 != X8 & ? [X11 : set_vertex,X12 : set_vertex] : (? [X14 : bool1] : (true1 = X14 & ? [X15 : set_vertex] : (? [X16 : set_vertex] : (tb2t(empty(vertex)) = X16 & ? [X17 : $int] : ($sum(X3,1) = X17 & ? [X18 : vertex1] : ~closure1(X12,X15,X16,X18))) & X11 = X15) & (true1 = X14 | ~is_empty(vertex,t2tb(X9))) & (is_empty(vertex,t2tb(X9)) | true1 != X14)) & inv1(X1,X5,X12,X9,X11,X3) & ! [X13 : vertex1] : closure1(X12,X9,X11,X13) & subset(vertex,t2tb(succ1(X8)),t2tb(X12))) & inv1(X1,X5,X4,X9,X2,X3) & ! [X10 : vertex1] : (X8 = X10 | closure1(X4,X9,X2,X10))) & (is_empty(vertex,t2tb(X0)) | true1 != X7) & (true1 = X7 | ~is_empty(vertex,t2tb(X0)))) & (is_empty(vertex,t2tb(X2)) | ~is_empty(vertex,t2tb(X0))) & ! [X6 : vertex1] : closure1(X4,X0,X2,X6) & inv1(X1,X5,X4,X0,X2,X3))), 1.38/1.04 inference(flattening,[],[f267])). 1.38/1.04 tff(f267,plain,( 1.38/1.04 ? [X2 : set_vertex,X4 : set_vertex,X5 : vertex1,X0 : set_vertex,X3 : $int,X1 : vertex1] : (~$less(X3,0) & ? [X7 : bool1] : (~is_empty(vertex,t2tb(X0)) & true1 != X7 & ? [X8 : vertex1,X9 : set_vertex] : (mem(vertex,t2tb1(X8),t2tb(X0)) & tb2t(remove(vertex,t2tb1(X8),t2tb(X0))) = X9 & shortest_path1(X1,X8,X3) & X5 != X8 & ? [X11 : set_vertex,X12 : set_vertex] : (? [X14 : bool1] : (true1 = X14 & ? [X15 : set_vertex] : (? [X16 : set_vertex] : (tb2t(empty(vertex)) = X16 & ? [X17 : $int] : ($sum(X3,1) = X17 & ? [X18 : vertex1] : ~closure1(X12,X15,X16,X18))) & X11 = X15) & ((true1 = X14 | ~is_empty(vertex,t2tb(X9))) & (is_empty(vertex,t2tb(X9)) | true1 != X14))) & inv1(X1,X5,X12,X9,X11,X3) & ! [X13 : vertex1] : closure1(X12,X9,X11,X13) & subset(vertex,t2tb(succ1(X8)),t2tb(X12))) & inv1(X1,X5,X4,X9,X2,X3) & ! [X10 : vertex1] : (X8 = X10 | closure1(X4,X9,X2,X10))) & ((is_empty(vertex,t2tb(X0)) | true1 != X7) & (true1 = X7 | ~is_empty(vertex,t2tb(X0))))) & (is_empty(vertex,t2tb(X2)) | ~is_empty(vertex,t2tb(X0))) & ! [X6 : vertex1] : closure1(X4,X0,X2,X6) & inv1(X1,X5,X4,X0,X2,X3))), 1.38/1.04 inference(nnf_transformation,[],[f178])). 1.38/1.04 tff(f178,plain,( 1.38/1.04 ? [X2 : set_vertex,X4 : set_vertex,X5 : vertex1,X0 : set_vertex,X3 : $int,X1 : vertex1] : (~$less(X3,0) & ? [X7 : bool1] : (~is_empty(vertex,t2tb(X0)) & true1 != X7 & ? [X8 : vertex1,X9 : set_vertex] : (mem(vertex,t2tb1(X8),t2tb(X0)) & tb2t(remove(vertex,t2tb1(X8),t2tb(X0))) = X9 & shortest_path1(X1,X8,X3) & X5 != X8 & ? [X11 : set_vertex,X12 : set_vertex] : (? [X14 : bool1] : (true1 = X14 & ? [X15 : set_vertex] : (? [X16 : set_vertex] : (tb2t(empty(vertex)) = X16 & ? [X17 : $int] : ($sum(X3,1) = X17 & ? [X18 : vertex1] : ~closure1(X12,X15,X16,X18))) & X11 = X15) & (true1 = X14 <=> is_empty(vertex,t2tb(X9)))) & inv1(X1,X5,X12,X9,X11,X3) & ! [X13 : vertex1] : closure1(X12,X9,X11,X13) & subset(vertex,t2tb(succ1(X8)),t2tb(X12))) & inv1(X1,X5,X4,X9,X2,X3) & ! [X10 : vertex1] : (X8 = X10 | closure1(X4,X9,X2,X10))) & (is_empty(vertex,t2tb(X0)) <=> true1 = X7)) & (is_empty(vertex,t2tb(X2)) | ~is_empty(vertex,t2tb(X0))) & ! [X6 : vertex1] : closure1(X4,X0,X2,X6) & inv1(X1,X5,X4,X0,X2,X3))), 1.38/1.04 inference(flattening,[],[f177])). 1.38/1.04 tff(f177,plain,( 1.38/1.04 ? [X3 : $int,X5 : vertex1,X4 : set_vertex,X2 : set_vertex,X0 : set_vertex,X1 : vertex1] : (? [X7 : bool1] : (((? [X8 : vertex1,X9 : set_vertex] : (((? [X11 : set_vertex,X12 : set_vertex] : (? [X14 : bool1] : ((? [X15 : set_vertex] : (? [X16 : set_vertex] : (tb2t(empty(vertex)) = X16 & ? [X17 : $int] : ($sum(X3,1) = X17 & ? [X18 : vertex1] : ~closure1(X12,X15,X16,X18))) & X11 = X15) & true1 = X14) & (true1 = X14 <=> is_empty(vertex,t2tb(X9)))) & (inv1(X1,X5,X12,X9,X11,X3) & subset(vertex,t2tb(succ1(X8)),t2tb(X12)) & ! [X13 : vertex1] : closure1(X12,X9,X11,X13))) & (inv1(X1,X5,X4,X9,X2,X3) & shortest_path1(X1,X8,X3) & ! [X10 : vertex1] : (X8 = X10 | closure1(X4,X9,X2,X10)))) & X5 != X8) & (mem(vertex,t2tb1(X8),t2tb(X0)) & tb2t(remove(vertex,t2tb1(X8),t2tb(X0))) = X9)) & ~is_empty(vertex,t2tb(X0))) & true1 != X7) & (is_empty(vertex,t2tb(X0)) <=> true1 = X7)) & (inv1(X1,X5,X4,X0,X2,X3) & ~$less(X3,0) & ! [X6 : vertex1] : closure1(X4,X0,X2,X6) & (is_empty(vertex,t2tb(X2)) | ~is_empty(vertex,t2tb(X0)))))), 1.38/1.04 inference(ennf_transformation,[],[f89])). 1.38/1.04 tff(f89,plain,( 1.38/1.04 ~! [X3 : $int,X5 : vertex1,X4 : set_vertex,X2 : set_vertex,X0 : set_vertex,X1 : vertex1] : ((inv1(X1,X5,X4,X0,X2,X3) & ~$less(X3,0) & ! [X6 : vertex1] : closure1(X4,X0,X2,X6) & (is_empty(vertex,t2tb(X0)) => is_empty(vertex,t2tb(X2)))) => ! [X7 : bool1] : ((is_empty(vertex,t2tb(X0)) <=> true1 = X7) => (true1 != X7 => (~is_empty(vertex,t2tb(X0)) => ! [X8 : vertex1,X9 : set_vertex] : ((mem(vertex,t2tb1(X8),t2tb(X0)) & tb2t(remove(vertex,t2tb1(X8),t2tb(X0))) = X9) => (X5 != X8 => ((inv1(X1,X5,X4,X9,X2,X3) & shortest_path1(X1,X8,X3) & ! [X10 : vertex1] : (X8 != X10 => closure1(X4,X9,X2,X10))) => ! [X11 : set_vertex,X12 : set_vertex] : ((inv1(X1,X5,X12,X9,X11,X3) & subset(vertex,t2tb(succ1(X8)),t2tb(X12)) & ! [X13 : vertex1] : closure1(X12,X9,X11,X13)) => ! [X14 : bool1] : ((true1 = X14 <=> is_empty(vertex,t2tb(X9))) => (true1 = X14 => ! [X15 : set_vertex] : (X11 = X15 => ! [X16 : set_vertex] : (tb2t(empty(vertex)) = X16 => ! [X17 : $int] : ($sum(X3,1) = X17 => ! [X18 : vertex1] : closure1(X12,X15,X16,X18))))))))))))))), 1.38/1.04 inference(rectify,[],[f61])). 1.38/1.04 tff(f61,plain,( 1.38/1.04 ~! [X16 : set_vertex,X13 : vertex1,X17 : set_vertex,X18 : $int,X15 : set_vertex,X14 : vertex1] : (((is_empty(vertex,t2tb(X16)) => is_empty(vertex,t2tb(X17))) & ~$less(X18,0) & inv1(X13,X14,X15,X16,X17,X18) & ! [X11 : vertex1] : closure1(X15,X16,X17,X11)) => ! [X24 : bool1] : ((true1 = X24 <=> is_empty(vertex,t2tb(X16))) => (true1 != X24 => (~is_empty(vertex,t2tb(X16)) => ! [X3 : vertex1,X25 : set_vertex] : ((tb2t(remove(vertex,t2tb1(X3),t2tb(X16))) = X25 & mem(vertex,t2tb1(X3),t2tb(X16))) => (X3 != X14 => ((shortest_path1(X13,X3,X18) & ! [X11 : vertex1] : (X3 != X11 => closure1(X15,X25,X17,X11)) & inv1(X13,X14,X15,X25,X17,X18)) => ! [X26 : set_vertex,X27 : set_vertex] : ((inv1(X13,X14,X27,X25,X26,X18) & ! [X11 : vertex1] : closure1(X27,X25,X26,X11) & subset(vertex,t2tb(succ1(X3)),t2tb(X27))) => ! [X28 : bool1] : ((is_empty(vertex,t2tb(X25)) <=> true1 = X28) => (true1 = X28 => ! [X29 : set_vertex] : (X26 = X29 => ! [X30 : set_vertex] : (tb2t(empty(vertex)) = X30 => ! [X31 : $int] : ($sum(X18,1) = X31 => ! [X11 : vertex1] : closure1(X27,X29,X30,X11))))))))))))))), 1.38/1.04 inference(theory_normalization,[],[f40])). 1.38/1.04 tff(f40,negated_conjecture,( 1.38/1.04 ~! [X16 : set_vertex,X13 : vertex1,X17 : set_vertex,X18 : $int,X15 : set_vertex,X14 : vertex1] : (((is_empty(vertex,t2tb(X16)) => is_empty(vertex,t2tb(X17))) & $lesseq(0,X18) & inv1(X13,X14,X15,X16,X17,X18) & ! [X11 : vertex1] : closure1(X15,X16,X17,X11)) => ! [X24 : bool1] : ((true1 = X24 <=> is_empty(vertex,t2tb(X16))) => (true1 != X24 => (~is_empty(vertex,t2tb(X16)) => ! [X3 : vertex1,X25 : set_vertex] : ((tb2t(remove(vertex,t2tb1(X3),t2tb(X16))) = X25 & mem(vertex,t2tb1(X3),t2tb(X16))) => (X3 != X14 => ((shortest_path1(X13,X3,X18) & ! [X11 : vertex1] : (X3 != X11 => closure1(X15,X25,X17,X11)) & inv1(X13,X14,X15,X25,X17,X18)) => ! [X26 : set_vertex,X27 : set_vertex] : ((inv1(X13,X14,X27,X25,X26,X18) & ! [X11 : vertex1] : closure1(X27,X25,X26,X11) & subset(vertex,t2tb(succ1(X3)),t2tb(X27))) => ! [X28 : bool1] : ((is_empty(vertex,t2tb(X25)) <=> true1 = X28) => (true1 = X28 => ! [X29 : set_vertex] : (X26 = X29 => ! [X30 : set_vertex] : (tb2t(empty(vertex)) = X30 => ! [X31 : $int] : ($sum(X18,1) = X31 => ! [X11 : vertex1] : closure1(X27,X29,X30,X11))))))))))))))), 1.38/1.04 inference(negated_conjecture,[],[f39])). 1.38/1.04 tff(f39,conjecture,( 1.38/1.04 ! [X16 : set_vertex,X13 : vertex1,X17 : set_vertex,X18 : $int,X15 : set_vertex,X14 : vertex1] : (((is_empty(vertex,t2tb(X16)) => is_empty(vertex,t2tb(X17))) & $lesseq(0,X18) & inv1(X13,X14,X15,X16,X17,X18) & ! [X11 : vertex1] : closure1(X15,X16,X17,X11)) => ! [X24 : bool1] : ((true1 = X24 <=> is_empty(vertex,t2tb(X16))) => (true1 != X24 => (~is_empty(vertex,t2tb(X16)) => ! [X3 : vertex1,X25 : set_vertex] : ((tb2t(remove(vertex,t2tb1(X3),t2tb(X16))) = X25 & mem(vertex,t2tb1(X3),t2tb(X16))) => (X3 != X14 => ((shortest_path1(X13,X3,X18) & ! [X11 : vertex1] : (X3 != X11 => closure1(X15,X25,X17,X11)) & inv1(X13,X14,X15,X25,X17,X18)) => ! [X26 : set_vertex,X27 : set_vertex] : ((inv1(X13,X14,X27,X25,X26,X18) & ! [X11 : vertex1] : closure1(X27,X25,X26,X11) & subset(vertex,t2tb(succ1(X3)),t2tb(X27))) => ! [X28 : bool1] : ((is_empty(vertex,t2tb(X25)) <=> true1 = X28) => (true1 = X28 => ! [X29 : set_vertex] : (X26 = X29 => ! [X30 : set_vertex] : (tb2t(empty(vertex)) = X30 => ! [X31 : $int] : ($sum(X18,1) = X31 => ! [X11 : vertex1] : closure1(X27,X29,X30,X11))))))))))))))), 1.38/1.04 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wP_parameter_bfs)). 1.38/1.04 tff(f397,plain,( 1.38/1.04 ~closure1(sK25,sK27,sK28,sK30)), 1.38/1.04 inference(cnf_transformation,[],[f279])). 1.38/1.04 tff(f348,plain,( 1.38/1.04 ( ! [X2 : vertex1,X3 : set_vertex,X0 : set_vertex,X1 : set_vertex] : (closure1(X3,X1,X0,X2) | mem(vertex,t2tb1(sK7(X2,X3)),t2tb(succ1(X2)))) )), 1.38/1.04 inference(cnf_transformation,[],[f240])). 1.38/1.04 tff(f684,plain,( 1.38/1.04 ~mem(vertex,t2tb1(sK7(sK30,sK25)),t2tb(sK25))), 1.38/1.04 inference(resolution,[],[f349,f448])). 1.38/1.04 tff(f349,plain,( 1.38/1.04 ( ! [X2 : vertex1,X3 : set_vertex,X0 : set_vertex,X1 : set_vertex] : (closure1(X3,X1,X0,X2) | ~mem(vertex,t2tb1(sK7(X2,X3)),t2tb(X3))) )), 1.38/1.04 inference(cnf_transformation,[],[f240])). 1.38/1.04 tff(f605,plain,( 1.38/1.04 mem(vertex,t2tb1(sK30),t2tb(sK25))), 1.38/1.04 inference(resolution,[],[f350,f448])). 1.38/1.04 tff(f350,plain,( 1.38/1.04 ( ! [X2 : vertex1,X3 : set_vertex,X0 : set_vertex,X1 : set_vertex] : (closure1(X3,X1,X0,X2) | mem(vertex,t2tb1(X2),t2tb(X3))) )), 1.38/1.04 inference(cnf_transformation,[],[f240])). 1.38/1.04 tff(f470,plain,( 1.38/1.04 ( ! [X0 : uni] : (~mem(vertex,X0,t2tb(sK23))) ) | ~spl32_4), 1.38/1.04 inference(resolution,[],[f411,f433])). 1.38/1.04 tff(f433,plain,( 1.38/1.04 is_empty(vertex,t2tb(sK23)) | ~spl32_4), 1.38/1.04 inference(avatar_component_clause,[],[f432])). 1.38/1.04 tff(f432,plain,( 1.38/1.04 spl32_4 <=> is_empty(vertex,t2tb(sK23))), 1.38/1.04 introduced(avatar_definition,[new_symbols(naming,[spl32_4])])). 1.38/1.04 tff(f411,plain,( 1.38/1.04 ( ! [X2 : uni,X0 : ty,X1 : uni] : (~is_empty(X0,X1) | ~mem(X0,X2,X1)) )), 1.38/1.04 inference(cnf_transformation,[],[f282])). 1.38/1.04 tff(f282,plain,( 1.38/1.04 ! [X0 : ty,X1 : uni] : ((! [X2 : uni] : ~mem(X0,X2,X1) | ~is_empty(X0,X1)) & (is_empty(X0,X1) | (sort1(X0,sK31(X0,X1)) & mem(X0,sK31(X0,X1),X1))))), 1.38/1.04 inference(skolemisation,[status(esa),new_symbols(skolem,[sK31])],[f280,f281])). 1.38/1.04 tff(f281,plain,( 1.38/1.04 ! [X0 : ty,X1 : uni] : (? [X3 : uni] : (sort1(X0,X3) & mem(X0,X3,X1)) => (sort1(X0,sK31(X0,X1)) & mem(X0,sK31(X0,X1),X1)))), 1.38/1.04 introduced(choice_axiom,[])). 1.38/1.04 tff(f280,plain,( 1.38/1.04 ! [X0 : ty,X1 : uni] : ((! [X2 : uni] : ~mem(X0,X2,X1) | ~is_empty(X0,X1)) & (is_empty(X0,X1) | ? [X3 : uni] : (sort1(X0,X3) & mem(X0,X3,X1))))), 1.38/1.04 inference(rectify,[],[f187])). 1.38/1.04 tff(f187,plain,( 1.38/1.04 ! [X1 : ty,X0 : uni] : ((! [X2 : uni] : ~mem(X1,X2,X0) | ~is_empty(X1,X0)) & (is_empty(X1,X0) | ? [X3 : uni] : (sort1(X1,X3) & mem(X1,X3,X0))))), 1.38/1.04 inference(ennf_transformation,[],[f88])). 1.38/1.04 tff(f88,plain,( 1.38/1.04 ! [X1 : ty,X0 : uni] : ((is_empty(X1,X0) => ! [X2 : uni] : ~mem(X1,X2,X0)) & (! [X3 : uni] : (sort1(X1,X3) => ~mem(X1,X3,X0)) => is_empty(X1,X0)))), 1.38/1.04 inference(rectify,[],[f38])). 1.38/1.04 tff(f38,axiom,( 1.38/1.04 ! [X13 : uni,X8 : ty] : ((is_empty(X8,X13) => ! [X11 : uni] : ~mem(X8,X11,X13)) & (! [X11 : uni] : (sort1(X8,X11) => ~mem(X8,X11,X13)) => is_empty(X8,X13)))), 1.38/1.04 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',is_empty_def)). 1.38/1.04 tff(f606,plain,( 1.38/1.04 ~mem(vertex,t2tb1(sK30),t2tb(sK24))), 1.38/1.04 inference(resolution,[],[f351,f448])). 1.38/1.04 tff(f351,plain,( 1.38/1.04 ( ! [X2 : vertex1,X3 : set_vertex,X0 : set_vertex,X1 : set_vertex] : (closure1(X3,X1,X0,X2) | ~mem(vertex,t2tb1(X2),t2tb(X1))) )), 1.38/1.04 inference(cnf_transformation,[],[f240])). 1.38/1.04 tff(f392,plain,( 1.38/1.04 ( ! [X16 : vertex1] : (closure1(sK25,sK23,sK24,X16)) )), 1.38/1.04 inference(cnf_transformation,[],[f279])). 1.38/1.04 tff(f446,plain,( 1.38/1.04 spl32_3), 1.38/1.04 inference(avatar_split_clause,[],[f400,f429])). 1.38/1.04 tff(f429,plain,( 1.38/1.04 spl32_3 <=> true1 = sK26), 1.38/1.04 introduced(avatar_definition,[new_symbols(naming,[spl32_3])])). 1.38/1.04 tff(f400,plain,( 1.38/1.04 true1 = sK26), 1.38/1.04 inference(cnf_transformation,[],[f279])). 1.38/1.04 tff(f434,plain,( 1.38/1.04 ~spl32_3 | spl32_4), 1.38/1.04 inference(avatar_split_clause,[],[f394,f432,f429])). 1.38/1.04 tff(f394,plain,( 1.38/1.04 is_empty(vertex,t2tb(sK23)) | true1 != sK26), 1.38/1.04 inference(cnf_transformation,[],[f279])). 1.38/1.04 % SZS output end Proof for theBenchmark 1.38/1.04 % (32058)------------------------------ 1.38/1.04 % (32058)Version: Vampire 4.7 (commit 01f454171 on 2022-07-15 16:59:05 +0200) 1.38/1.04 % (32058)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0 1.38/1.04 % (32058)Termination reason: Refutation 1.38/1.04 1.38/1.04 % (32058)Memory used [KB]: 6396 1.38/1.04 % (32058)Time elapsed: 0.061 s 1.38/1.04 % (32058)Instructions burned: 47 (million) 1.38/1.04 % (32058)------------------------------ 1.38/1.04 % (32058)------------------------------ 1.38/1.04 % (32038)Success in time 0.618 s 1.38/1.05 EOF