TSTP Solution File: SEU126+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SEU126+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n011.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 07:27:36 EDT 2022
% Result : Theorem 0.21s 0.40s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU126+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Sep 3 09:31:13 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.14/0.35 Usage: tptp [options] [-file:]file
% 0.14/0.35 -h, -? prints this message.
% 0.14/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.14/0.35 -m, -model generate model.
% 0.14/0.35 -p, -proof generate proof.
% 0.14/0.35 -c, -core generate unsat core of named formulas.
% 0.14/0.35 -st, -statistics display statistics.
% 0.14/0.35 -t:timeout set timeout (in second).
% 0.14/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.14/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.14/0.35 -<param>:<value> configuration parameter and value.
% 0.14/0.35 -o:<output-file> file to place output in.
% 0.21/0.40 % SZS status Theorem
% 0.21/0.40 % SZS output start Proof
% 0.21/0.40 tff(in_type, type, (
% 0.21/0.40 in: ( $i * $i ) > $o)).
% 0.21/0.40 tff(tptp_fun_A_5_type, type, (
% 0.21/0.40 tptp_fun_A_5: $i)).
% 0.21/0.40 tff(tptp_fun_D_0_type, type, (
% 0.21/0.40 tptp_fun_D_0: ( $i * $i * $i ) > $i)).
% 0.21/0.40 tff(tptp_fun_B_4_type, type, (
% 0.21/0.40 tptp_fun_B_4: $i)).
% 0.21/0.40 tff(set_union2_type, type, (
% 0.21/0.40 set_union2: ( $i * $i ) > $i)).
% 0.21/0.40 tff(tptp_fun_C_1_type, type, (
% 0.21/0.40 tptp_fun_C_1: ( $i * $i ) > $i)).
% 0.21/0.40 tff(subset_type, type, (
% 0.21/0.40 subset: ( $i * $i ) > $o)).
% 0.21/0.40 tff(1,plain,
% 0.21/0.40 (^[A: $i, B: $i, C: $i, D: $i] : refl((~((~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))))) <=> (~((~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))))))),
% 0.21/0.40 inference(bind,[status(th)],[])).
% 0.21/0.40 tff(2,plain,
% 0.21/0.40 (![A: $i, B: $i, C: $i, D: $i] : (~((~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))))) <=> ![A: $i, B: $i, C: $i, D: $i] : (~((~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))))),
% 0.21/0.40 inference(quant_intro,[status(thm)],[1])).
% 0.21/0.40 tff(3,plain,
% 0.21/0.40 (![A: $i, B: $i, C: $i] : ![D: $i] : (~((~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))))) <=> ![A: $i, B: $i, C: $i, D: $i] : (~((~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))))),
% 0.21/0.40 inference(pull_quant,[status(thm)],[])).
% 0.21/0.40 tff(4,plain,
% 0.21/0.40 (^[A: $i, B: $i, C: $i] : trans(monotonicity(trans(monotonicity(trans(monotonicity(pull_quant(((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A)))) <=> ![D: $i] : ((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))), ((~((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))) <=> (~![D: $i] : ((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))))), pull_quant((~![D: $i] : ((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) <=> ?[D: $i] : (~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A)))))), ((~((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))) <=> ?[D: $i] : (~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))))), (((~((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))) <=> (?[D: $i] : (~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))))), pull_quant((?[D: $i] : (~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))) <=> ?[D: $i] : ((~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))))), (((~((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))) <=> ?[D: $i] : ((~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))))), ((~((~((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))))) <=> (~?[D: $i] : ((~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))))))), pull_quant((~?[D: $i] : ((~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))))) <=> ![D: $i] : (~((~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))))), ((~((~((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))))) <=> ![D: $i] : (~((~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))))))),
% 0.21/0.40 inference(bind,[status(th)],[])).
% 0.21/0.40 tff(5,plain,
% 0.21/0.40 (![A: $i, B: $i, C: $i] : (~((~((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))))) <=> ![A: $i, B: $i, C: $i] : ![D: $i] : (~((~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))))),
% 0.21/0.40 inference(quant_intro,[status(thm)],[4])).
% 0.21/0.40 tff(6,plain,
% 0.21/0.40 (![A: $i, B: $i, C: $i] : (~((~((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))))) <=> ![A: $i, B: $i, C: $i, D: $i] : (~((~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))))),
% 0.21/0.40 inference(transitivity,[status(thm)],[5, 3])).
% 0.21/0.40 tff(7,plain,
% 0.21/0.40 (![A: $i, B: $i, C: $i] : (~((~((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))))) <=> ![A: $i, B: $i, C: $i, D: $i] : (~((~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))))),
% 0.21/0.40 inference(transitivity,[status(thm)],[6, 2])).
% 0.21/0.40 tff(8,plain,
% 0.21/0.40 (^[A: $i, B: $i, C: $i] : rewrite((~((~((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))))) <=> (~((~((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))))))),
% 0.21/0.40 inference(bind,[status(th)],[])).
% 0.21/0.40 tff(9,plain,
% 0.21/0.40 (![A: $i, B: $i, C: $i] : (~((~((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))))) <=> ![A: $i, B: $i, C: $i] : (~((~((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))))),
% 0.21/0.41 inference(quant_intro,[status(thm)],[8])).
% 0.21/0.41 tff(10,plain,
% 0.21/0.41 (![A: $i, B: $i, C: $i] : (~((~((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))))) <=> ![A: $i, B: $i, C: $i, D: $i] : (~((~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))))),
% 0.21/0.41 inference(transitivity,[status(thm)],[9, 7])).
% 0.21/0.41 tff(11,plain,
% 0.21/0.41 (^[A: $i, B: $i, C: $i] : trans(monotonicity(rewrite(((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A)))) <=> ((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))), ((((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A)))) & ((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))) <=> (((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A)))) & ((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))))), rewrite((((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A)))) & ((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))) <=> (~((~((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))))), ((((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A)))) & ((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))) <=> (~((~((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))))))),
% 0.21/0.41 inference(bind,[status(th)],[])).
% 0.21/0.41 tff(12,plain,
% 0.21/0.41 (![A: $i, B: $i, C: $i] : (((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A)))) & ((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))) <=> ![A: $i, B: $i, C: $i] : (~((~((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))))),
% 0.21/0.41 inference(quant_intro,[status(thm)],[11])).
% 0.21/0.41 tff(13,plain,
% 0.21/0.41 (^[A: $i, B: $i, C: $i] : rewrite((((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A)))) & ((C = set_union2(A, B)) | (~(in(tptp_fun_D_0(C, B, A), C) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))) <=> (((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A)))) & ((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))))),
% 0.21/0.41 inference(bind,[status(th)],[])).
% 0.21/0.41 tff(14,plain,
% 0.21/0.41 (![A: $i, B: $i, C: $i] : (((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A)))) & ((C = set_union2(A, B)) | (~(in(tptp_fun_D_0(C, B, A), C) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))) <=> ![A: $i, B: $i, C: $i] : (((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A)))) & ((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))),
% 0.21/0.41 inference(quant_intro,[status(thm)],[13])).
% 0.21/0.41 tff(15,plain,
% 0.21/0.41 (![A: $i, B: $i, C: $i] : ((C = set_union2(A, B)) <=> ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A)))) <=> ![A: $i, B: $i, C: $i] : ((C = set_union2(A, B)) <=> ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))),
% 0.21/0.41 inference(rewrite,[status(thm)],[])).
% 0.21/0.41 tff(16,plain,
% 0.21/0.41 (^[A: $i, B: $i, C: $i] : rewrite(((C = set_union2(A, B)) <=> ![D: $i] : (in(D, C) <=> (in(D, A) | in(D, B)))) <=> ((C = set_union2(A, B)) <=> ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A)))))),
% 0.21/0.41 inference(bind,[status(th)],[])).
% 0.21/0.41 tff(17,plain,
% 0.21/0.41 (![A: $i, B: $i, C: $i] : ((C = set_union2(A, B)) <=> ![D: $i] : (in(D, C) <=> (in(D, A) | in(D, B)))) <=> ![A: $i, B: $i, C: $i] : ((C = set_union2(A, B)) <=> ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))),
% 0.21/0.41 inference(quant_intro,[status(thm)],[16])).
% 0.21/0.41 tff(18,axiom,(![A: $i, B: $i, C: $i] : ((C = set_union2(A, B)) <=> ![D: $i] : (in(D, C) <=> (in(D, A) | in(D, B))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','d2_xboole_0')).
% 0.21/0.41 tff(19,plain,
% 0.21/0.41 (![A: $i, B: $i, C: $i] : ((C = set_union2(A, B)) <=> ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))),
% 0.21/0.41 inference(modus_ponens,[status(thm)],[18, 17])).
% 0.21/0.41 tff(20,plain,
% 0.21/0.41 (![A: $i, B: $i, C: $i] : ((C = set_union2(A, B)) <=> ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))),
% 0.21/0.41 inference(modus_ponens,[status(thm)],[19, 15])).
% 0.21/0.41 tff(21,plain,(
% 0.21/0.41 ![A: $i, B: $i, C: $i] : (((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A)))) & ((C = set_union2(A, B)) | (~(in(tptp_fun_D_0(C, B, A), C) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A))))))),
% 0.21/0.41 inference(skolemize,[status(sab)],[20])).
% 0.21/0.41 tff(22,plain,
% 0.21/0.41 (![A: $i, B: $i, C: $i] : (((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A)))) & ((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))),
% 0.21/0.41 inference(modus_ponens,[status(thm)],[21, 14])).
% 0.21/0.41 tff(23,plain,
% 0.21/0.41 (![A: $i, B: $i, C: $i] : (~((~((~(C = set_union2(A, B))) | ![D: $i] : (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))))),
% 0.21/0.41 inference(modus_ponens,[status(thm)],[22, 12])).
% 0.21/0.41 tff(24,plain,
% 0.21/0.41 (![A: $i, B: $i, C: $i, D: $i] : (~((~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))))),
% 0.21/0.41 inference(modus_ponens,[status(thm)],[23, 10])).
% 0.21/0.41 tff(25,plain,
% 0.21/0.41 ((~![A: $i, B: $i, C: $i, D: $i] : (~((~((~(C = set_union2(A, B))) | (in(D, C) <=> (in(D, B) | in(D, A))))) | (~((C = set_union2(A, B)) | ((~in(tptp_fun_D_0(C, B, A), C)) <=> (in(tptp_fun_D_0(C, B, A), B) | in(tptp_fun_D_0(C, B, A), A)))))))) | (~((~((~(B!4 = set_union2(B!4, A!5))) | (in(tptp_fun_C_1(A!5, B!4), B!4) <=> (in(tptp_fun_C_1(A!5, B!4), A!5) | in(tptp_fun_C_1(A!5, B!4), B!4))))) | (~((B!4 = set_union2(B!4, A!5)) | ((~in(tptp_fun_D_0(B!4, A!5, B!4), B!4)) <=> (in(tptp_fun_D_0(B!4, A!5, B!4), A!5) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4)))))))),
% 0.21/0.41 inference(quant_inst,[status(thm)],[])).
% 0.21/0.41 tff(26,plain,
% 0.21/0.41 (~((~((~(B!4 = set_union2(B!4, A!5))) | (in(tptp_fun_C_1(A!5, B!4), B!4) <=> (in(tptp_fun_C_1(A!5, B!4), A!5) | in(tptp_fun_C_1(A!5, B!4), B!4))))) | (~((B!4 = set_union2(B!4, A!5)) | ((~in(tptp_fun_D_0(B!4, A!5, B!4), B!4)) <=> (in(tptp_fun_D_0(B!4, A!5, B!4), A!5) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4))))))),
% 0.21/0.41 inference(unit_resolution,[status(thm)],[25, 24])).
% 0.21/0.41 tff(27,plain,
% 0.21/0.41 (((~((~(B!4 = set_union2(B!4, A!5))) | (in(tptp_fun_C_1(A!5, B!4), B!4) <=> (in(tptp_fun_C_1(A!5, B!4), A!5) | in(tptp_fun_C_1(A!5, B!4), B!4))))) | (~((B!4 = set_union2(B!4, A!5)) | ((~in(tptp_fun_D_0(B!4, A!5, B!4), B!4)) <=> (in(tptp_fun_D_0(B!4, A!5, B!4), A!5) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4)))))) | ((B!4 = set_union2(B!4, A!5)) | ((~in(tptp_fun_D_0(B!4, A!5, B!4), B!4)) <=> (in(tptp_fun_D_0(B!4, A!5, B!4), A!5) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4))))),
% 0.21/0.41 inference(tautology,[status(thm)],[])).
% 0.21/0.41 tff(28,plain,
% 0.21/0.41 ((B!4 = set_union2(B!4, A!5)) | ((~in(tptp_fun_D_0(B!4, A!5, B!4), B!4)) <=> (in(tptp_fun_D_0(B!4, A!5, B!4), A!5) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4)))),
% 0.21/0.41 inference(unit_resolution,[status(thm)],[27, 26])).
% 0.21/0.41 tff(29,plain,
% 0.21/0.41 ((B!4 = set_union2(A!5, B!4)) <=> (set_union2(A!5, B!4) = B!4)),
% 0.21/0.41 inference(commutativity,[status(thm)],[])).
% 0.21/0.41 tff(30,plain,
% 0.21/0.41 (^[A: $i, B: $i] : refl((set_union2(A, B) = set_union2(B, A)) <=> (set_union2(A, B) = set_union2(B, A)))),
% 0.21/0.41 inference(bind,[status(th)],[])).
% 0.21/0.41 tff(31,plain,
% 0.21/0.41 (![A: $i, B: $i] : (set_union2(A, B) = set_union2(B, A)) <=> ![A: $i, B: $i] : (set_union2(A, B) = set_union2(B, A))),
% 0.21/0.41 inference(quant_intro,[status(thm)],[30])).
% 0.21/0.41 tff(32,plain,
% 0.21/0.41 (![A: $i, B: $i] : (set_union2(A, B) = set_union2(B, A)) <=> ![A: $i, B: $i] : (set_union2(A, B) = set_union2(B, A))),
% 0.21/0.41 inference(rewrite,[status(thm)],[])).
% 0.21/0.41 tff(33,axiom,(![A: $i, B: $i] : (set_union2(A, B) = set_union2(B, A))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','commutativity_k2_xboole_0')).
% 0.21/0.41 tff(34,plain,
% 0.21/0.41 (![A: $i, B: $i] : (set_union2(A, B) = set_union2(B, A))),
% 0.21/0.41 inference(modus_ponens,[status(thm)],[33, 32])).
% 0.21/0.41 tff(35,plain,(
% 0.21/0.41 ![A: $i, B: $i] : (set_union2(A, B) = set_union2(B, A))),
% 0.21/0.41 inference(skolemize,[status(sab)],[34])).
% 0.21/0.41 tff(36,plain,
% 0.21/0.41 (![A: $i, B: $i] : (set_union2(A, B) = set_union2(B, A))),
% 0.21/0.41 inference(modus_ponens,[status(thm)],[35, 31])).
% 0.21/0.41 tff(37,plain,
% 0.21/0.41 ((~![A: $i, B: $i] : (set_union2(A, B) = set_union2(B, A))) | (set_union2(A!5, B!4) = set_union2(B!4, A!5))),
% 0.21/0.41 inference(quant_inst,[status(thm)],[])).
% 0.21/0.41 tff(38,plain,
% 0.21/0.41 (set_union2(A!5, B!4) = set_union2(B!4, A!5)),
% 0.21/0.41 inference(unit_resolution,[status(thm)],[37, 36])).
% 0.21/0.41 tff(39,plain,
% 0.21/0.41 (set_union2(B!4, A!5) = set_union2(A!5, B!4)),
% 0.21/0.41 inference(symmetry,[status(thm)],[38])).
% 0.21/0.41 tff(40,plain,
% 0.21/0.41 ((B!4 = set_union2(B!4, A!5)) <=> (B!4 = set_union2(A!5, B!4))),
% 0.21/0.41 inference(monotonicity,[status(thm)],[39])).
% 0.21/0.41 tff(41,plain,
% 0.21/0.41 ((B!4 = set_union2(B!4, A!5)) <=> (set_union2(A!5, B!4) = B!4)),
% 0.21/0.41 inference(transitivity,[status(thm)],[40, 29])).
% 0.21/0.41 tff(42,plain,
% 0.21/0.41 ((set_union2(A!5, B!4) = B!4) <=> (B!4 = set_union2(B!4, A!5))),
% 0.21/0.41 inference(symmetry,[status(thm)],[41])).
% 0.21/0.41 tff(43,plain,
% 0.21/0.41 ((~(set_union2(A!5, B!4) = B!4)) <=> (~(B!4 = set_union2(B!4, A!5)))),
% 0.21/0.41 inference(monotonicity,[status(thm)],[42])).
% 0.21/0.41 tff(44,plain,
% 0.21/0.41 ((~![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))) <=> (~![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B)))),
% 0.21/0.41 inference(rewrite,[status(thm)],[])).
% 0.21/0.41 tff(45,plain,
% 0.21/0.41 ((~![A: $i, B: $i] : (subset(A, B) => (set_union2(A, B) = B))) <=> (~![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B)))),
% 0.21/0.41 inference(rewrite,[status(thm)],[])).
% 0.21/0.41 tff(46,axiom,(~![A: $i, B: $i] : (subset(A, B) => (set_union2(A, B) = B))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','t12_xboole_1')).
% 0.21/0.41 tff(47,plain,
% 0.21/0.41 (~![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.21/0.41 inference(modus_ponens,[status(thm)],[46, 45])).
% 0.21/0.41 tff(48,plain,
% 0.21/0.41 (~![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.21/0.41 inference(modus_ponens,[status(thm)],[47, 44])).
% 0.21/0.41 tff(49,plain,
% 0.21/0.41 (~![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.21/0.41 inference(modus_ponens,[status(thm)],[48, 44])).
% 0.21/0.41 tff(50,plain,
% 0.21/0.41 (~![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.21/0.41 inference(modus_ponens,[status(thm)],[49, 44])).
% 0.21/0.41 tff(51,plain,
% 0.21/0.41 (~![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.21/0.41 inference(modus_ponens,[status(thm)],[50, 44])).
% 0.21/0.41 tff(52,plain,
% 0.21/0.41 (~![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.21/0.41 inference(modus_ponens,[status(thm)],[51, 44])).
% 0.21/0.41 tff(53,plain,
% 0.21/0.41 (~![A: $i, B: $i] : ((~subset(A, B)) | (set_union2(A, B) = B))),
% 0.21/0.41 inference(modus_ponens,[status(thm)],[52, 44])).
% 0.21/0.41 tff(54,plain,(
% 0.21/0.41 ~((~subset(A!5, B!4)) | (set_union2(A!5, B!4) = B!4))),
% 0.21/0.41 inference(skolemize,[status(sab)],[53])).
% 0.21/0.41 tff(55,plain,
% 0.21/0.41 (~(set_union2(A!5, B!4) = B!4)),
% 0.21/0.41 inference(or_elim,[status(thm)],[54])).
% 0.21/0.41 tff(56,plain,
% 0.21/0.41 (~(B!4 = set_union2(B!4, A!5))),
% 0.21/0.41 inference(modus_ponens,[status(thm)],[55, 43])).
% 0.21/0.41 tff(57,plain,
% 0.21/0.41 ((~((B!4 = set_union2(B!4, A!5)) | ((~in(tptp_fun_D_0(B!4, A!5, B!4), B!4)) <=> (in(tptp_fun_D_0(B!4, A!5, B!4), A!5) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4))))) | (B!4 = set_union2(B!4, A!5)) | ((~in(tptp_fun_D_0(B!4, A!5, B!4), B!4)) <=> (in(tptp_fun_D_0(B!4, A!5, B!4), A!5) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4)))),
% 0.21/0.42 inference(tautology,[status(thm)],[])).
% 0.21/0.42 tff(58,plain,
% 0.21/0.42 ((~in(tptp_fun_D_0(B!4, A!5, B!4), B!4)) <=> (in(tptp_fun_D_0(B!4, A!5, B!4), A!5) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4))),
% 0.21/0.42 inference(unit_resolution,[status(thm)],[57, 56, 28])).
% 0.21/0.42 tff(59,assumption,(in(tptp_fun_D_0(B!4, A!5, B!4), B!4)), introduced(assumption)).
% 0.21/0.42 tff(60,plain,
% 0.21/0.42 ((in(tptp_fun_D_0(B!4, A!5, B!4), A!5) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4)) | (~in(tptp_fun_D_0(B!4, A!5, B!4), B!4))),
% 0.21/0.42 inference(tautology,[status(thm)],[])).
% 0.21/0.42 tff(61,plain,
% 0.21/0.42 (in(tptp_fun_D_0(B!4, A!5, B!4), A!5) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4)),
% 0.21/0.42 inference(unit_resolution,[status(thm)],[60, 59])).
% 0.21/0.42 tff(62,plain,
% 0.21/0.42 ((~((~in(tptp_fun_D_0(B!4, A!5, B!4), B!4)) <=> (in(tptp_fun_D_0(B!4, A!5, B!4), A!5) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4)))) | (~in(tptp_fun_D_0(B!4, A!5, B!4), B!4)) | (~(in(tptp_fun_D_0(B!4, A!5, B!4), A!5) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4)))),
% 0.21/0.42 inference(tautology,[status(thm)],[])).
% 0.21/0.42 tff(63,plain,
% 0.21/0.42 ($false),
% 0.21/0.42 inference(unit_resolution,[status(thm)],[62, 61, 59, 58])).
% 0.21/0.42 tff(64,plain,(~in(tptp_fun_D_0(B!4, A!5, B!4), B!4)), inference(lemma,lemma(discharge,[]))).
% 0.21/0.42 tff(65,assumption,(~in(tptp_fun_D_0(B!4, A!5, B!4), B!4)), introduced(assumption)).
% 0.21/0.42 tff(66,assumption,(~in(tptp_fun_D_0(B!4, A!5, B!4), A!5)), introduced(assumption)).
% 0.21/0.42 tff(67,plain,
% 0.21/0.42 ((~(in(tptp_fun_D_0(B!4, A!5, B!4), A!5) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4))) | in(tptp_fun_D_0(B!4, A!5, B!4), A!5) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4)),
% 0.21/0.42 inference(tautology,[status(thm)],[])).
% 0.21/0.42 tff(68,plain,
% 0.21/0.42 (~(in(tptp_fun_D_0(B!4, A!5, B!4), A!5) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4))),
% 0.21/0.42 inference(unit_resolution,[status(thm)],[67, 65, 66])).
% 0.21/0.42 tff(69,plain,
% 0.21/0.42 ((~((~in(tptp_fun_D_0(B!4, A!5, B!4), B!4)) <=> (in(tptp_fun_D_0(B!4, A!5, B!4), A!5) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4)))) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4) | (in(tptp_fun_D_0(B!4, A!5, B!4), A!5) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4))),
% 0.21/0.42 inference(tautology,[status(thm)],[])).
% 0.21/0.42 tff(70,plain,
% 0.21/0.42 ($false),
% 0.21/0.42 inference(unit_resolution,[status(thm)],[69, 68, 65, 58])).
% 0.21/0.42 tff(71,plain,(in(tptp_fun_D_0(B!4, A!5, B!4), B!4) | in(tptp_fun_D_0(B!4, A!5, B!4), A!5)), inference(lemma,lemma(discharge,[]))).
% 0.21/0.42 tff(72,plain,
% 0.21/0.42 (in(tptp_fun_D_0(B!4, A!5, B!4), A!5)),
% 0.21/0.42 inference(unit_resolution,[status(thm)],[71, 64])).
% 0.21/0.42 tff(73,plain,
% 0.21/0.42 (^[A: $i, B: $i] : refl((~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B))))))) <=> (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B))))))))),
% 0.21/0.42 inference(bind,[status(th)],[])).
% 0.21/0.42 tff(74,plain,
% 0.21/0.42 (![A: $i, B: $i] : (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B))))))) <=> ![A: $i, B: $i] : (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B)))))))),
% 0.21/0.42 inference(quant_intro,[status(thm)],[73])).
% 0.21/0.42 tff(75,plain,
% 0.21/0.42 (^[A: $i, B: $i] : rewrite((~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B))))))) <=> (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B))))))))),
% 0.21/0.42 inference(bind,[status(th)],[])).
% 0.21/0.42 tff(76,plain,
% 0.21/0.42 (![A: $i, B: $i] : (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B))))))) <=> ![A: $i, B: $i] : (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B)))))))),
% 0.21/0.42 inference(quant_intro,[status(thm)],[75])).
% 0.21/0.42 tff(77,plain,
% 0.21/0.42 (![A: $i, B: $i] : (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B))))))) <=> ![A: $i, B: $i] : (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B)))))))),
% 0.21/0.42 inference(transitivity,[status(thm)],[76, 74])).
% 0.21/0.42 tff(78,plain,
% 0.21/0.42 (^[A: $i, B: $i] : trans(monotonicity(rewrite(((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B))) <=> ((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))), rewrite((subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B)))) <=> (subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B))))), ((((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B))) & (subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B))))) <=> (((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B))) & (subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B))))))), rewrite((((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B))) & (subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B))))) <=> (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B)))))))), ((((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B))) & (subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B))))) <=> (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B)))))))))),
% 0.21/0.42 inference(bind,[status(th)],[])).
% 0.21/0.42 tff(79,plain,
% 0.21/0.42 (![A: $i, B: $i] : (((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B))) & (subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B))))) <=> ![A: $i, B: $i] : (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B)))))))),
% 0.21/0.42 inference(quant_intro,[status(thm)],[78])).
% 0.21/0.42 tff(80,plain,
% 0.21/0.42 (![A: $i, B: $i] : (subset(A, B) <=> ![C: $i] : ((~in(C, A)) | in(C, B))) <=> ![A: $i, B: $i] : (subset(A, B) <=> ![C: $i] : ((~in(C, A)) | in(C, B)))),
% 0.21/0.42 inference(rewrite,[status(thm)],[])).
% 0.21/0.42 tff(81,plain,
% 0.21/0.42 (^[A: $i, B: $i] : rewrite((subset(A, B) <=> ![C: $i] : (in(C, A) => in(C, B))) <=> (subset(A, B) <=> ![C: $i] : ((~in(C, A)) | in(C, B))))),
% 0.21/0.42 inference(bind,[status(th)],[])).
% 0.21/0.42 tff(82,plain,
% 0.21/0.42 (![A: $i, B: $i] : (subset(A, B) <=> ![C: $i] : (in(C, A) => in(C, B))) <=> ![A: $i, B: $i] : (subset(A, B) <=> ![C: $i] : ((~in(C, A)) | in(C, B)))),
% 0.21/0.42 inference(quant_intro,[status(thm)],[81])).
% 0.21/0.42 tff(83,axiom,(![A: $i, B: $i] : (subset(A, B) <=> ![C: $i] : (in(C, A) => in(C, B)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','d3_tarski')).
% 0.21/0.42 tff(84,plain,
% 0.21/0.42 (![A: $i, B: $i] : (subset(A, B) <=> ![C: $i] : ((~in(C, A)) | in(C, B)))),
% 0.21/0.42 inference(modus_ponens,[status(thm)],[83, 82])).
% 0.21/0.42 tff(85,plain,
% 0.21/0.42 (![A: $i, B: $i] : (subset(A, B) <=> ![C: $i] : ((~in(C, A)) | in(C, B)))),
% 0.21/0.42 inference(modus_ponens,[status(thm)],[84, 80])).
% 0.21/0.42 tff(86,plain,(
% 0.21/0.42 ![A: $i, B: $i] : (((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B))) & (subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B)))))),
% 0.21/0.42 inference(skolemize,[status(sab)],[85])).
% 0.21/0.42 tff(87,plain,
% 0.21/0.42 (![A: $i, B: $i] : (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B)))))))),
% 0.21/0.42 inference(modus_ponens,[status(thm)],[86, 79])).
% 0.21/0.42 tff(88,plain,
% 0.21/0.42 (![A: $i, B: $i] : (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B)))))))),
% 0.21/0.42 inference(modus_ponens,[status(thm)],[87, 77])).
% 0.21/0.42 tff(89,plain,
% 0.21/0.42 ((~![A: $i, B: $i] : (~((~((~subset(A, B)) | ![C: $i] : ((~in(C, A)) | in(C, B)))) | (~(subset(A, B) | (~((~in(tptp_fun_C_1(B, A), A)) | in(tptp_fun_C_1(B, A), B)))))))) | (~((~((~subset(A!5, B!4)) | ![C: $i] : ((~in(C, A!5)) | in(C, B!4)))) | (~(subset(A!5, B!4) | (~((~in(tptp_fun_C_1(B!4, A!5), A!5)) | in(tptp_fun_C_1(B!4, A!5), B!4)))))))),
% 0.21/0.42 inference(quant_inst,[status(thm)],[])).
% 0.21/0.42 tff(90,plain,
% 0.21/0.42 (~((~((~subset(A!5, B!4)) | ![C: $i] : ((~in(C, A!5)) | in(C, B!4)))) | (~(subset(A!5, B!4) | (~((~in(tptp_fun_C_1(B!4, A!5), A!5)) | in(tptp_fun_C_1(B!4, A!5), B!4))))))),
% 0.21/0.42 inference(unit_resolution,[status(thm)],[89, 88])).
% 0.21/0.42 tff(91,plain,
% 0.21/0.42 (((~((~subset(A!5, B!4)) | ![C: $i] : ((~in(C, A!5)) | in(C, B!4)))) | (~(subset(A!5, B!4) | (~((~in(tptp_fun_C_1(B!4, A!5), A!5)) | in(tptp_fun_C_1(B!4, A!5), B!4)))))) | ((~subset(A!5, B!4)) | ![C: $i] : ((~in(C, A!5)) | in(C, B!4)))),
% 0.21/0.42 inference(tautology,[status(thm)],[])).
% 0.21/0.42 tff(92,plain,
% 0.21/0.42 ((~subset(A!5, B!4)) | ![C: $i] : ((~in(C, A!5)) | in(C, B!4))),
% 0.21/0.42 inference(unit_resolution,[status(thm)],[91, 90])).
% 0.21/0.42 tff(93,plain,
% 0.21/0.42 (subset(A!5, B!4)),
% 0.21/0.42 inference(or_elim,[status(thm)],[54])).
% 0.21/0.42 tff(94,plain,
% 0.21/0.42 ((~((~subset(A!5, B!4)) | ![C: $i] : ((~in(C, A!5)) | in(C, B!4)))) | (~subset(A!5, B!4)) | ![C: $i] : ((~in(C, A!5)) | in(C, B!4))),
% 0.21/0.42 inference(tautology,[status(thm)],[])).
% 0.21/0.42 tff(95,plain,
% 0.21/0.42 ((~((~subset(A!5, B!4)) | ![C: $i] : ((~in(C, A!5)) | in(C, B!4)))) | ![C: $i] : ((~in(C, A!5)) | in(C, B!4))),
% 0.21/0.42 inference(unit_resolution,[status(thm)],[94, 93])).
% 0.21/0.42 tff(96,plain,
% 0.21/0.42 (![C: $i] : ((~in(C, A!5)) | in(C, B!4))),
% 0.21/0.42 inference(unit_resolution,[status(thm)],[95, 92])).
% 0.21/0.42 tff(97,plain,
% 0.21/0.42 (((~![C: $i] : ((~in(C, A!5)) | in(C, B!4))) | ((~in(tptp_fun_D_0(B!4, A!5, B!4), A!5)) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4))) <=> ((~![C: $i] : ((~in(C, A!5)) | in(C, B!4))) | (~in(tptp_fun_D_0(B!4, A!5, B!4), A!5)) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4))),
% 0.21/0.42 inference(rewrite,[status(thm)],[])).
% 0.21/0.42 tff(98,plain,
% 0.21/0.42 ((~![C: $i] : ((~in(C, A!5)) | in(C, B!4))) | ((~in(tptp_fun_D_0(B!4, A!5, B!4), A!5)) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4))),
% 0.21/0.42 inference(quant_inst,[status(thm)],[])).
% 0.21/0.42 tff(99,plain,
% 0.21/0.42 ((~![C: $i] : ((~in(C, A!5)) | in(C, B!4))) | (~in(tptp_fun_D_0(B!4, A!5, B!4), A!5)) | in(tptp_fun_D_0(B!4, A!5, B!4), B!4)),
% 0.21/0.42 inference(modus_ponens,[status(thm)],[98, 97])).
% 0.21/0.42 tff(100,plain,
% 0.21/0.42 ($false),
% 0.21/0.42 inference(unit_resolution,[status(thm)],[99, 96, 64, 72])).
% 0.21/0.42 % SZS output end Proof
%------------------------------------------------------------------------------