0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command    : run_vampire %s %d THM
0.12/0.33	% Computer : n012.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1440
0.12/0.33	% WCLimit    : 180
0.12/0.33	% DateTime   : Thu Jul  4 06:46:09 EDT 2024
0.12/0.33	% CPUTime    : 
0.12/0.35	This is a TFF_ problem
0.12/0.35	Running first-order theorem proving
0.12/0.36	Running /export/starexec/sandbox/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 180 /export/starexec/sandbox/benchmark/theBenchmark.p
0.21/0.42	% (9453)Running in auto input_syntax mode. Trying TPTP
0.21/0.42	% (9454)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=59848:si=on:rawr=on:rtra=on_0 on theBenchmark for (1799ds/59848Mi)
0.21/0.42	% (9453)Running in auto input_syntax mode. Trying TPTP
0.21/0.42	% (9457)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (1799ds/2Mi)
0.21/0.42	% (9453)Running in auto input_syntax mode. Trying TPTP
0.21/0.42	% (9458)ott+1011_1:2_br=off:bs=unit_only:bsr=unit_only:nwc=5.0:s2a=on:s2agt=32:urr=on:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (1799ds/37Mi)
0.21/0.42	% (9453)Running in auto input_syntax mode. Trying TPTP
0.21/0.42	% (9459)lrs+10_1:32_s2a=on:s2agt=10:sgt=8:ss=axioms:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (1799ds/15Mi)
0.21/0.42	% (9453)Running in auto input_syntax mode. Trying TPTP
0.21/0.42	% (9460)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=32:si=on:rawr=on:rtra=on_0 on theBenchmark for (1799ds/32Mi)
0.21/0.42	% (9453)Running in auto input_syntax mode. Trying TPTP
0.21/0.42	% (9455)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=34:si=on:rawr=on:rtra=on_0 on theBenchmark for (1799ds/34Mi)
0.21/0.42	% (9453)Running in auto input_syntax mode. Trying TPTP
0.21/0.42	% (9456)dis+1011_1:64_drc=off:flr=on:nwc=2.0:sac=on:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (1799ds/8Mi)
0.21/0.42	% (9457)Instruction limit reached!
0.21/0.42	% (9457)------------------------------
0.21/0.42	% (9457)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
0.21/0.42	% (9457)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
0.21/0.42	% (9457)Termination reason: Time limit
0.21/0.42	% (9457)Termination phase: Including theory axioms
0.21/0.42	
0.21/0.42	% (9457)Memory used [KB]: 828
0.21/0.42	% (9457)Time elapsed: 0.003 s
0.21/0.42	% (9457)Instructions burned: 2 (million)
0.21/0.43	% (9456)Instruction limit reached!
0.21/0.43	% (9456)------------------------------
0.21/0.43	% (9456)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
0.21/0.43	% (9456)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
0.21/0.43	% (9456)Termination reason: Time limit
0.21/0.43	% (9456)Termination phase: Saturation
0.21/0.43	
0.21/0.43	% (9456)Memory used [KB]: 1017
0.21/0.43	% (9456)Time elapsed: 0.007 s
0.21/0.43	% (9456)Instructions burned: 9 (million)
0.21/0.43	% (9459)Instruction limit reached!
0.21/0.43	% (9459)------------------------------
0.21/0.43	% (9459)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
0.21/0.43	% (9459)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
0.21/0.43	% (9459)Termination reason: Time limit
0.21/0.43	% (9459)Termination phase: Saturation
0.21/0.43	
0.21/0.43	% (9459)Memory used [KB]: 1138
0.21/0.43	% (9459)Time elapsed: 0.013 s
0.21/0.43	% (9459)Instructions burned: 15 (million)
0.21/0.44	% (9460)First to succeed.
0.21/0.45	% (9460)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-9453"
0.21/0.45	% (9458)Instruction limit reached!
0.21/0.45	% (9458)------------------------------
0.21/0.45	% (9458)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
0.21/0.45	% (9458)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
0.21/0.45	% (9458)Termination reason: Time limit
0.21/0.45	% (9458)Termination phase: Saturation
0.21/0.45	
0.21/0.45	% (9458)Memory used [KB]: 1309
0.21/0.45	% (9458)Time elapsed: 0.025 s
0.21/0.45	% (9458)Instructions burned: 37 (million)
0.21/0.45	% (9455)Instruction limit reached!
0.21/0.45	% (9455)------------------------------
0.21/0.45	% (9455)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
0.21/0.45	% (9455)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
0.21/0.45	% (9455)Termination reason: Time limit
0.21/0.45	% (9455)Termination phase: Saturation
0.21/0.45	
0.21/0.45	% (9455)Memory used [KB]: 1488
0.21/0.45	% (9455)Time elapsed: 0.025 s
0.21/0.45	% (9455)Instructions burned: 35 (million)
0.21/0.45	% (9453)Running in auto input_syntax mode. Trying TPTP
0.21/0.45	% (9460)Refutation found. Thanks to Tanya!
0.21/0.45	% SZS status Theorem for theBenchmark
0.21/0.45	% SZS output start Proof for theBenchmark
0.21/0.45	tff(type_def_5, type, uni: $tType).
0.21/0.45	tff(type_def_6, type, ty: $tType).
0.21/0.45	tff(type_def_7, type, bool1: $tType).
0.21/0.45	tff(type_def_8, type, tuple02: $tType).
0.21/0.45	tff(type_def_9, type, vertex1: $tType).
0.21/0.45	tff(type_def_10, type, set_vertex: $tType).
0.21/0.45	tff(func_def_0, type, witness1: ty > uni).
0.21/0.45	tff(func_def_1, type, int: ty).
0.21/0.45	tff(func_def_2, type, real: ty).
0.21/0.45	tff(func_def_3, type, bool: ty).
0.21/0.45	tff(func_def_4, type, true1: bool1).
0.21/0.45	tff(func_def_5, type, false1: bool1).
0.21/0.45	tff(func_def_6, type, match_bool1: (ty * bool1 * uni * uni) > uni).
0.21/0.45	tff(func_def_7, type, tuple0: ty).
0.21/0.45	tff(func_def_8, type, tuple03: tuple02).
0.21/0.45	tff(func_def_9, type, qtmark: ty).
0.21/0.45	tff(func_def_10, type, set: ty > ty).
0.21/0.45	tff(func_def_11, type, empty: ty > uni).
0.21/0.45	tff(func_def_12, type, add: (ty * uni * uni) > uni).
0.21/0.45	tff(func_def_13, type, remove: (ty * uni * uni) > uni).
0.21/0.45	tff(func_def_14, type, union: (ty * uni * uni) > uni).
0.21/0.45	tff(func_def_15, type, inter: (ty * uni * uni) > uni).
0.21/0.45	tff(func_def_16, type, diff: (ty * uni * uni) > uni).
0.21/0.45	tff(func_def_17, type, choose: (ty * uni) > uni).
0.21/0.45	tff(func_def_18, type, cardinal1: (ty * uni) > $int).
0.21/0.45	tff(func_def_19, type, vertex: ty).
0.21/0.45	tff(func_def_20, type, succ1: vertex1 > set_vertex).
0.21/0.45	tff(func_def_21, type, t2tb: set_vertex > uni).
0.21/0.45	tff(func_def_22, type, tb2t: uni > set_vertex).
0.21/0.45	tff(func_def_23, type, t2tb1: vertex1 > uni).
0.21/0.45	tff(func_def_24, type, tb2t1: uni > vertex1).
0.21/0.45	tff(func_def_25, type, ref: ty > ty).
0.21/0.45	tff(func_def_26, type, mk_ref: (ty * uni) > uni).
0.21/0.45	tff(func_def_27, type, contents: (ty * uni) > uni).
0.21/0.45	tff(func_def_33, type, sK2: ($int * vertex1 * vertex1) > $int).
0.21/0.45	tff(func_def_34, type, sK3: set_vertex > vertex1).
0.21/0.45	tff(func_def_35, type, sK4: set_vertex > vertex1).
0.21/0.45	tff(func_def_36, type, sK5: set_vertex).
0.21/0.45	tff(func_def_37, type, sK6: vertex1).
0.21/0.45	tff(func_def_38, type, sK7: $int).
0.21/0.45	tff(func_def_39, type, sK8: set_vertex).
0.21/0.45	tff(func_def_40, type, sK9: set_vertex).
0.21/0.45	tff(func_def_41, type, sK10: vertex1).
0.21/0.45	tff(func_def_42, type, sK11: bool1).
0.21/0.45	tff(func_def_43, type, sK12: set_vertex).
0.21/0.45	tff(func_def_44, type, sK13: vertex1).
0.21/0.45	tff(func_def_45, type, sK14: set_vertex).
0.21/0.45	tff(func_def_46, type, sK15: set_vertex).
0.21/0.45	tff(func_def_47, type, sK16: bool1).
0.21/0.45	tff(func_def_48, type, sK17: set_vertex).
0.21/0.45	tff(func_def_49, type, sK18: set_vertex).
0.21/0.45	tff(func_def_50, type, sK19: $int).
0.21/0.45	tff(func_def_51, type, sK20: vertex1).
0.21/0.45	tff(func_def_52, type, sK21: (ty * uni * uni) > uni).
0.21/0.45	tff(func_def_53, type, sK22: (ty * uni) > uni).
0.21/0.45	tff(func_def_54, type, sK23: ($int * vertex1 * vertex1) > $int).
0.21/0.45	tff(func_def_55, type, sK24: (set_vertex * vertex1) > vertex1).
0.21/0.45	tff(func_def_56, type, sK25: ($int * vertex1 * vertex1) > $int).
0.21/0.45	tff(func_def_57, type, sK26: ($int * vertex1 * vertex1) > vertex1).
0.21/0.45	tff(func_def_58, type, sK27: ($int * vertex1 * vertex1) > vertex1).
0.21/0.45	tff(func_def_59, type, sK28: ($int * vertex1 * vertex1) > vertex1).
0.21/0.45	tff(func_def_60, type, sK29: (vertex1 * vertex1 * $int) > vertex1).
0.21/0.45	tff(func_def_61, type, sK30: (vertex1 * $int * vertex1) > vertex1).
0.21/0.45	tff(pred_def_1, type, sort1: (ty * uni) > $o).
0.21/0.45	tff(pred_def_2, type, mem: (ty * uni * uni) > $o).
0.21/0.45	tff(pred_def_3, type, infix_eqeq: (ty * uni * uni) > $o).
0.21/0.45	tff(pred_def_4, type, subset: (ty * uni * uni) > $o).
0.21/0.45	tff(pred_def_5, type, is_empty: (ty * uni) > $o).
0.21/0.45	tff(pred_def_6, type, path1: (vertex1 * vertex1 * $int) > $o).
0.21/0.45	tff(pred_def_7, type, shortest_path1: (vertex1 * vertex1 * $int) > $o).
0.21/0.45	tff(pred_def_8, type, inv1: (vertex1 * vertex1 * set_vertex * set_vertex * set_vertex * $int) > $o).
0.21/0.45	tff(pred_def_9, type, closure1: (set_vertex * set_vertex * set_vertex * vertex1) > $o).
0.21/0.45	tff(pred_def_12, type, sP0: ($int * vertex1 * set_vertex) > $o).
0.21/0.45	tff(pred_def_13, type, sP1: ($int * vertex1 * vertex1) > $o).
0.21/0.45	tff(f546,plain,(
0.21/0.45	  $false),
0.21/0.45	  inference(avatar_sat_refutation,[],[f318,f330,f545])).
0.21/0.45	tff(f545,plain,(
0.21/0.45	  ~spl31_2),
0.21/0.45	  inference(avatar_contradiction_clause,[],[f544])).
0.21/0.45	tff(f544,plain,(
0.21/0.45	  $false | ~spl31_2),
0.21/0.45	  inference(subsumption_resolution,[],[f534,f360])).
0.21/0.45	tff(f360,plain,(
0.21/0.45	  mem(vertex,t2tb1(sK24(sK14,sK20)),t2tb(succ1(sK20)))),
0.21/0.45	  inference(unit_resulting_resolution,[],[f328,f295])).
0.21/0.45	tff(f295,plain,(
0.21/0.45	  ( ! [X2 : set_vertex,X3 : vertex1,X0 : set_vertex,X1 : set_vertex] : (mem(vertex,t2tb1(sK24(X1,X3)),t2tb(succ1(X3))) | closure1(X1,X2,X0,X3)) )),
0.21/0.45	  inference(cnf_transformation,[],[f205])).
0.21/0.45	tff(f205,plain,(
0.21/0.45	  ! [X0 : set_vertex,X1 : set_vertex,X2 : set_vertex,X3 : vertex1] : ((closure1(X1,X2,X0,X3) | ((mem(vertex,t2tb1(sK24(X1,X3)),t2tb(succ1(X3))) & ~mem(vertex,t2tb1(sK24(X1,X3)),t2tb(X1))) & ~mem(vertex,t2tb1(X3),t2tb(X0)) & ~mem(vertex,t2tb1(X3),t2tb(X2)) & mem(vertex,t2tb1(X3),t2tb(X1)))) & (! [X5 : vertex1] : (~mem(vertex,t2tb1(X5),t2tb(succ1(X3))) | mem(vertex,t2tb1(X5),t2tb(X1))) | mem(vertex,t2tb1(X3),t2tb(X0)) | mem(vertex,t2tb1(X3),t2tb(X2)) | ~mem(vertex,t2tb1(X3),t2tb(X1)) | ~closure1(X1,X2,X0,X3)))),
0.21/0.45	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK24])],[f203,f204])).
0.21/0.45	tff(f204,plain,(
0.21/0.45	  ! [X1 : set_vertex,X3 : vertex1] : (? [X4 : vertex1] : (mem(vertex,t2tb1(X4),t2tb(succ1(X3))) & ~mem(vertex,t2tb1(X4),t2tb(X1))) => (mem(vertex,t2tb1(sK24(X1,X3)),t2tb(succ1(X3))) & ~mem(vertex,t2tb1(sK24(X1,X3)),t2tb(X1))))),
0.21/0.45	  introduced(choice_axiom,[])).
0.21/0.45	tff(f203,plain,(
0.21/0.45	  ! [X0 : set_vertex,X1 : set_vertex,X2 : set_vertex,X3 : vertex1] : ((closure1(X1,X2,X0,X3) | (? [X4 : vertex1] : (mem(vertex,t2tb1(X4),t2tb(succ1(X3))) & ~mem(vertex,t2tb1(X4),t2tb(X1))) & ~mem(vertex,t2tb1(X3),t2tb(X0)) & ~mem(vertex,t2tb1(X3),t2tb(X2)) & mem(vertex,t2tb1(X3),t2tb(X1)))) & (! [X5 : vertex1] : (~mem(vertex,t2tb1(X5),t2tb(succ1(X3))) | mem(vertex,t2tb1(X5),t2tb(X1))) | mem(vertex,t2tb1(X3),t2tb(X0)) | mem(vertex,t2tb1(X3),t2tb(X2)) | ~mem(vertex,t2tb1(X3),t2tb(X1)) | ~closure1(X1,X2,X0,X3)))),
0.21/0.45	  inference(rectify,[],[f202])).
0.21/0.45	tff(f202,plain,(
0.21/0.45	  ! [X3 : set_vertex,X1 : set_vertex,X2 : set_vertex,X0 : vertex1] : ((closure1(X1,X2,X3,X0) | (? [X4 : vertex1] : (mem(vertex,t2tb1(X4),t2tb(succ1(X0))) & ~mem(vertex,t2tb1(X4),t2tb(X1))) & ~mem(vertex,t2tb1(X0),t2tb(X3)) & ~mem(vertex,t2tb1(X0),t2tb(X2)) & mem(vertex,t2tb1(X0),t2tb(X1)))) & (! [X4 : vertex1] : (~mem(vertex,t2tb1(X4),t2tb(succ1(X0))) | mem(vertex,t2tb1(X4),t2tb(X1))) | mem(vertex,t2tb1(X0),t2tb(X3)) | mem(vertex,t2tb1(X0),t2tb(X2)) | ~mem(vertex,t2tb1(X0),t2tb(X1)) | ~closure1(X1,X2,X3,X0)))),
0.21/0.45	  inference(flattening,[],[f201])).
0.21/0.45	tff(f201,plain,(
0.21/0.45	  ! [X3 : set_vertex,X1 : set_vertex,X2 : set_vertex,X0 : vertex1] : ((closure1(X1,X2,X3,X0) | (? [X4 : vertex1] : (mem(vertex,t2tb1(X4),t2tb(succ1(X0))) & ~mem(vertex,t2tb1(X4),t2tb(X1))) & ~mem(vertex,t2tb1(X0),t2tb(X3)) & ~mem(vertex,t2tb1(X0),t2tb(X2)) & mem(vertex,t2tb1(X0),t2tb(X1)))) & ((! [X4 : vertex1] : (~mem(vertex,t2tb1(X4),t2tb(succ1(X0))) | mem(vertex,t2tb1(X4),t2tb(X1))) | mem(vertex,t2tb1(X0),t2tb(X3)) | mem(vertex,t2tb1(X0),t2tb(X2)) | ~mem(vertex,t2tb1(X0),t2tb(X1))) | ~closure1(X1,X2,X3,X0)))),
0.21/0.45	  inference(nnf_transformation,[],[f148])).
0.21/0.45	tff(f148,plain,(
0.21/0.45	  ! [X3 : set_vertex,X1 : set_vertex,X2 : set_vertex,X0 : vertex1] : (closure1(X1,X2,X3,X0) <=> (! [X4 : vertex1] : (~mem(vertex,t2tb1(X4),t2tb(succ1(X0))) | mem(vertex,t2tb1(X4),t2tb(X1))) | mem(vertex,t2tb1(X0),t2tb(X3)) | mem(vertex,t2tb1(X0),t2tb(X2)) | ~mem(vertex,t2tb1(X0),t2tb(X1))))),
0.21/0.45	  inference(flattening,[],[f147])).
0.21/0.45	tff(f147,plain,(
0.21/0.45	  ! [X2 : set_vertex,X3 : set_vertex,X0 : vertex1,X1 : set_vertex] : (closure1(X1,X2,X3,X0) <=> (((! [X4 : vertex1] : (~mem(vertex,t2tb1(X4),t2tb(succ1(X0))) | mem(vertex,t2tb1(X4),t2tb(X1))) | mem(vertex,t2tb1(X0),t2tb(X3))) | mem(vertex,t2tb1(X0),t2tb(X2))) | ~mem(vertex,t2tb1(X0),t2tb(X1))))),
0.21/0.45	  inference(ennf_transformation,[],[f100])).
0.21/0.45	tff(f100,plain,(
0.21/0.45	  ! [X2 : set_vertex,X3 : set_vertex,X0 : vertex1,X1 : set_vertex] : (closure1(X1,X2,X3,X0) <=> (mem(vertex,t2tb1(X0),t2tb(X1)) => (~mem(vertex,t2tb1(X0),t2tb(X2)) => (~mem(vertex,t2tb1(X0),t2tb(X3)) => ! [X4 : vertex1] : (mem(vertex,t2tb1(X4),t2tb(succ1(X0))) => mem(vertex,t2tb1(X4),t2tb(X1)))))))),
0.21/0.45	  inference(rectify,[],[f10])).
0.21/0.45	tff(f10,axiom,(
0.21/0.45	  ! [X2 : vertex1,X14 : set_vertex,X15 : set_vertex,X16 : set_vertex] : (closure1(X14,X15,X16,X2) <=> (mem(vertex,t2tb1(X2),t2tb(X14)) => (~mem(vertex,t2tb1(X2),t2tb(X15)) => (~mem(vertex,t2tb1(X2),t2tb(X16)) => ! [X7 : vertex1] : (mem(vertex,t2tb1(X7),t2tb(succ1(X2))) => mem(vertex,t2tb1(X7),t2tb(X14)))))))),
0.21/0.45	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)).
0.21/0.45	tff(f328,plain,(
0.21/0.45	  ~closure1(sK14,sK15,sK18,sK20)),
0.21/0.45	  inference(forward_demodulation,[],[f251,f249])).
0.21/0.45	tff(f249,plain,(
0.21/0.45	  sK15 = sK17),
0.21/0.45	  inference(cnf_transformation,[],[f180])).
0.21/0.45	tff(f180,plain,(
0.21/0.45	  (~is_empty(vertex,t2tb(sK9)) & (sK6 != sK13 & ! [X9 : vertex1] : (sK13 = X9 | closure1(sK5,sK12,sK8,X9)) & (inv1(sK10,sK6,sK14,sK12,sK15,sK7) & ((true1 = sK16 | ~is_empty(vertex,t2tb(sK12))) & (is_empty(vertex,t2tb(sK12)) | true1 != sK16) & true1 = sK16 & ((($sum(sK7,1) = sK19 & ~closure1(sK14,sK17,sK18,sK20)) & tb2t(empty(vertex)) = sK18) & sK15 = sK17)) & subset(vertex,t2tb(succ1(sK13)),t2tb(sK14)) & ! [X17 : vertex1] : closure1(sK14,sK12,sK15,X17)) & sK12 = tb2t(remove(vertex,t2tb1(sK13),t2tb(sK9))) & mem(vertex,t2tb1(sK13),t2tb(sK9)) & inv1(sK10,sK6,sK5,sK12,sK8,sK7) & shortest_path1(sK10,sK13,sK7)) & true1 != sK11 & (true1 = sK11 | ~is_empty(vertex,t2tb(sK9))) & (is_empty(vertex,t2tb(sK9)) | true1 != sK11)) & (~is_empty(vertex,t2tb(sK9)) | is_empty(vertex,t2tb(sK8))) & ~$less(sK7,0) & inv1(sK10,sK6,sK5,sK9,sK8,sK7) & ! [X18 : vertex1] : closure1(sK5,sK9,sK8,X18)),
0.21/0.45	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8,sK9,sK10,sK11,sK12,sK13,sK14,sK15,sK16,sK17,sK18,sK19,sK20])],[f170,f179,f178,f177,f176,f175,f174,f173,f172,f171])).
0.21/0.45	tff(f171,plain,(
0.21/0.45	  ? [X0 : set_vertex,X1 : vertex1,X2 : $int,X3 : set_vertex,X4 : set_vertex,X5 : vertex1] : (? [X6 : bool1] : (~is_empty(vertex,t2tb(X4)) & ? [X7 : set_vertex,X8 : vertex1] : (X1 != X8 & ! [X9 : vertex1] : (X8 = X9 | closure1(X0,X7,X3,X9)) & ? [X10 : set_vertex,X11 : set_vertex] : (inv1(X5,X1,X10,X7,X11,X2) & ? [X12 : bool1] : ((true1 = X12 | ~is_empty(vertex,t2tb(X7))) & (is_empty(vertex,t2tb(X7)) | true1 != X12) & true1 = X12 & ? [X13 : set_vertex] : (? [X14 : set_vertex] : (? [X15 : $int] : ($sum(X2,1) = X15 & ? [X16 : vertex1] : ~closure1(X10,X13,X14,X16)) & tb2t(empty(vertex)) = X14) & X11 = X13)) & subset(vertex,t2tb(succ1(X8)),t2tb(X10)) & ! [X17 : vertex1] : closure1(X10,X7,X11,X17)) & tb2t(remove(vertex,t2tb1(X8),t2tb(X4))) = X7 & mem(vertex,t2tb1(X8),t2tb(X4)) & inv1(X5,X1,X0,X7,X3,X2) & shortest_path1(X5,X8,X2)) & true1 != X6 & (true1 = X6 | ~is_empty(vertex,t2tb(X4))) & (is_empty(vertex,t2tb(X4)) | true1 != X6)) & (~is_empty(vertex,t2tb(X4)) | is_empty(vertex,t2tb(X3))) & ~$less(X2,0) & inv1(X5,X1,X0,X4,X3,X2) & ! [X18 : vertex1] : closure1(X0,X4,X3,X18)) => (? [X6 : bool1] : (~is_empty(vertex,t2tb(sK9)) & ? [X8 : vertex1,X7 : set_vertex] : (sK6 != X8 & ! [X9 : vertex1] : (X8 = X9 | closure1(sK5,X7,sK8,X9)) & ? [X11 : set_vertex,X10 : set_vertex] : (inv1(sK10,sK6,X10,X7,X11,sK7) & ? [X12 : bool1] : ((true1 = X12 | ~is_empty(vertex,t2tb(X7))) & (is_empty(vertex,t2tb(X7)) | true1 != X12) & true1 = X12 & ? [X13 : set_vertex] : (? [X14 : set_vertex] : (? [X15 : $int] : ($sum(sK7,1) = X15 & ? [X16 : vertex1] : ~closure1(X10,X13,X14,X16)) & tb2t(empty(vertex)) = X14) & X11 = X13)) & subset(vertex,t2tb(succ1(X8)),t2tb(X10)) & ! [X17 : vertex1] : closure1(X10,X7,X11,X17)) & tb2t(remove(vertex,t2tb1(X8),t2tb(sK9))) = X7 & mem(vertex,t2tb1(X8),t2tb(sK9)) & inv1(sK10,sK6,sK5,X7,sK8,sK7) & shortest_path1(sK10,X8,sK7)) & true1 != X6 & (true1 = X6 | ~is_empty(vertex,t2tb(sK9))) & (is_empty(vertex,t2tb(sK9)) | true1 != X6)) & (~is_empty(vertex,t2tb(sK9)) | is_empty(vertex,t2tb(sK8))) & ~$less(sK7,0) & inv1(sK10,sK6,sK5,sK9,sK8,sK7) & ! [X18 : vertex1] : closure1(sK5,sK9,sK8,X18))),
0.21/0.45	  introduced(choice_axiom,[])).
0.21/0.45	tff(f172,plain,(
0.21/0.45	  ? [X6 : bool1] : (~is_empty(vertex,t2tb(sK9)) & ? [X8 : vertex1,X7 : set_vertex] : (sK6 != X8 & ! [X9 : vertex1] : (X8 = X9 | closure1(sK5,X7,sK8,X9)) & ? [X11 : set_vertex,X10 : set_vertex] : (inv1(sK10,sK6,X10,X7,X11,sK7) & ? [X12 : bool1] : ((true1 = X12 | ~is_empty(vertex,t2tb(X7))) & (is_empty(vertex,t2tb(X7)) | true1 != X12) & true1 = X12 & ? [X13 : set_vertex] : (? [X14 : set_vertex] : (? [X15 : $int] : ($sum(sK7,1) = X15 & ? [X16 : vertex1] : ~closure1(X10,X13,X14,X16)) & tb2t(empty(vertex)) = X14) & X11 = X13)) & subset(vertex,t2tb(succ1(X8)),t2tb(X10)) & ! [X17 : vertex1] : closure1(X10,X7,X11,X17)) & tb2t(remove(vertex,t2tb1(X8),t2tb(sK9))) = X7 & mem(vertex,t2tb1(X8),t2tb(sK9)) & inv1(sK10,sK6,sK5,X7,sK8,sK7) & shortest_path1(sK10,X8,sK7)) & true1 != X6 & (true1 = X6 | ~is_empty(vertex,t2tb(sK9))) & (is_empty(vertex,t2tb(sK9)) | true1 != X6)) => (~is_empty(vertex,t2tb(sK9)) & ? [X8 : vertex1,X7 : set_vertex] : (sK6 != X8 & ! [X9 : vertex1] : (X8 = X9 | closure1(sK5,X7,sK8,X9)) & ? [X11 : set_vertex,X10 : set_vertex] : (inv1(sK10,sK6,X10,X7,X11,sK7) & ? [X12 : bool1] : ((true1 = X12 | ~is_empty(vertex,t2tb(X7))) & (is_empty(vertex,t2tb(X7)) | true1 != X12) & true1 = X12 & ? [X13 : set_vertex] : (? [X14 : set_vertex] : (? [X15 : $int] : ($sum(sK7,1) = X15 & ? [X16 : vertex1] : ~closure1(X10,X13,X14,X16)) & tb2t(empty(vertex)) = X14) & X11 = X13)) & subset(vertex,t2tb(succ1(X8)),t2tb(X10)) & ! [X17 : vertex1] : closure1(X10,X7,X11,X17)) & tb2t(remove(vertex,t2tb1(X8),t2tb(sK9))) = X7 & mem(vertex,t2tb1(X8),t2tb(sK9)) & inv1(sK10,sK6,sK5,X7,sK8,sK7) & shortest_path1(sK10,X8,sK7)) & true1 != sK11 & (true1 = sK11 | ~is_empty(vertex,t2tb(sK9))) & (is_empty(vertex,t2tb(sK9)) | true1 != sK11))),
0.21/0.45	  introduced(choice_axiom,[])).
0.21/0.45	tff(f173,plain,(
0.21/0.45	  ? [X8 : vertex1,X7 : set_vertex] : (sK6 != X8 & ! [X9 : vertex1] : (X8 = X9 | closure1(sK5,X7,sK8,X9)) & ? [X11 : set_vertex,X10 : set_vertex] : (inv1(sK10,sK6,X10,X7,X11,sK7) & ? [X12 : bool1] : ((true1 = X12 | ~is_empty(vertex,t2tb(X7))) & (is_empty(vertex,t2tb(X7)) | true1 != X12) & true1 = X12 & ? [X13 : set_vertex] : (? [X14 : set_vertex] : (? [X15 : $int] : ($sum(sK7,1) = X15 & ? [X16 : vertex1] : ~closure1(X10,X13,X14,X16)) & tb2t(empty(vertex)) = X14) & X11 = X13)) & subset(vertex,t2tb(succ1(X8)),t2tb(X10)) & ! [X17 : vertex1] : closure1(X10,X7,X11,X17)) & tb2t(remove(vertex,t2tb1(X8),t2tb(sK9))) = X7 & mem(vertex,t2tb1(X8),t2tb(sK9)) & inv1(sK10,sK6,sK5,X7,sK8,sK7) & shortest_path1(sK10,X8,sK7)) => (sK6 != sK13 & ! [X9 : vertex1] : (sK13 = X9 | closure1(sK5,sK12,sK8,X9)) & ? [X11 : set_vertex,X10 : set_vertex] : (inv1(sK10,sK6,X10,sK12,X11,sK7) & ? [X12 : bool1] : ((true1 = X12 | ~is_empty(vertex,t2tb(sK12))) & (is_empty(vertex,t2tb(sK12)) | true1 != X12) & true1 = X12 & ? [X13 : set_vertex] : (? [X14 : set_vertex] : (? [X15 : $int] : ($sum(sK7,1) = X15 & ? [X16 : vertex1] : ~closure1(X10,X13,X14,X16)) & tb2t(empty(vertex)) = X14) & X11 = X13)) & subset(vertex,t2tb(succ1(sK13)),t2tb(X10)) & ! [X17 : vertex1] : closure1(X10,sK12,X11,X17)) & sK12 = tb2t(remove(vertex,t2tb1(sK13),t2tb(sK9))) & mem(vertex,t2tb1(sK13),t2tb(sK9)) & inv1(sK10,sK6,sK5,sK12,sK8,sK7) & shortest_path1(sK10,sK13,sK7))),
0.21/0.45	  introduced(choice_axiom,[])).
0.21/0.45	tff(f174,plain,(
0.21/0.45	  ? [X11 : set_vertex,X10 : set_vertex] : (inv1(sK10,sK6,X10,sK12,X11,sK7) & ? [X12 : bool1] : ((true1 = X12 | ~is_empty(vertex,t2tb(sK12))) & (is_empty(vertex,t2tb(sK12)) | true1 != X12) & true1 = X12 & ? [X13 : set_vertex] : (? [X14 : set_vertex] : (? [X15 : $int] : ($sum(sK7,1) = X15 & ? [X16 : vertex1] : ~closure1(X10,X13,X14,X16)) & tb2t(empty(vertex)) = X14) & X11 = X13)) & subset(vertex,t2tb(succ1(sK13)),t2tb(X10)) & ! [X17 : vertex1] : closure1(X10,sK12,X11,X17)) => (inv1(sK10,sK6,sK14,sK12,sK15,sK7) & ? [X12 : bool1] : ((true1 = X12 | ~is_empty(vertex,t2tb(sK12))) & (is_empty(vertex,t2tb(sK12)) | true1 != X12) & true1 = X12 & ? [X13 : set_vertex] : (? [X14 : set_vertex] : (? [X15 : $int] : ($sum(sK7,1) = X15 & ? [X16 : vertex1] : ~closure1(sK14,X13,X14,X16)) & tb2t(empty(vertex)) = X14) & sK15 = X13)) & subset(vertex,t2tb(succ1(sK13)),t2tb(sK14)) & ! [X17 : vertex1] : closure1(sK14,sK12,sK15,X17))),
0.21/0.45	  introduced(choice_axiom,[])).
0.21/0.45	tff(f175,plain,(
0.21/0.45	  ? [X12 : bool1] : ((true1 = X12 | ~is_empty(vertex,t2tb(sK12))) & (is_empty(vertex,t2tb(sK12)) | true1 != X12) & true1 = X12 & ? [X13 : set_vertex] : (? [X14 : set_vertex] : (? [X15 : $int] : ($sum(sK7,1) = X15 & ? [X16 : vertex1] : ~closure1(sK14,X13,X14,X16)) & tb2t(empty(vertex)) = X14) & sK15 = X13)) => ((true1 = sK16 | ~is_empty(vertex,t2tb(sK12))) & (is_empty(vertex,t2tb(sK12)) | true1 != sK16) & true1 = sK16 & ? [X13 : set_vertex] : (? [X14 : set_vertex] : (? [X15 : $int] : ($sum(sK7,1) = X15 & ? [X16 : vertex1] : ~closure1(sK14,X13,X14,X16)) & tb2t(empty(vertex)) = X14) & sK15 = X13))),
0.21/0.45	  introduced(choice_axiom,[])).
0.21/0.45	tff(f176,plain,(
0.21/0.45	  ? [X13 : set_vertex] : (? [X14 : set_vertex] : (? [X15 : $int] : ($sum(sK7,1) = X15 & ? [X16 : vertex1] : ~closure1(sK14,X13,X14,X16)) & tb2t(empty(vertex)) = X14) & sK15 = X13) => (? [X14 : set_vertex] : (? [X15 : $int] : ($sum(sK7,1) = X15 & ? [X16 : vertex1] : ~closure1(sK14,sK17,X14,X16)) & tb2t(empty(vertex)) = X14) & sK15 = sK17)),
0.21/0.45	  introduced(choice_axiom,[])).
0.21/0.45	tff(f177,plain,(
0.21/0.45	  ? [X14 : set_vertex] : (? [X15 : $int] : ($sum(sK7,1) = X15 & ? [X16 : vertex1] : ~closure1(sK14,sK17,X14,X16)) & tb2t(empty(vertex)) = X14) => (? [X15 : $int] : ($sum(sK7,1) = X15 & ? [X16 : vertex1] : ~closure1(sK14,sK17,sK18,X16)) & tb2t(empty(vertex)) = sK18)),
0.21/0.45	  introduced(choice_axiom,[])).
0.21/0.45	tff(f178,plain,(
0.21/0.45	  ? [X15 : $int] : ($sum(sK7,1) = X15 & ? [X16 : vertex1] : ~closure1(sK14,sK17,sK18,X16)) => ($sum(sK7,1) = sK19 & ? [X16 : vertex1] : ~closure1(sK14,sK17,sK18,X16))),
0.21/0.45	  introduced(choice_axiom,[])).
0.21/0.45	tff(f179,plain,(
0.21/0.45	  ? [X16 : vertex1] : ~closure1(sK14,sK17,sK18,X16) => ~closure1(sK14,sK17,sK18,sK20)),
0.21/0.45	  introduced(choice_axiom,[])).
0.21/0.45	tff(f170,plain,(
0.21/0.45	  ? [X0 : set_vertex,X1 : vertex1,X2 : $int,X3 : set_vertex,X4 : set_vertex,X5 : vertex1] : (? [X6 : bool1] : (~is_empty(vertex,t2tb(X4)) & ? [X7 : set_vertex,X8 : vertex1] : (X1 != X8 & ! [X9 : vertex1] : (X8 = X9 | closure1(X0,X7,X3,X9)) & ? [X10 : set_vertex,X11 : set_vertex] : (inv1(X5,X1,X10,X7,X11,X2) & ? [X12 : bool1] : ((true1 = X12 | ~is_empty(vertex,t2tb(X7))) & (is_empty(vertex,t2tb(X7)) | true1 != X12) & true1 = X12 & ? [X13 : set_vertex] : (? [X14 : set_vertex] : (? [X15 : $int] : ($sum(X2,1) = X15 & ? [X16 : vertex1] : ~closure1(X10,X13,X14,X16)) & tb2t(empty(vertex)) = X14) & X11 = X13)) & subset(vertex,t2tb(succ1(X8)),t2tb(X10)) & ! [X17 : vertex1] : closure1(X10,X7,X11,X17)) & tb2t(remove(vertex,t2tb1(X8),t2tb(X4))) = X7 & mem(vertex,t2tb1(X8),t2tb(X4)) & inv1(X5,X1,X0,X7,X3,X2) & shortest_path1(X5,X8,X2)) & true1 != X6 & (true1 = X6 | ~is_empty(vertex,t2tb(X4))) & (is_empty(vertex,t2tb(X4)) | true1 != X6)) & (~is_empty(vertex,t2tb(X4)) | is_empty(vertex,t2tb(X3))) & ~$less(X2,0) & inv1(X5,X1,X0,X4,X3,X2) & ! [X18 : vertex1] : closure1(X0,X4,X3,X18))),
0.21/0.45	  inference(rectify,[],[f169])).
0.21/0.45	tff(f169,plain,(
0.21/0.45	  ? [X4 : set_vertex,X2 : vertex1,X5 : $int,X0 : set_vertex,X3 : set_vertex,X1 : vertex1] : (? [X7 : bool1] : (~is_empty(vertex,t2tb(X3)) & ? [X9 : set_vertex,X8 : vertex1] : (X2 != X8 & ! [X10 : vertex1] : (X8 = X10 | closure1(X4,X9,X0,X10)) & ? [X11 : set_vertex,X12 : set_vertex] : (inv1(X1,X2,X11,X9,X12,X5) & ? [X14 : bool1] : ((true1 = X14 | ~is_empty(vertex,t2tb(X9))) & (is_empty(vertex,t2tb(X9)) | true1 != X14) & true1 = X14 & ? [X15 : set_vertex] : (? [X16 : set_vertex] : (? [X17 : $int] : ($sum(X5,1) = X17 & ? [X18 : vertex1] : ~closure1(X11,X15,X16,X18)) & tb2t(empty(vertex)) = X16) & X12 = X15)) & subset(vertex,t2tb(succ1(X8)),t2tb(X11)) & ! [X13 : vertex1] : closure1(X11,X9,X12,X13)) & tb2t(remove(vertex,t2tb1(X8),t2tb(X3))) = X9 & mem(vertex,t2tb1(X8),t2tb(X3)) & inv1(X1,X2,X4,X9,X0,X5) & shortest_path1(X1,X8,X5)) & true1 != X7 & (true1 = X7 | ~is_empty(vertex,t2tb(X3))) & (is_empty(vertex,t2tb(X3)) | true1 != X7)) & (~is_empty(vertex,t2tb(X3)) | is_empty(vertex,t2tb(X0))) & ~$less(X5,0) & inv1(X1,X2,X4,X3,X0,X5) & ! [X6 : vertex1] : closure1(X4,X3,X0,X6))),
0.21/0.45	  inference(flattening,[],[f168])).
0.21/0.45	tff(f168,plain,(
0.21/0.45	  ? [X4 : set_vertex,X2 : vertex1,X5 : $int,X0 : set_vertex,X3 : set_vertex,X1 : vertex1] : (? [X7 : bool1] : (~is_empty(vertex,t2tb(X3)) & ? [X9 : set_vertex,X8 : vertex1] : (X2 != X8 & ! [X10 : vertex1] : (X8 = X10 | closure1(X4,X9,X0,X10)) & ? [X11 : set_vertex,X12 : set_vertex] : (inv1(X1,X2,X11,X9,X12,X5) & ? [X14 : bool1] : (((true1 = X14 | ~is_empty(vertex,t2tb(X9))) & (is_empty(vertex,t2tb(X9)) | true1 != X14)) & true1 = X14 & ? [X15 : set_vertex] : (? [X16 : set_vertex] : (? [X17 : $int] : ($sum(X5,1) = X17 & ? [X18 : vertex1] : ~closure1(X11,X15,X16,X18)) & tb2t(empty(vertex)) = X16) & X12 = X15)) & subset(vertex,t2tb(succ1(X8)),t2tb(X11)) & ! [X13 : vertex1] : closure1(X11,X9,X12,X13)) & tb2t(remove(vertex,t2tb1(X8),t2tb(X3))) = X9 & mem(vertex,t2tb1(X8),t2tb(X3)) & inv1(X1,X2,X4,X9,X0,X5) & shortest_path1(X1,X8,X5)) & true1 != X7 & ((true1 = X7 | ~is_empty(vertex,t2tb(X3))) & (is_empty(vertex,t2tb(X3)) | true1 != X7))) & (~is_empty(vertex,t2tb(X3)) | is_empty(vertex,t2tb(X0))) & ~$less(X5,0) & inv1(X1,X2,X4,X3,X0,X5) & ! [X6 : vertex1] : closure1(X4,X3,X0,X6))),
0.21/0.45	  inference(nnf_transformation,[],[f143])).
0.21/0.45	tff(f143,plain,(
0.21/0.45	  ? [X4 : set_vertex,X2 : vertex1,X5 : $int,X0 : set_vertex,X3 : set_vertex,X1 : vertex1] : (? [X7 : bool1] : (~is_empty(vertex,t2tb(X3)) & ? [X9 : set_vertex,X8 : vertex1] : (X2 != X8 & ! [X10 : vertex1] : (X8 = X10 | closure1(X4,X9,X0,X10)) & ? [X11 : set_vertex,X12 : set_vertex] : (inv1(X1,X2,X11,X9,X12,X5) & ? [X14 : bool1] : ((true1 = X14 <=> is_empty(vertex,t2tb(X9))) & true1 = X14 & ? [X15 : set_vertex] : (? [X16 : set_vertex] : (? [X17 : $int] : ($sum(X5,1) = X17 & ? [X18 : vertex1] : ~closure1(X11,X15,X16,X18)) & tb2t(empty(vertex)) = X16) & X12 = X15)) & subset(vertex,t2tb(succ1(X8)),t2tb(X11)) & ! [X13 : vertex1] : closure1(X11,X9,X12,X13)) & tb2t(remove(vertex,t2tb1(X8),t2tb(X3))) = X9 & mem(vertex,t2tb1(X8),t2tb(X3)) & inv1(X1,X2,X4,X9,X0,X5) & shortest_path1(X1,X8,X5)) & true1 != X7 & (true1 = X7 <=> is_empty(vertex,t2tb(X3)))) & (~is_empty(vertex,t2tb(X3)) | is_empty(vertex,t2tb(X0))) & ~$less(X5,0) & inv1(X1,X2,X4,X3,X0,X5) & ! [X6 : vertex1] : closure1(X4,X3,X0,X6))),
0.21/0.45	  inference(flattening,[],[f142])).
0.21/0.45	tff(f142,plain,(
0.21/0.45	  ? [X5 : $int,X4 : set_vertex,X0 : set_vertex,X3 : set_vertex,X1 : vertex1,X2 : vertex1] : (? [X7 : bool1] : (((? [X8 : vertex1,X9 : set_vertex] : (((? [X11 : set_vertex,X12 : set_vertex] : (? [X14 : bool1] : ((? [X15 : set_vertex] : (? [X16 : set_vertex] : (? [X17 : $int] : ($sum(X5,1) = X17 & ? [X18 : vertex1] : ~closure1(X11,X15,X16,X18)) & tb2t(empty(vertex)) = X16) & X12 = X15) & true1 = X14) & (true1 = X14 <=> is_empty(vertex,t2tb(X9)))) & (! [X13 : vertex1] : closure1(X11,X9,X12,X13) & subset(vertex,t2tb(succ1(X8)),t2tb(X11)) & inv1(X1,X2,X11,X9,X12,X5))) & (inv1(X1,X2,X4,X9,X0,X5) & shortest_path1(X1,X8,X5) & ! [X10 : vertex1] : (X8 = X10 | closure1(X4,X9,X0,X10)))) & X2 != X8) & (tb2t(remove(vertex,t2tb1(X8),t2tb(X3))) = X9 & mem(vertex,t2tb1(X8),t2tb(X3)))) & ~is_empty(vertex,t2tb(X3))) & true1 != X7) & (true1 = X7 <=> is_empty(vertex,t2tb(X3)))) & (inv1(X1,X2,X4,X3,X0,X5) & ~$less(X5,0) & ! [X6 : vertex1] : closure1(X4,X3,X0,X6) & (~is_empty(vertex,t2tb(X3)) | is_empty(vertex,t2tb(X0)))))),
0.21/0.45	  inference(ennf_transformation,[],[f86])).
0.21/0.45	tff(f86,plain,(
0.21/0.45	  ~! [X5 : $int,X4 : set_vertex,X0 : set_vertex,X3 : set_vertex,X1 : vertex1,X2 : vertex1] : ((inv1(X1,X2,X4,X3,X0,X5) & ~$less(X5,0) & ! [X6 : vertex1] : closure1(X4,X3,X0,X6) & (is_empty(vertex,t2tb(X3)) => is_empty(vertex,t2tb(X0)))) => ! [X7 : bool1] : ((true1 = X7 <=> is_empty(vertex,t2tb(X3))) => (true1 != X7 => (~is_empty(vertex,t2tb(X3)) => ! [X8 : vertex1,X9 : set_vertex] : ((tb2t(remove(vertex,t2tb1(X8),t2tb(X3))) = X9 & mem(vertex,t2tb1(X8),t2tb(X3))) => (X2 != X8 => ((inv1(X1,X2,X4,X9,X0,X5) & shortest_path1(X1,X8,X5) & ! [X10 : vertex1] : (X8 != X10 => closure1(X4,X9,X0,X10))) => ! [X11 : set_vertex,X12 : set_vertex] : ((! [X13 : vertex1] : closure1(X11,X9,X12,X13) & subset(vertex,t2tb(succ1(X8)),t2tb(X11)) & inv1(X1,X2,X11,X9,X12,X5)) => ! [X14 : bool1] : ((true1 = X14 <=> is_empty(vertex,t2tb(X9))) => (true1 = X14 => ! [X15 : set_vertex] : (X12 = X15 => ! [X16 : set_vertex] : (tb2t(empty(vertex)) = X16 => ! [X17 : $int] : ($sum(X5,1) = X17 => ! [X18 : vertex1] : closure1(X11,X15,X16,X18))))))))))))))),
0.21/0.45	  inference(rectify,[],[f67])).
0.21/0.45	tff(f67,plain,(
0.21/0.45	  ~! [X16 : set_vertex,X3 : vertex1,X13 : vertex1,X15 : set_vertex,X14 : set_vertex,X17 : $int] : ((~$less(X17,0) & ! [X2 : vertex1] : closure1(X14,X15,X16,X2) & inv1(X3,X13,X14,X15,X16,X17) & (is_empty(vertex,t2tb(X15)) => is_empty(vertex,t2tb(X16)))) => ! [X22 : bool1] : ((is_empty(vertex,t2tb(X15)) <=> true1 = X22) => (true1 != X22 => (~is_empty(vertex,t2tb(X15)) => ! [X24 : vertex1,X23 : set_vertex] : ((mem(vertex,t2tb1(X24),t2tb(X15)) & tb2t(remove(vertex,t2tb1(X24),t2tb(X15))) = X23) => (X13 != X24 => ((shortest_path1(X3,X24,X17) & ! [X2 : vertex1] : (X2 != X24 => closure1(X14,X23,X16,X2)) & inv1(X3,X13,X14,X23,X16,X17)) => ! [X26 : set_vertex,X25 : set_vertex] : ((subset(vertex,t2tb(succ1(X24)),t2tb(X26)) & inv1(X3,X13,X26,X23,X25,X17) & ! [X2 : vertex1] : closure1(X26,X23,X25,X2)) => ! [X27 : bool1] : ((true1 = X27 <=> is_empty(vertex,t2tb(X23))) => (true1 = X27 => ! [X28 : set_vertex] : (X25 = X28 => ! [X29 : set_vertex] : (tb2t(empty(vertex)) = X29 => ! [X30 : $int] : ($sum(X17,1) = X30 => ! [X2 : vertex1] : closure1(X26,X28,X29,X2))))))))))))))),
0.21/0.45	  inference(theory_normalization,[],[f21])).
0.21/0.45	tff(f21,negated_conjecture,(
0.21/0.45	  ~! [X16 : set_vertex,X3 : vertex1,X13 : vertex1,X15 : set_vertex,X14 : set_vertex,X17 : $int] : (($lesseq(0,X17) & ! [X2 : vertex1] : closure1(X14,X15,X16,X2) & inv1(X3,X13,X14,X15,X16,X17) & (is_empty(vertex,t2tb(X15)) => is_empty(vertex,t2tb(X16)))) => ! [X22 : bool1] : ((is_empty(vertex,t2tb(X15)) <=> true1 = X22) => (true1 != X22 => (~is_empty(vertex,t2tb(X15)) => ! [X24 : vertex1,X23 : set_vertex] : ((mem(vertex,t2tb1(X24),t2tb(X15)) & tb2t(remove(vertex,t2tb1(X24),t2tb(X15))) = X23) => (X13 != X24 => ((shortest_path1(X3,X24,X17) & ! [X2 : vertex1] : (X2 != X24 => closure1(X14,X23,X16,X2)) & inv1(X3,X13,X14,X23,X16,X17)) => ! [X26 : set_vertex,X25 : set_vertex] : ((subset(vertex,t2tb(succ1(X24)),t2tb(X26)) & inv1(X3,X13,X26,X23,X25,X17) & ! [X2 : vertex1] : closure1(X26,X23,X25,X2)) => ! [X27 : bool1] : ((true1 = X27 <=> is_empty(vertex,t2tb(X23))) => (true1 = X27 => ! [X28 : set_vertex] : (X25 = X28 => ! [X29 : set_vertex] : (tb2t(empty(vertex)) = X29 => ! [X30 : $int] : ($sum(X17,1) = X30 => ! [X2 : vertex1] : closure1(X26,X28,X29,X2))))))))))))))),
0.21/0.45	  inference(negated_conjecture,[],[f20])).
0.21/0.45	tff(f20,conjecture,(
0.21/0.45	  ! [X16 : set_vertex,X3 : vertex1,X13 : vertex1,X15 : set_vertex,X14 : set_vertex,X17 : $int] : (($lesseq(0,X17) & ! [X2 : vertex1] : closure1(X14,X15,X16,X2) & inv1(X3,X13,X14,X15,X16,X17) & (is_empty(vertex,t2tb(X15)) => is_empty(vertex,t2tb(X16)))) => ! [X22 : bool1] : ((is_empty(vertex,t2tb(X15)) <=> true1 = X22) => (true1 != X22 => (~is_empty(vertex,t2tb(X15)) => ! [X24 : vertex1,X23 : set_vertex] : ((mem(vertex,t2tb1(X24),t2tb(X15)) & tb2t(remove(vertex,t2tb1(X24),t2tb(X15))) = X23) => (X13 != X24 => ((shortest_path1(X3,X24,X17) & ! [X2 : vertex1] : (X2 != X24 => closure1(X14,X23,X16,X2)) & inv1(X3,X13,X14,X23,X16,X17)) => ! [X26 : set_vertex,X25 : set_vertex] : ((subset(vertex,t2tb(succ1(X24)),t2tb(X26)) & inv1(X3,X13,X26,X23,X25,X17) & ! [X2 : vertex1] : closure1(X26,X23,X25,X2)) => ! [X27 : bool1] : ((true1 = X27 <=> is_empty(vertex,t2tb(X23))) => (true1 = X27 => ! [X28 : set_vertex] : (X25 = X28 => ! [X29 : set_vertex] : (tb2t(empty(vertex)) = X29 => ! [X30 : $int] : ($sum(X17,1) = X30 => ! [X2 : vertex1] : closure1(X26,X28,X29,X2))))))))))))))),
0.21/0.45	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)).
0.21/0.45	tff(f251,plain,(
0.21/0.45	  ~closure1(sK14,sK17,sK18,sK20)),
0.21/0.45	  inference(cnf_transformation,[],[f180])).
0.21/0.45	tff(f534,plain,(
0.21/0.45	  ~mem(vertex,t2tb1(sK24(sK14,sK20)),t2tb(succ1(sK20))) | ~spl31_2),
0.21/0.45	  inference(unit_resulting_resolution,[],[f247,f357,f339,f358,f359,f290])).
0.21/0.45	tff(f290,plain,(
0.21/0.45	  ( ! [X2 : set_vertex,X3 : vertex1,X0 : set_vertex,X1 : set_vertex,X5 : vertex1] : (~mem(vertex,t2tb1(X5),t2tb(succ1(X3))) | mem(vertex,t2tb1(X5),t2tb(X1)) | ~closure1(X1,X2,X0,X3) | ~mem(vertex,t2tb1(X3),t2tb(X1)) | mem(vertex,t2tb1(X3),t2tb(X2)) | mem(vertex,t2tb1(X3),t2tb(X0))) )),
0.21/0.45	  inference(cnf_transformation,[],[f205])).
0.21/0.45	tff(f359,plain,(
0.21/0.45	  ~mem(vertex,t2tb1(sK24(sK14,sK20)),t2tb(sK14))),
0.21/0.45	  inference(unit_resulting_resolution,[],[f328,f294])).
0.21/0.45	tff(f294,plain,(
0.21/0.45	  ( ! [X2 : set_vertex,X3 : vertex1,X0 : set_vertex,X1 : set_vertex] : (~mem(vertex,t2tb1(sK24(X1,X3)),t2tb(X1)) | closure1(X1,X2,X0,X3)) )),
0.21/0.45	  inference(cnf_transformation,[],[f205])).
0.21/0.45	tff(f358,plain,(
0.21/0.45	  mem(vertex,t2tb1(sK20),t2tb(sK14))),
0.21/0.45	  inference(unit_resulting_resolution,[],[f328,f291])).
0.21/0.45	tff(f291,plain,(
0.21/0.45	  ( ! [X2 : set_vertex,X3 : vertex1,X0 : set_vertex,X1 : set_vertex] : (closure1(X1,X2,X0,X3) | mem(vertex,t2tb1(X3),t2tb(X1))) )),
0.21/0.45	  inference(cnf_transformation,[],[f205])).
0.21/0.45	tff(f339,plain,(
0.21/0.45	  ( ! [X0 : uni] : (~mem(vertex,X0,t2tb(sK12))) ) | ~spl31_2),
0.21/0.45	  inference(unit_resulting_resolution,[],[f317,f277])).
0.21/0.45	tff(f277,plain,(
0.21/0.45	  ( ! [X3 : uni,X0 : ty,X1 : uni] : (~mem(X0,X3,X1) | ~is_empty(X0,X1)) )),
0.21/0.45	  inference(cnf_transformation,[],[f195])).
0.21/0.45	tff(f195,plain,(
0.21/0.45	  ! [X0 : ty,X1 : uni] : (((mem(X0,sK22(X0,X1),X1) & sort1(X0,sK22(X0,X1))) | is_empty(X0,X1)) & (! [X3 : uni] : ~mem(X0,X3,X1) | ~is_empty(X0,X1)))),
0.21/0.45	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK22])],[f193,f194])).
0.21/0.45	tff(f194,plain,(
0.21/0.45	  ! [X0 : ty,X1 : uni] : (? [X2 : uni] : (mem(X0,X2,X1) & sort1(X0,X2)) => (mem(X0,sK22(X0,X1),X1) & sort1(X0,sK22(X0,X1))))),
0.21/0.45	  introduced(choice_axiom,[])).
0.21/0.45	tff(f193,plain,(
0.21/0.45	  ! [X0 : ty,X1 : uni] : ((? [X2 : uni] : (mem(X0,X2,X1) & sort1(X0,X2)) | is_empty(X0,X1)) & (! [X3 : uni] : ~mem(X0,X3,X1) | ~is_empty(X0,X1)))),
0.21/0.45	  inference(rectify,[],[f139])).
0.21/0.45	tff(f139,plain,(
0.21/0.45	  ! [X0 : ty,X1 : uni] : ((? [X3 : uni] : (mem(X0,X3,X1) & sort1(X0,X3)) | is_empty(X0,X1)) & (! [X2 : uni] : ~mem(X0,X2,X1) | ~is_empty(X0,X1)))),
0.21/0.45	  inference(ennf_transformation,[],[f98])).
0.21/0.45	tff(f98,plain,(
0.21/0.45	  ! [X1 : uni,X0 : ty] : ((is_empty(X0,X1) => ! [X2 : uni] : ~mem(X0,X2,X1)) & (! [X3 : uni] : (sort1(X0,X3) => ~mem(X0,X3,X1)) => is_empty(X0,X1)))),
0.21/0.45	  inference(rectify,[],[f36])).
0.21/0.45	tff(f36,axiom,(
0.21/0.45	  ! [X0 : ty,X3 : uni] : ((is_empty(X0,X3) => ! [X2 : uni] : ~mem(X0,X2,X3)) & (! [X2 : uni] : (sort1(X0,X2) => ~mem(X0,X2,X3)) => is_empty(X0,X3)))),
0.21/0.45	  file('/export/starexec/sandbox/benchmark/theBenchmark.p',unknown)).
0.21/0.45	tff(f317,plain,(
0.21/0.45	  is_empty(vertex,t2tb(sK12)) | ~spl31_2),
0.21/0.45	  inference(avatar_component_clause,[],[f315])).
0.21/0.45	tff(f315,plain,(
0.21/0.45	  spl31_2 <=> is_empty(vertex,t2tb(sK12))),
0.21/0.45	  introduced(avatar_definition,[new_symbols(naming,[spl31_2])])).
0.21/0.45	tff(f357,plain,(
0.21/0.45	  ~mem(vertex,t2tb1(sK20),t2tb(sK15))),
0.21/0.45	  inference(unit_resulting_resolution,[],[f328,f292])).
0.21/0.45	tff(f292,plain,(
0.21/0.45	  ( ! [X2 : set_vertex,X3 : vertex1,X0 : set_vertex,X1 : set_vertex] : (~mem(vertex,t2tb1(X3),t2tb(X2)) | closure1(X1,X2,X0,X3)) )),
0.21/0.45	  inference(cnf_transformation,[],[f205])).
0.21/0.45	tff(f247,plain,(
0.21/0.45	  ( ! [X17 : vertex1] : (closure1(sK14,sK12,sK15,X17)) )),
0.21/0.45	  inference(cnf_transformation,[],[f180])).
0.21/0.45	tff(f330,plain,(
0.21/0.45	  spl31_1),
0.21/0.45	  inference(avatar_split_clause,[],[f253,f311])).
0.21/0.45	tff(f311,plain,(
0.21/0.45	  spl31_1 <=> true1 = sK16),
0.21/0.45	  introduced(avatar_definition,[new_symbols(naming,[spl31_1])])).
0.21/0.45	tff(f253,plain,(
0.21/0.45	  true1 = sK16),
0.21/0.45	  inference(cnf_transformation,[],[f180])).
0.21/0.45	tff(f318,plain,(
0.21/0.45	  ~spl31_1 | spl31_2),
0.21/0.45	  inference(avatar_split_clause,[],[f254,f315,f311])).
0.21/0.45	tff(f254,plain,(
0.21/0.45	  true1 != sK16 | is_empty(vertex,t2tb(sK12))),
0.21/0.45	  inference(cnf_transformation,[],[f180])).
0.21/0.45	% SZS output end Proof for theBenchmark
0.21/0.45	% (9460)------------------------------
0.21/0.45	% (9460)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
0.21/0.45	% (9460)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
0.21/0.45	% (9460)Termination reason: Refutation
0.21/0.45	
0.21/0.45	% (9460)Memory used [KB]: 1275
0.21/0.45	% (9460)Time elapsed: 0.024 s
0.21/0.45	% (9460)Instructions burned: 33 (million)
0.21/0.45	% (9460)------------------------------
0.21/0.45	% (9460)------------------------------
0.21/0.45	% (9453)Success in time 0.082 s
0.21/0.45	EOF