TSTP Solution File: SET787-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SET787-1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 20 05:08:01 EDT 2022
% Result : Unsatisfiable 0.19s 0.39s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET787-1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Sep 3 08:12:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.34 Usage: tptp [options] [-file:]file
% 0.13/0.34 -h, -? prints this message.
% 0.13/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.34 -m, -model generate model.
% 0.13/0.34 -p, -proof generate proof.
% 0.13/0.34 -c, -core generate unsat core of named formulas.
% 0.13/0.34 -st, -statistics display statistics.
% 0.13/0.34 -t:timeout set timeout (in second).
% 0.13/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.34 -<param>:<value> configuration parameter and value.
% 0.13/0.34 -o:<output-file> file to place output in.
% 0.19/0.39 % SZS status Unsatisfiable
% 0.19/0.39 % SZS output start Proof
% 0.19/0.39 tff(member_type, type, (
% 0.19/0.39 member: ( $i * $i ) > $o)).
% 0.19/0.39 tff(unionE_sk1_type, type, (
% 0.19/0.39 unionE_sk1: ( $i * $i ) > $i)).
% 0.19/0.39 tff(cons_type, type, (
% 0.19/0.39 cons: ( $i * $i ) > $i)).
% 0.19/0.39 tff(eptset_type, type, (
% 0.19/0.39 eptset: $i)).
% 0.19/0.39 tff(b_type, type, (
% 0.19/0.39 b: $i)).
% 0.19/0.39 tff(a_type, type, (
% 0.19/0.39 a: $i)).
% 0.19/0.39 tff(sk2_type, type, (
% 0.19/0.39 sk2: $i)).
% 0.19/0.39 tff(un_type, type, (
% 0.19/0.39 un: ( $i * $i ) > $i)).
% 0.19/0.39 tff(union_type, type, (
% 0.19/0.39 union: $i > $i)).
% 0.19/0.39 tff(1,assumption,(member(unionE_sk1(sk2, cons(a, cons(b, eptset))), eptset)), introduced(assumption)).
% 0.19/0.39 tff(2,plain,
% 0.19/0.39 (^[X: $i] : refl((~member(X, eptset)) <=> (~member(X, eptset)))),
% 0.19/0.39 inference(bind,[status(th)],[])).
% 0.19/0.39 tff(3,plain,
% 0.19/0.39 (![X: $i] : (~member(X, eptset)) <=> ![X: $i] : (~member(X, eptset))),
% 0.19/0.39 inference(quant_intro,[status(thm)],[2])).
% 0.19/0.39 tff(4,plain,
% 0.19/0.39 (![X: $i] : (~member(X, eptset)) <=> ![X: $i] : (~member(X, eptset))),
% 0.19/0.39 inference(rewrite,[status(thm)],[])).
% 0.19/0.39 tff(5,axiom,(![X: $i] : (~member(X, eptset))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','clause158')).
% 0.19/0.39 tff(6,plain,
% 0.19/0.39 (![X: $i] : (~member(X, eptset))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[5, 4])).
% 0.19/0.39 tff(7,plain,(
% 0.19/0.39 ![X: $i] : (~member(X, eptset))),
% 0.19/0.39 inference(skolemize,[status(sab)],[6])).
% 0.19/0.39 tff(8,plain,
% 0.19/0.39 (![X: $i] : (~member(X, eptset))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[7, 3])).
% 0.19/0.39 tff(9,plain,
% 0.19/0.39 ((~![X: $i] : (~member(X, eptset))) | (~member(unionE_sk1(sk2, cons(a, cons(b, eptset))), eptset))),
% 0.19/0.39 inference(quant_inst,[status(thm)],[])).
% 0.19/0.39 tff(10,plain,
% 0.19/0.39 ($false),
% 0.19/0.39 inference(unit_resolution,[status(thm)],[9, 8, 1])).
% 0.19/0.39 tff(11,plain,(~member(unionE_sk1(sk2, cons(a, cons(b, eptset))), eptset)), inference(lemma,lemma(discharge,[]))).
% 0.19/0.39 tff(12,assumption,(unionE_sk1(sk2, cons(a, cons(b, eptset))) = b), introduced(assumption)).
% 0.19/0.39 tff(13,plain,
% 0.19/0.39 (member(sk2, unionE_sk1(sk2, cons(a, cons(b, eptset)))) <=> member(sk2, b)),
% 0.19/0.39 inference(monotonicity,[status(thm)],[12])).
% 0.19/0.39 tff(14,plain,
% 0.19/0.39 (member(sk2, b) <=> member(sk2, unionE_sk1(sk2, cons(a, cons(b, eptset))))),
% 0.19/0.39 inference(symmetry,[status(thm)],[13])).
% 0.19/0.39 tff(15,plain,
% 0.19/0.39 ((~member(sk2, b)) <=> (~member(sk2, unionE_sk1(sk2, cons(a, cons(b, eptset)))))),
% 0.19/0.39 inference(monotonicity,[status(thm)],[14])).
% 0.19/0.39 tff(16,plain,
% 0.19/0.39 ((~member(sk2, un(a, b))) <=> (~member(sk2, un(a, b)))),
% 0.19/0.39 inference(rewrite,[status(thm)],[])).
% 0.19/0.39 tff(17,axiom,(~member(sk2, un(a, b))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','un_eq_Union_2_c2')).
% 0.19/0.39 tff(18,plain,
% 0.19/0.39 (~member(sk2, un(a, b))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[17, 16])).
% 0.19/0.39 tff(19,plain,
% 0.19/0.39 (^[B: $i, A: $i, C: $i] : refl(((~member(C, B)) | member(C, un(A, B))) <=> ((~member(C, B)) | member(C, un(A, B))))),
% 0.19/0.39 inference(bind,[status(th)],[])).
% 0.19/0.39 tff(20,plain,
% 0.19/0.39 (![B: $i, A: $i, C: $i] : ((~member(C, B)) | member(C, un(A, B))) <=> ![B: $i, A: $i, C: $i] : ((~member(C, B)) | member(C, un(A, B)))),
% 0.19/0.39 inference(quant_intro,[status(thm)],[19])).
% 0.19/0.39 tff(21,plain,
% 0.19/0.39 (![B: $i, A: $i, C: $i] : ((~member(C, B)) | member(C, un(A, B))) <=> ![B: $i, A: $i, C: $i] : ((~member(C, B)) | member(C, un(A, B)))),
% 0.19/0.39 inference(rewrite,[status(thm)],[])).
% 0.19/0.39 tff(22,axiom,(![B: $i, A: $i, C: $i] : ((~member(C, B)) | member(C, un(A, B)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','unI2')).
% 0.19/0.39 tff(23,plain,
% 0.19/0.39 (![B: $i, A: $i, C: $i] : ((~member(C, B)) | member(C, un(A, B)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[22, 21])).
% 0.19/0.39 tff(24,plain,(
% 0.19/0.39 ![B: $i, A: $i, C: $i] : ((~member(C, B)) | member(C, un(A, B)))),
% 0.19/0.39 inference(skolemize,[status(sab)],[23])).
% 0.19/0.39 tff(25,plain,
% 0.19/0.39 (![B: $i, A: $i, C: $i] : ((~member(C, B)) | member(C, un(A, B)))),
% 0.19/0.39 inference(modus_ponens,[status(thm)],[24, 20])).
% 0.19/0.39 tff(26,plain,
% 0.19/0.39 (((~![B: $i, A: $i, C: $i] : ((~member(C, B)) | member(C, un(A, B)))) | ((~member(sk2, b)) | member(sk2, un(a, b)))) <=> ((~![B: $i, A: $i, C: $i] : ((~member(C, B)) | member(C, un(A, B)))) | (~member(sk2, b)) | member(sk2, un(a, b)))),
% 0.19/0.39 inference(rewrite,[status(thm)],[])).
% 0.19/0.39 tff(27,plain,
% 0.19/0.39 ((~![B: $i, A: $i, C: $i] : ((~member(C, B)) | member(C, un(A, B)))) | ((~member(sk2, b)) | member(sk2, un(a, b)))),
% 0.19/0.40 inference(quant_inst,[status(thm)],[])).
% 0.19/0.40 tff(28,plain,
% 0.19/0.40 ((~![B: $i, A: $i, C: $i] : ((~member(C, B)) | member(C, un(A, B)))) | (~member(sk2, b)) | member(sk2, un(a, b))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[27, 26])).
% 0.19/0.40 tff(29,plain,
% 0.19/0.40 (~member(sk2, b)),
% 0.19/0.40 inference(unit_resolution,[status(thm)],[28, 25, 18])).
% 0.19/0.40 tff(30,plain,
% 0.19/0.40 (~member(sk2, unionE_sk1(sk2, cons(a, cons(b, eptset))))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[29, 15])).
% 0.19/0.40 tff(31,plain,
% 0.19/0.40 (member(sk2, union(cons(a, cons(b, eptset)))) <=> member(sk2, union(cons(a, cons(b, eptset))))),
% 0.19/0.40 inference(rewrite,[status(thm)],[])).
% 0.19/0.40 tff(32,axiom,(member(sk2, union(cons(a, cons(b, eptset))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','un_eq_Union_2_c1')).
% 0.19/0.40 tff(33,plain,
% 0.19/0.40 (member(sk2, union(cons(a, cons(b, eptset))))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[32, 31])).
% 0.19/0.40 tff(34,plain,
% 0.19/0.40 (^[V: $i, U: $i] : refl(((~member(U, union(V))) | member(U, unionE_sk1(U, V))) <=> ((~member(U, union(V))) | member(U, unionE_sk1(U, V))))),
% 0.19/0.40 inference(bind,[status(th)],[])).
% 0.19/0.40 tff(35,plain,
% 0.19/0.40 (![V: $i, U: $i] : ((~member(U, union(V))) | member(U, unionE_sk1(U, V))) <=> ![V: $i, U: $i] : ((~member(U, union(V))) | member(U, unionE_sk1(U, V)))),
% 0.19/0.40 inference(quant_intro,[status(thm)],[34])).
% 0.19/0.40 tff(36,plain,
% 0.19/0.40 (![V: $i, U: $i] : ((~member(U, union(V))) | member(U, unionE_sk1(U, V))) <=> ![V: $i, U: $i] : ((~member(U, union(V))) | member(U, unionE_sk1(U, V)))),
% 0.19/0.40 inference(rewrite,[status(thm)],[])).
% 0.19/0.40 tff(37,axiom,(![V: $i, U: $i] : ((~member(U, union(V))) | member(U, unionE_sk1(U, V)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','clause119')).
% 0.19/0.40 tff(38,plain,
% 0.19/0.40 (![V: $i, U: $i] : ((~member(U, union(V))) | member(U, unionE_sk1(U, V)))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[37, 36])).
% 0.19/0.40 tff(39,plain,(
% 0.19/0.40 ![V: $i, U: $i] : ((~member(U, union(V))) | member(U, unionE_sk1(U, V)))),
% 0.19/0.40 inference(skolemize,[status(sab)],[38])).
% 0.19/0.40 tff(40,plain,
% 0.19/0.40 (![V: $i, U: $i] : ((~member(U, union(V))) | member(U, unionE_sk1(U, V)))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[39, 35])).
% 0.19/0.40 tff(41,plain,
% 0.19/0.40 (((~![V: $i, U: $i] : ((~member(U, union(V))) | member(U, unionE_sk1(U, V)))) | ((~member(sk2, union(cons(a, cons(b, eptset))))) | member(sk2, unionE_sk1(sk2, cons(a, cons(b, eptset)))))) <=> ((~![V: $i, U: $i] : ((~member(U, union(V))) | member(U, unionE_sk1(U, V)))) | (~member(sk2, union(cons(a, cons(b, eptset))))) | member(sk2, unionE_sk1(sk2, cons(a, cons(b, eptset)))))),
% 0.19/0.40 inference(rewrite,[status(thm)],[])).
% 0.19/0.40 tff(42,plain,
% 0.19/0.40 ((~![V: $i, U: $i] : ((~member(U, union(V))) | member(U, unionE_sk1(U, V)))) | ((~member(sk2, union(cons(a, cons(b, eptset))))) | member(sk2, unionE_sk1(sk2, cons(a, cons(b, eptset)))))),
% 0.19/0.40 inference(quant_inst,[status(thm)],[])).
% 0.19/0.40 tff(43,plain,
% 0.19/0.40 ((~![V: $i, U: $i] : ((~member(U, union(V))) | member(U, unionE_sk1(U, V)))) | (~member(sk2, union(cons(a, cons(b, eptset))))) | member(sk2, unionE_sk1(sk2, cons(a, cons(b, eptset))))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[42, 41])).
% 0.19/0.40 tff(44,plain,
% 0.19/0.40 (member(sk2, unionE_sk1(sk2, cons(a, cons(b, eptset))))),
% 0.19/0.40 inference(unit_resolution,[status(thm)],[43, 40, 33])).
% 0.19/0.40 tff(45,plain,
% 0.19/0.40 ($false),
% 0.19/0.40 inference(unit_resolution,[status(thm)],[44, 30])).
% 0.19/0.40 tff(46,plain,(~(unionE_sk1(sk2, cons(a, cons(b, eptset))) = b)), inference(lemma,lemma(discharge,[]))).
% 0.19/0.40 tff(47,assumption,(member(unionE_sk1(sk2, cons(a, cons(b, eptset))), cons(b, eptset))), introduced(assumption)).
% 0.19/0.40 tff(48,plain,
% 0.19/0.40 (^[W: $i, V: $i, U: $i] : refl((member(U, W) | (U = V) | (~member(U, cons(V, W)))) <=> (member(U, W) | (U = V) | (~member(U, cons(V, W)))))),
% 0.19/0.40 inference(bind,[status(th)],[])).
% 0.19/0.40 tff(49,plain,
% 0.19/0.40 (![W: $i, V: $i, U: $i] : (member(U, W) | (U = V) | (~member(U, cons(V, W)))) <=> ![W: $i, V: $i, U: $i] : (member(U, W) | (U = V) | (~member(U, cons(V, W))))),
% 0.19/0.40 inference(quant_intro,[status(thm)],[48])).
% 0.19/0.40 tff(50,plain,
% 0.19/0.40 (![W: $i, V: $i, U: $i] : (member(U, W) | (U = V) | (~member(U, cons(V, W)))) <=> ![W: $i, V: $i, U: $i] : (member(U, W) | (U = V) | (~member(U, cons(V, W))))),
% 0.19/0.40 inference(rewrite,[status(thm)],[])).
% 0.19/0.40 tff(51,plain,
% 0.19/0.40 (^[W: $i, V: $i, U: $i] : rewrite((((~member(U, cons(V, W))) | (U = V)) | member(U, W)) <=> (member(U, W) | (U = V) | (~member(U, cons(V, W)))))),
% 0.19/0.40 inference(bind,[status(th)],[])).
% 0.19/0.40 tff(52,plain,
% 0.19/0.40 (![W: $i, V: $i, U: $i] : (((~member(U, cons(V, W))) | (U = V)) | member(U, W)) <=> ![W: $i, V: $i, U: $i] : (member(U, W) | (U = V) | (~member(U, cons(V, W))))),
% 0.19/0.40 inference(quant_intro,[status(thm)],[51])).
% 0.19/0.40 tff(53,axiom,(![W: $i, V: $i, U: $i] : (((~member(U, cons(V, W))) | (U = V)) | member(U, W))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','clause112')).
% 0.19/0.40 tff(54,plain,
% 0.19/0.40 (![W: $i, V: $i, U: $i] : (member(U, W) | (U = V) | (~member(U, cons(V, W))))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[53, 52])).
% 0.19/0.40 tff(55,plain,
% 0.19/0.40 (![W: $i, V: $i, U: $i] : (member(U, W) | (U = V) | (~member(U, cons(V, W))))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[54, 50])).
% 0.19/0.40 tff(56,plain,(
% 0.19/0.40 ![W: $i, V: $i, U: $i] : (member(U, W) | (U = V) | (~member(U, cons(V, W))))),
% 0.19/0.40 inference(skolemize,[status(sab)],[55])).
% 0.19/0.40 tff(57,plain,
% 0.19/0.40 (![W: $i, V: $i, U: $i] : (member(U, W) | (U = V) | (~member(U, cons(V, W))))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[56, 49])).
% 0.19/0.40 tff(58,plain,
% 0.19/0.40 (((~![W: $i, V: $i, U: $i] : (member(U, W) | (U = V) | (~member(U, cons(V, W))))) | (member(unionE_sk1(sk2, cons(a, cons(b, eptset))), eptset) | (unionE_sk1(sk2, cons(a, cons(b, eptset))) = b) | (~member(unionE_sk1(sk2, cons(a, cons(b, eptset))), cons(b, eptset))))) <=> ((~![W: $i, V: $i, U: $i] : (member(U, W) | (U = V) | (~member(U, cons(V, W))))) | member(unionE_sk1(sk2, cons(a, cons(b, eptset))), eptset) | (unionE_sk1(sk2, cons(a, cons(b, eptset))) = b) | (~member(unionE_sk1(sk2, cons(a, cons(b, eptset))), cons(b, eptset))))),
% 0.19/0.40 inference(rewrite,[status(thm)],[])).
% 0.19/0.40 tff(59,plain,
% 0.19/0.40 ((~![W: $i, V: $i, U: $i] : (member(U, W) | (U = V) | (~member(U, cons(V, W))))) | (member(unionE_sk1(sk2, cons(a, cons(b, eptset))), eptset) | (unionE_sk1(sk2, cons(a, cons(b, eptset))) = b) | (~member(unionE_sk1(sk2, cons(a, cons(b, eptset))), cons(b, eptset))))),
% 0.19/0.40 inference(quant_inst,[status(thm)],[])).
% 0.19/0.40 tff(60,plain,
% 0.19/0.40 ((~![W: $i, V: $i, U: $i] : (member(U, W) | (U = V) | (~member(U, cons(V, W))))) | member(unionE_sk1(sk2, cons(a, cons(b, eptset))), eptset) | (unionE_sk1(sk2, cons(a, cons(b, eptset))) = b) | (~member(unionE_sk1(sk2, cons(a, cons(b, eptset))), cons(b, eptset)))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[59, 58])).
% 0.19/0.40 tff(61,plain,
% 0.19/0.40 ($false),
% 0.19/0.40 inference(unit_resolution,[status(thm)],[60, 57, 47, 46, 11])).
% 0.19/0.40 tff(62,plain,(~member(unionE_sk1(sk2, cons(a, cons(b, eptset))), cons(b, eptset))), inference(lemma,lemma(discharge,[]))).
% 0.19/0.40 tff(63,plain,
% 0.19/0.40 (^[V: $i, U: $i] : refl(((~member(U, union(V))) | member(unionE_sk1(U, V), V)) <=> ((~member(U, union(V))) | member(unionE_sk1(U, V), V)))),
% 0.19/0.40 inference(bind,[status(th)],[])).
% 0.19/0.40 tff(64,plain,
% 0.19/0.40 (![V: $i, U: $i] : ((~member(U, union(V))) | member(unionE_sk1(U, V), V)) <=> ![V: $i, U: $i] : ((~member(U, union(V))) | member(unionE_sk1(U, V), V))),
% 0.19/0.40 inference(quant_intro,[status(thm)],[63])).
% 0.19/0.40 tff(65,plain,
% 0.19/0.40 (![V: $i, U: $i] : ((~member(U, union(V))) | member(unionE_sk1(U, V), V)) <=> ![V: $i, U: $i] : ((~member(U, union(V))) | member(unionE_sk1(U, V), V))),
% 0.19/0.40 inference(rewrite,[status(thm)],[])).
% 0.19/0.40 tff(66,axiom,(![V: $i, U: $i] : ((~member(U, union(V))) | member(unionE_sk1(U, V), V))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','clause120')).
% 0.19/0.40 tff(67,plain,
% 0.19/0.40 (![V: $i, U: $i] : ((~member(U, union(V))) | member(unionE_sk1(U, V), V))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[66, 65])).
% 0.19/0.40 tff(68,plain,(
% 0.19/0.40 ![V: $i, U: $i] : ((~member(U, union(V))) | member(unionE_sk1(U, V), V))),
% 0.19/0.40 inference(skolemize,[status(sab)],[67])).
% 0.19/0.40 tff(69,plain,
% 0.19/0.40 (![V: $i, U: $i] : ((~member(U, union(V))) | member(unionE_sk1(U, V), V))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[68, 64])).
% 0.19/0.40 tff(70,plain,
% 0.19/0.40 (((~![V: $i, U: $i] : ((~member(U, union(V))) | member(unionE_sk1(U, V), V))) | ((~member(sk2, union(cons(a, cons(b, eptset))))) | member(unionE_sk1(sk2, cons(a, cons(b, eptset))), cons(a, cons(b, eptset))))) <=> ((~![V: $i, U: $i] : ((~member(U, union(V))) | member(unionE_sk1(U, V), V))) | (~member(sk2, union(cons(a, cons(b, eptset))))) | member(unionE_sk1(sk2, cons(a, cons(b, eptset))), cons(a, cons(b, eptset))))),
% 0.19/0.40 inference(rewrite,[status(thm)],[])).
% 0.19/0.40 tff(71,plain,
% 0.19/0.40 ((~![V: $i, U: $i] : ((~member(U, union(V))) | member(unionE_sk1(U, V), V))) | ((~member(sk2, union(cons(a, cons(b, eptset))))) | member(unionE_sk1(sk2, cons(a, cons(b, eptset))), cons(a, cons(b, eptset))))),
% 0.19/0.40 inference(quant_inst,[status(thm)],[])).
% 0.19/0.40 tff(72,plain,
% 0.19/0.40 ((~![V: $i, U: $i] : ((~member(U, union(V))) | member(unionE_sk1(U, V), V))) | (~member(sk2, union(cons(a, cons(b, eptset))))) | member(unionE_sk1(sk2, cons(a, cons(b, eptset))), cons(a, cons(b, eptset)))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[71, 70])).
% 0.19/0.40 tff(73,plain,
% 0.19/0.40 (member(unionE_sk1(sk2, cons(a, cons(b, eptset))), cons(a, cons(b, eptset)))),
% 0.19/0.40 inference(unit_resolution,[status(thm)],[72, 69, 33])).
% 0.19/0.40 tff(74,plain,
% 0.19/0.40 (((~![W: $i, V: $i, U: $i] : (member(U, W) | (U = V) | (~member(U, cons(V, W))))) | (member(unionE_sk1(sk2, cons(a, cons(b, eptset))), cons(b, eptset)) | (unionE_sk1(sk2, cons(a, cons(b, eptset))) = a) | (~member(unionE_sk1(sk2, cons(a, cons(b, eptset))), cons(a, cons(b, eptset)))))) <=> ((~![W: $i, V: $i, U: $i] : (member(U, W) | (U = V) | (~member(U, cons(V, W))))) | member(unionE_sk1(sk2, cons(a, cons(b, eptset))), cons(b, eptset)) | (unionE_sk1(sk2, cons(a, cons(b, eptset))) = a) | (~member(unionE_sk1(sk2, cons(a, cons(b, eptset))), cons(a, cons(b, eptset)))))),
% 0.19/0.40 inference(rewrite,[status(thm)],[])).
% 0.19/0.40 tff(75,plain,
% 0.19/0.40 ((~![W: $i, V: $i, U: $i] : (member(U, W) | (U = V) | (~member(U, cons(V, W))))) | (member(unionE_sk1(sk2, cons(a, cons(b, eptset))), cons(b, eptset)) | (unionE_sk1(sk2, cons(a, cons(b, eptset))) = a) | (~member(unionE_sk1(sk2, cons(a, cons(b, eptset))), cons(a, cons(b, eptset)))))),
% 0.19/0.40 inference(quant_inst,[status(thm)],[])).
% 0.19/0.40 tff(76,plain,
% 0.19/0.40 ((~![W: $i, V: $i, U: $i] : (member(U, W) | (U = V) | (~member(U, cons(V, W))))) | member(unionE_sk1(sk2, cons(a, cons(b, eptset))), cons(b, eptset)) | (unionE_sk1(sk2, cons(a, cons(b, eptset))) = a) | (~member(unionE_sk1(sk2, cons(a, cons(b, eptset))), cons(a, cons(b, eptset))))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[75, 74])).
% 0.19/0.40 tff(77,plain,
% 0.19/0.40 (member(unionE_sk1(sk2, cons(a, cons(b, eptset))), cons(b, eptset)) | (unionE_sk1(sk2, cons(a, cons(b, eptset))) = a)),
% 0.19/0.40 inference(unit_resolution,[status(thm)],[76, 57, 73])).
% 0.19/0.40 tff(78,plain,
% 0.19/0.40 (unionE_sk1(sk2, cons(a, cons(b, eptset))) = a),
% 0.19/0.40 inference(unit_resolution,[status(thm)],[77, 62])).
% 0.19/0.40 tff(79,plain,
% 0.19/0.40 (member(sk2, unionE_sk1(sk2, cons(a, cons(b, eptset)))) <=> member(sk2, a)),
% 0.19/0.40 inference(monotonicity,[status(thm)],[78])).
% 0.19/0.40 tff(80,plain,
% 0.19/0.40 (member(sk2, a) <=> member(sk2, unionE_sk1(sk2, cons(a, cons(b, eptset))))),
% 0.19/0.40 inference(symmetry,[status(thm)],[79])).
% 0.19/0.40 tff(81,plain,
% 0.19/0.40 ((~member(sk2, a)) <=> (~member(sk2, unionE_sk1(sk2, cons(a, cons(b, eptset)))))),
% 0.19/0.40 inference(monotonicity,[status(thm)],[80])).
% 0.19/0.40 tff(82,plain,
% 0.19/0.40 (^[B: $i, A: $i, C: $i] : refl(((~member(C, A)) | member(C, un(A, B))) <=> ((~member(C, A)) | member(C, un(A, B))))),
% 0.19/0.40 inference(bind,[status(th)],[])).
% 0.19/0.40 tff(83,plain,
% 0.19/0.40 (![B: $i, A: $i, C: $i] : ((~member(C, A)) | member(C, un(A, B))) <=> ![B: $i, A: $i, C: $i] : ((~member(C, A)) | member(C, un(A, B)))),
% 0.19/0.40 inference(quant_intro,[status(thm)],[82])).
% 0.19/0.40 tff(84,plain,
% 0.19/0.40 (![B: $i, A: $i, C: $i] : ((~member(C, A)) | member(C, un(A, B))) <=> ![B: $i, A: $i, C: $i] : ((~member(C, A)) | member(C, un(A, B)))),
% 0.19/0.40 inference(rewrite,[status(thm)],[])).
% 0.19/0.40 tff(85,axiom,(![B: $i, A: $i, C: $i] : ((~member(C, A)) | member(C, un(A, B)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','unI1')).
% 0.19/0.40 tff(86,plain,
% 0.19/0.40 (![B: $i, A: $i, C: $i] : ((~member(C, A)) | member(C, un(A, B)))),
% 0.19/0.40 inference(modus_ponens,[status(thm)],[85, 84])).
% 0.19/0.40 tff(87,plain,(
% 0.19/0.40 ![B: $i, A: $i, C: $i] : ((~member(C, A)) | member(C, un(A, B)))),
% 0.19/0.41 inference(skolemize,[status(sab)],[86])).
% 0.19/0.41 tff(88,plain,
% 0.19/0.41 (![B: $i, A: $i, C: $i] : ((~member(C, A)) | member(C, un(A, B)))),
% 0.19/0.41 inference(modus_ponens,[status(thm)],[87, 83])).
% 0.19/0.41 tff(89,plain,
% 0.19/0.41 (((~![B: $i, A: $i, C: $i] : ((~member(C, A)) | member(C, un(A, B)))) | ((~member(sk2, a)) | member(sk2, un(a, b)))) <=> ((~![B: $i, A: $i, C: $i] : ((~member(C, A)) | member(C, un(A, B)))) | (~member(sk2, a)) | member(sk2, un(a, b)))),
% 0.19/0.41 inference(rewrite,[status(thm)],[])).
% 0.19/0.41 tff(90,plain,
% 0.19/0.41 ((~![B: $i, A: $i, C: $i] : ((~member(C, A)) | member(C, un(A, B)))) | ((~member(sk2, a)) | member(sk2, un(a, b)))),
% 0.19/0.41 inference(quant_inst,[status(thm)],[])).
% 0.19/0.41 tff(91,plain,
% 0.19/0.41 ((~![B: $i, A: $i, C: $i] : ((~member(C, A)) | member(C, un(A, B)))) | (~member(sk2, a)) | member(sk2, un(a, b))),
% 0.19/0.41 inference(modus_ponens,[status(thm)],[90, 89])).
% 0.19/0.41 tff(92,plain,
% 0.19/0.41 (~member(sk2, a)),
% 0.19/0.41 inference(unit_resolution,[status(thm)],[91, 88, 18])).
% 0.19/0.41 tff(93,plain,
% 0.19/0.41 (~member(sk2, unionE_sk1(sk2, cons(a, cons(b, eptset))))),
% 0.19/0.41 inference(modus_ponens,[status(thm)],[92, 81])).
% 0.19/0.41 tff(94,plain,
% 0.19/0.41 ($false),
% 0.19/0.41 inference(unit_resolution,[status(thm)],[44, 93])).
% 0.19/0.41 % SZS output end Proof
%------------------------------------------------------------------------------