TSTP Solution File: SET630+3 by Z3---4.8.9.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : SET630+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp
% Command  : z3_tptp -proof -model -t:%d -file:%s

% Computer : n001.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:07:25 EDT 2022

% Result   : Theorem 0.11s 0.37s
% Output   : Proof 0.11s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : SET630+3 : TPTP v8.1.0. Released v2.2.0.
% 0.10/0.11  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.11/0.32  % Computer : n001.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Sat Sep  3 07:23:40 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.11/0.32  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.11/0.32  Usage: tptp [options] [-file:]file
% 0.11/0.32    -h, -?       prints this message.
% 0.11/0.32    -smt2        print SMT-LIB2 benchmark.
% 0.11/0.32    -m, -model   generate model.
% 0.11/0.32    -p, -proof   generate proof.
% 0.11/0.32    -c, -core    generate unsat core of named formulas.
% 0.11/0.32    -st, -statistics display statistics.
% 0.11/0.32    -t:timeout   set timeout (in second).
% 0.11/0.32    -smt2status  display status in smt2 format instead of SZS.
% 0.11/0.32    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.11/0.32    -<param>:<value> configuration parameter and value.
% 0.11/0.32    -o:<output-file> file to place output in.
% 0.11/0.37  % SZS status Theorem
% 0.11/0.37  % SZS output start Proof
% 0.11/0.37  tff(disjoint_type, type, (
% 0.11/0.37     disjoint: ( $i * $i ) > $o)).
% 0.11/0.37  tff(difference_type, type, (
% 0.11/0.37     difference: ( $i * $i ) > $i)).
% 0.11/0.37  tff(tptp_fun_B_3_type, type, (
% 0.11/0.37     tptp_fun_B_3: $i)).
% 0.11/0.37  tff(tptp_fun_C_2_type, type, (
% 0.11/0.37     tptp_fun_C_2: $i)).
% 0.11/0.37  tff(intersection_type, type, (
% 0.11/0.37     intersection: ( $i * $i ) > $i)).
% 0.11/0.37  tff(intersect_type, type, (
% 0.11/0.37     intersect: ( $i * $i ) > $o)).
% 0.11/0.37  tff(union_type, type, (
% 0.11/0.37     union: ( $i * $i ) > $i)).
% 0.11/0.37  tff(symmetric_difference_type, type, (
% 0.11/0.37     symmetric_difference: ( $i * $i ) > $i)).
% 0.11/0.37  tff(1,plain,
% 0.11/0.37      (^[B: $i, C: $i] : refl((intersection(B, C) = intersection(C, B)) <=> (intersection(B, C) = intersection(C, B)))),
% 0.11/0.37      inference(bind,[status(th)],[])).
% 0.11/0.37  tff(2,plain,
% 0.11/0.37      (![B: $i, C: $i] : (intersection(B, C) = intersection(C, B)) <=> ![B: $i, C: $i] : (intersection(B, C) = intersection(C, B))),
% 0.11/0.37      inference(quant_intro,[status(thm)],[1])).
% 0.11/0.37  tff(3,plain,
% 0.11/0.37      (![B: $i, C: $i] : (intersection(B, C) = intersection(C, B)) <=> ![B: $i, C: $i] : (intersection(B, C) = intersection(C, B))),
% 0.11/0.37      inference(rewrite,[status(thm)],[])).
% 0.11/0.37  tff(4,axiom,(![B: $i, C: $i] : (intersection(B, C) = intersection(C, B))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','commutativity_of_intersection')).
% 0.11/0.37  tff(5,plain,
% 0.11/0.37      (![B: $i, C: $i] : (intersection(B, C) = intersection(C, B))),
% 0.11/0.37      inference(modus_ponens,[status(thm)],[4, 3])).
% 0.11/0.37  tff(6,plain,(
% 0.11/0.37      ![B: $i, C: $i] : (intersection(B, C) = intersection(C, B))),
% 0.11/0.37      inference(skolemize,[status(sab)],[5])).
% 0.11/0.37  tff(7,plain,
% 0.11/0.37      (![B: $i, C: $i] : (intersection(B, C) = intersection(C, B))),
% 0.11/0.37      inference(modus_ponens,[status(thm)],[6, 2])).
% 0.11/0.37  tff(8,plain,
% 0.11/0.37      ((~![B: $i, C: $i] : (intersection(B, C) = intersection(C, B))) | (intersection(C!2, B!3) = intersection(B!3, C!2))),
% 0.11/0.37      inference(quant_inst,[status(thm)],[])).
% 0.11/0.37  tff(9,plain,
% 0.11/0.37      (intersection(C!2, B!3) = intersection(B!3, C!2)),
% 0.11/0.37      inference(unit_resolution,[status(thm)],[8, 7])).
% 0.11/0.37  tff(10,plain,
% 0.11/0.37      (intersection(B!3, C!2) = intersection(C!2, B!3)),
% 0.11/0.37      inference(symmetry,[status(thm)],[9])).
% 0.11/0.37  tff(11,plain,
% 0.11/0.37      (disjoint(intersection(B!3, C!2), difference(C!2, B!3)) <=> disjoint(intersection(C!2, B!3), difference(C!2, B!3))),
% 0.11/0.37      inference(monotonicity,[status(thm)],[10])).
% 0.11/0.37  tff(12,plain,
% 0.11/0.37      (disjoint(intersection(C!2, B!3), difference(C!2, B!3)) <=> disjoint(intersection(B!3, C!2), difference(C!2, B!3))),
% 0.11/0.37      inference(symmetry,[status(thm)],[11])).
% 0.11/0.37  tff(13,plain,
% 0.11/0.37      (^[B: $i, C: $i] : refl(disjoint(intersection(B, C), difference(B, C)) <=> disjoint(intersection(B, C), difference(B, C)))),
% 0.11/0.37      inference(bind,[status(th)],[])).
% 0.11/0.37  tff(14,plain,
% 0.11/0.37      (![B: $i, C: $i] : disjoint(intersection(B, C), difference(B, C)) <=> ![B: $i, C: $i] : disjoint(intersection(B, C), difference(B, C))),
% 0.11/0.37      inference(quant_intro,[status(thm)],[13])).
% 0.11/0.37  tff(15,plain,
% 0.11/0.37      (![B: $i, C: $i] : disjoint(intersection(B, C), difference(B, C)) <=> ![B: $i, C: $i] : disjoint(intersection(B, C), difference(B, C))),
% 0.11/0.37      inference(rewrite,[status(thm)],[])).
% 0.11/0.37  tff(16,axiom,(![B: $i, C: $i] : disjoint(intersection(B, C), difference(B, C))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','intersection_and_union_disjoint')).
% 0.11/0.37  tff(17,plain,
% 0.11/0.37      (![B: $i, C: $i] : disjoint(intersection(B, C), difference(B, C))),
% 0.11/0.37      inference(modus_ponens,[status(thm)],[16, 15])).
% 0.11/0.37  tff(18,plain,(
% 0.11/0.37      ![B: $i, C: $i] : disjoint(intersection(B, C), difference(B, C))),
% 0.11/0.37      inference(skolemize,[status(sab)],[17])).
% 0.11/0.37  tff(19,plain,
% 0.11/0.37      (![B: $i, C: $i] : disjoint(intersection(B, C), difference(B, C))),
% 0.11/0.37      inference(modus_ponens,[status(thm)],[18, 14])).
% 0.11/0.37  tff(20,plain,
% 0.11/0.37      ((~![B: $i, C: $i] : disjoint(intersection(B, C), difference(B, C))) | disjoint(intersection(C!2, B!3), difference(C!2, B!3))),
% 0.11/0.37      inference(quant_inst,[status(thm)],[])).
% 0.11/0.37  tff(21,plain,
% 0.11/0.37      (disjoint(intersection(C!2, B!3), difference(C!2, B!3))),
% 0.11/0.37      inference(unit_resolution,[status(thm)],[20, 19])).
% 0.11/0.37  tff(22,plain,
% 0.11/0.37      (disjoint(intersection(B!3, C!2), difference(C!2, B!3))),
% 0.11/0.37      inference(modus_ponens,[status(thm)],[21, 12])).
% 0.11/0.37  tff(23,plain,
% 0.11/0.37      (^[B: $i, C: $i] : refl((disjoint(B, C) <=> (~intersect(B, C))) <=> (disjoint(B, C) <=> (~intersect(B, C))))),
% 0.11/0.37      inference(bind,[status(th)],[])).
% 0.11/0.37  tff(24,plain,
% 0.11/0.37      (![B: $i, C: $i] : (disjoint(B, C) <=> (~intersect(B, C))) <=> ![B: $i, C: $i] : (disjoint(B, C) <=> (~intersect(B, C)))),
% 0.11/0.37      inference(quant_intro,[status(thm)],[23])).
% 0.11/0.37  tff(25,plain,
% 0.11/0.37      (![B: $i, C: $i] : (disjoint(B, C) <=> (~intersect(B, C))) <=> ![B: $i, C: $i] : (disjoint(B, C) <=> (~intersect(B, C)))),
% 0.11/0.37      inference(rewrite,[status(thm)],[])).
% 0.11/0.37  tff(26,axiom,(![B: $i, C: $i] : (disjoint(B, C) <=> (~intersect(B, C)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','disjoint_defn')).
% 0.11/0.37  tff(27,plain,
% 0.11/0.37      (![B: $i, C: $i] : (disjoint(B, C) <=> (~intersect(B, C)))),
% 0.11/0.37      inference(modus_ponens,[status(thm)],[26, 25])).
% 0.11/0.37  tff(28,plain,(
% 0.11/0.37      ![B: $i, C: $i] : (disjoint(B, C) <=> (~intersect(B, C)))),
% 0.11/0.37      inference(skolemize,[status(sab)],[27])).
% 0.11/0.37  tff(29,plain,
% 0.11/0.37      (![B: $i, C: $i] : (disjoint(B, C) <=> (~intersect(B, C)))),
% 0.11/0.37      inference(modus_ponens,[status(thm)],[28, 24])).
% 0.11/0.37  tff(30,plain,
% 0.11/0.37      ((~![B: $i, C: $i] : (disjoint(B, C) <=> (~intersect(B, C)))) | (disjoint(intersection(B!3, C!2), difference(C!2, B!3)) <=> (~intersect(intersection(B!3, C!2), difference(C!2, B!3))))),
% 0.11/0.37      inference(quant_inst,[status(thm)],[])).
% 0.11/0.37  tff(31,plain,
% 0.11/0.37      (disjoint(intersection(B!3, C!2), difference(C!2, B!3)) <=> (~intersect(intersection(B!3, C!2), difference(C!2, B!3)))),
% 0.11/0.37      inference(unit_resolution,[status(thm)],[30, 29])).
% 0.11/0.37  tff(32,plain,
% 0.11/0.37      ((~![B: $i, C: $i] : (disjoint(B, C) <=> (~intersect(B, C)))) | (disjoint(intersection(B!3, C!2), difference(B!3, C!2)) <=> (~intersect(intersection(B!3, C!2), difference(B!3, C!2))))),
% 0.11/0.37      inference(quant_inst,[status(thm)],[])).
% 0.11/0.37  tff(33,plain,
% 0.11/0.37      (disjoint(intersection(B!3, C!2), difference(B!3, C!2)) <=> (~intersect(intersection(B!3, C!2), difference(B!3, C!2)))),
% 0.11/0.37      inference(unit_resolution,[status(thm)],[32, 29])).
% 0.11/0.37  tff(34,plain,
% 0.11/0.37      ((~![B: $i, C: $i] : disjoint(intersection(B, C), difference(B, C))) | disjoint(intersection(B!3, C!2), difference(B!3, C!2))),
% 0.11/0.37      inference(quant_inst,[status(thm)],[])).
% 0.11/0.37  tff(35,plain,
% 0.11/0.37      (disjoint(intersection(B!3, C!2), difference(B!3, C!2))),
% 0.11/0.37      inference(unit_resolution,[status(thm)],[34, 19])).
% 0.11/0.37  tff(36,plain,
% 0.11/0.37      ((~(disjoint(intersection(B!3, C!2), difference(B!3, C!2)) <=> (~intersect(intersection(B!3, C!2), difference(B!3, C!2))))) | (~disjoint(intersection(B!3, C!2), difference(B!3, C!2))) | (~intersect(intersection(B!3, C!2), difference(B!3, C!2)))),
% 0.11/0.37      inference(tautology,[status(thm)],[])).
% 0.11/0.37  tff(37,plain,
% 0.11/0.37      ((~(disjoint(intersection(B!3, C!2), difference(B!3, C!2)) <=> (~intersect(intersection(B!3, C!2), difference(B!3, C!2))))) | (~intersect(intersection(B!3, C!2), difference(B!3, C!2)))),
% 0.11/0.37      inference(unit_resolution,[status(thm)],[36, 35])).
% 0.11/0.37  tff(38,plain,
% 0.11/0.37      (~intersect(intersection(B!3, C!2), difference(B!3, C!2))),
% 0.11/0.37      inference(unit_resolution,[status(thm)],[37, 33])).
% 0.11/0.37  tff(39,plain,
% 0.11/0.37      (^[B: $i, C: $i, D: $i] : refl((intersect(B, union(C, D)) <=> (intersect(B, D) | intersect(B, C))) <=> (intersect(B, union(C, D)) <=> (intersect(B, D) | intersect(B, C))))),
% 0.11/0.37      inference(bind,[status(th)],[])).
% 0.11/0.37  tff(40,plain,
% 0.11/0.37      (![B: $i, C: $i, D: $i] : (intersect(B, union(C, D)) <=> (intersect(B, D) | intersect(B, C))) <=> ![B: $i, C: $i, D: $i] : (intersect(B, union(C, D)) <=> (intersect(B, D) | intersect(B, C)))),
% 0.11/0.37      inference(quant_intro,[status(thm)],[39])).
% 0.11/0.37  tff(41,plain,
% 0.11/0.37      (![B: $i, C: $i, D: $i] : (intersect(B, union(C, D)) <=> (intersect(B, D) | intersect(B, C))) <=> ![B: $i, C: $i, D: $i] : (intersect(B, union(C, D)) <=> (intersect(B, D) | intersect(B, C)))),
% 0.11/0.37      inference(rewrite,[status(thm)],[])).
% 0.11/0.37  tff(42,plain,
% 0.11/0.37      (^[B: $i, C: $i, D: $i] : rewrite((intersect(B, union(C, D)) <=> (intersect(B, C) | intersect(B, D))) <=> (intersect(B, union(C, D)) <=> (intersect(B, D) | intersect(B, C))))),
% 0.11/0.37      inference(bind,[status(th)],[])).
% 0.11/0.37  tff(43,plain,
% 0.11/0.37      (![B: $i, C: $i, D: $i] : (intersect(B, union(C, D)) <=> (intersect(B, C) | intersect(B, D))) <=> ![B: $i, C: $i, D: $i] : (intersect(B, union(C, D)) <=> (intersect(B, D) | intersect(B, C)))),
% 0.11/0.37      inference(quant_intro,[status(thm)],[42])).
% 0.11/0.37  tff(44,axiom,(![B: $i, C: $i, D: $i] : (intersect(B, union(C, D)) <=> (intersect(B, C) | intersect(B, D)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','intersect_with_union')).
% 0.11/0.37  tff(45,plain,
% 0.11/0.37      (![B: $i, C: $i, D: $i] : (intersect(B, union(C, D)) <=> (intersect(B, D) | intersect(B, C)))),
% 0.11/0.37      inference(modus_ponens,[status(thm)],[44, 43])).
% 0.11/0.37  tff(46,plain,
% 0.11/0.37      (![B: $i, C: $i, D: $i] : (intersect(B, union(C, D)) <=> (intersect(B, D) | intersect(B, C)))),
% 0.11/0.37      inference(modus_ponens,[status(thm)],[45, 41])).
% 0.11/0.37  tff(47,plain,(
% 0.11/0.37      ![B: $i, C: $i, D: $i] : (intersect(B, union(C, D)) <=> (intersect(B, D) | intersect(B, C)))),
% 0.11/0.37      inference(skolemize,[status(sab)],[46])).
% 0.11/0.37  tff(48,plain,
% 0.11/0.37      (![B: $i, C: $i, D: $i] : (intersect(B, union(C, D)) <=> (intersect(B, D) | intersect(B, C)))),
% 0.11/0.37      inference(modus_ponens,[status(thm)],[47, 40])).
% 0.11/0.37  tff(49,plain,
% 0.11/0.37      (((~![B: $i, C: $i, D: $i] : (intersect(B, union(C, D)) <=> (intersect(B, D) | intersect(B, C)))) | (intersect(intersection(B!3, C!2), union(difference(B!3, C!2), difference(C!2, B!3))) <=> (intersect(intersection(B!3, C!2), difference(B!3, C!2)) | intersect(intersection(B!3, C!2), difference(C!2, B!3))))) <=> ((~![B: $i, C: $i, D: $i] : (intersect(B, union(C, D)) <=> (intersect(B, D) | intersect(B, C)))) | (intersect(intersection(B!3, C!2), union(difference(B!3, C!2), difference(C!2, B!3))) <=> (intersect(intersection(B!3, C!2), difference(B!3, C!2)) | intersect(intersection(B!3, C!2), difference(C!2, B!3)))))),
% 0.11/0.37      inference(rewrite,[status(thm)],[])).
% 0.11/0.37  tff(50,plain,
% 0.11/0.37      ((intersect(intersection(B!3, C!2), union(difference(B!3, C!2), difference(C!2, B!3))) <=> (intersect(intersection(B!3, C!2), difference(C!2, B!3)) | intersect(intersection(B!3, C!2), difference(B!3, C!2)))) <=> (intersect(intersection(B!3, C!2), union(difference(B!3, C!2), difference(C!2, B!3))) <=> (intersect(intersection(B!3, C!2), difference(B!3, C!2)) | intersect(intersection(B!3, C!2), difference(C!2, B!3))))),
% 0.11/0.37      inference(rewrite,[status(thm)],[])).
% 0.11/0.37  tff(51,plain,
% 0.11/0.37      (((~![B: $i, C: $i, D: $i] : (intersect(B, union(C, D)) <=> (intersect(B, D) | intersect(B, C)))) | (intersect(intersection(B!3, C!2), union(difference(B!3, C!2), difference(C!2, B!3))) <=> (intersect(intersection(B!3, C!2), difference(C!2, B!3)) | intersect(intersection(B!3, C!2), difference(B!3, C!2))))) <=> ((~![B: $i, C: $i, D: $i] : (intersect(B, union(C, D)) <=> (intersect(B, D) | intersect(B, C)))) | (intersect(intersection(B!3, C!2), union(difference(B!3, C!2), difference(C!2, B!3))) <=> (intersect(intersection(B!3, C!2), difference(B!3, C!2)) | intersect(intersection(B!3, C!2), difference(C!2, B!3)))))),
% 0.11/0.37      inference(monotonicity,[status(thm)],[50])).
% 0.11/0.37  tff(52,plain,
% 0.11/0.37      (((~![B: $i, C: $i, D: $i] : (intersect(B, union(C, D)) <=> (intersect(B, D) | intersect(B, C)))) | (intersect(intersection(B!3, C!2), union(difference(B!3, C!2), difference(C!2, B!3))) <=> (intersect(intersection(B!3, C!2), difference(C!2, B!3)) | intersect(intersection(B!3, C!2), difference(B!3, C!2))))) <=> ((~![B: $i, C: $i, D: $i] : (intersect(B, union(C, D)) <=> (intersect(B, D) | intersect(B, C)))) | (intersect(intersection(B!3, C!2), union(difference(B!3, C!2), difference(C!2, B!3))) <=> (intersect(intersection(B!3, C!2), difference(B!3, C!2)) | intersect(intersection(B!3, C!2), difference(C!2, B!3)))))),
% 0.11/0.37      inference(transitivity,[status(thm)],[51, 49])).
% 0.11/0.37  tff(53,plain,
% 0.11/0.37      ((~![B: $i, C: $i, D: $i] : (intersect(B, union(C, D)) <=> (intersect(B, D) | intersect(B, C)))) | (intersect(intersection(B!3, C!2), union(difference(B!3, C!2), difference(C!2, B!3))) <=> (intersect(intersection(B!3, C!2), difference(C!2, B!3)) | intersect(intersection(B!3, C!2), difference(B!3, C!2))))),
% 0.11/0.37      inference(quant_inst,[status(thm)],[])).
% 0.11/0.37  tff(54,plain,
% 0.11/0.37      ((~![B: $i, C: $i, D: $i] : (intersect(B, union(C, D)) <=> (intersect(B, D) | intersect(B, C)))) | (intersect(intersection(B!3, C!2), union(difference(B!3, C!2), difference(C!2, B!3))) <=> (intersect(intersection(B!3, C!2), difference(B!3, C!2)) | intersect(intersection(B!3, C!2), difference(C!2, B!3))))),
% 0.11/0.38      inference(modus_ponens,[status(thm)],[53, 52])).
% 0.11/0.38  tff(55,plain,
% 0.11/0.38      (intersect(intersection(B!3, C!2), union(difference(B!3, C!2), difference(C!2, B!3))) <=> (intersect(intersection(B!3, C!2), difference(B!3, C!2)) | intersect(intersection(B!3, C!2), difference(C!2, B!3)))),
% 0.11/0.38      inference(unit_resolution,[status(thm)],[54, 48])).
% 0.11/0.38  tff(56,plain,
% 0.11/0.38      (^[B: $i, C: $i] : refl((symmetric_difference(B, C) = union(difference(B, C), difference(C, B))) <=> (symmetric_difference(B, C) = union(difference(B, C), difference(C, B))))),
% 0.11/0.38      inference(bind,[status(th)],[])).
% 0.11/0.38  tff(57,plain,
% 0.11/0.38      (![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B))) <=> ![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B)))),
% 0.11/0.38      inference(quant_intro,[status(thm)],[56])).
% 0.11/0.38  tff(58,plain,
% 0.11/0.38      (![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B))) <=> ![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B)))),
% 0.11/0.38      inference(rewrite,[status(thm)],[])).
% 0.11/0.38  tff(59,axiom,(![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','symmetric_difference_defn')).
% 0.11/0.38  tff(60,plain,
% 0.11/0.38      (![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B)))),
% 0.11/0.38      inference(modus_ponens,[status(thm)],[59, 58])).
% 0.11/0.38  tff(61,plain,(
% 0.11/0.38      ![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B)))),
% 0.11/0.38      inference(skolemize,[status(sab)],[60])).
% 0.11/0.38  tff(62,plain,
% 0.11/0.38      (![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B)))),
% 0.11/0.38      inference(modus_ponens,[status(thm)],[61, 57])).
% 0.11/0.38  tff(63,plain,
% 0.11/0.38      ((~![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B)))) | (symmetric_difference(B!3, C!2) = union(difference(B!3, C!2), difference(C!2, B!3)))),
% 0.11/0.38      inference(quant_inst,[status(thm)],[])).
% 0.11/0.38  tff(64,plain,
% 0.11/0.38      (symmetric_difference(B!3, C!2) = union(difference(B!3, C!2), difference(C!2, B!3))),
% 0.11/0.38      inference(unit_resolution,[status(thm)],[63, 62])).
% 0.11/0.38  tff(65,plain,
% 0.11/0.38      (union(difference(B!3, C!2), difference(C!2, B!3)) = symmetric_difference(B!3, C!2)),
% 0.11/0.38      inference(symmetry,[status(thm)],[64])).
% 0.11/0.38  tff(66,plain,
% 0.11/0.38      (intersect(intersection(B!3, C!2), union(difference(B!3, C!2), difference(C!2, B!3))) <=> intersect(intersection(B!3, C!2), symmetric_difference(B!3, C!2))),
% 0.11/0.38      inference(monotonicity,[status(thm)],[65])).
% 0.11/0.38  tff(67,plain,
% 0.11/0.38      (intersect(intersection(B!3, C!2), symmetric_difference(B!3, C!2)) <=> intersect(intersection(B!3, C!2), union(difference(B!3, C!2), difference(C!2, B!3)))),
% 0.11/0.38      inference(symmetry,[status(thm)],[66])).
% 0.11/0.38  tff(68,plain,
% 0.11/0.38      ((~![B: $i, C: $i] : (disjoint(B, C) <=> (~intersect(B, C)))) | (disjoint(intersection(B!3, C!2), symmetric_difference(B!3, C!2)) <=> (~intersect(intersection(B!3, C!2), symmetric_difference(B!3, C!2))))),
% 0.11/0.38      inference(quant_inst,[status(thm)],[])).
% 0.11/0.38  tff(69,plain,
% 0.11/0.38      (disjoint(intersection(B!3, C!2), symmetric_difference(B!3, C!2)) <=> (~intersect(intersection(B!3, C!2), symmetric_difference(B!3, C!2)))),
% 0.11/0.38      inference(unit_resolution,[status(thm)],[68, 29])).
% 0.11/0.38  tff(70,plain,
% 0.11/0.38      ((~![B: $i, C: $i] : disjoint(intersection(B, C), symmetric_difference(B, C))) <=> (~![B: $i, C: $i] : disjoint(intersection(B, C), symmetric_difference(B, C)))),
% 0.11/0.38      inference(rewrite,[status(thm)],[])).
% 0.11/0.38  tff(71,axiom,(~![B: $i, C: $i] : disjoint(intersection(B, C), symmetric_difference(B, C))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_intersection_and_symmetric_difference_disjoint')).
% 0.11/0.38  tff(72,plain,
% 0.11/0.38      (~![B: $i, C: $i] : disjoint(intersection(B, C), symmetric_difference(B, C))),
% 0.11/0.38      inference(modus_ponens,[status(thm)],[71, 70])).
% 0.11/0.38  tff(73,plain,
% 0.11/0.38      (~![B: $i, C: $i] : disjoint(intersection(B, C), symmetric_difference(B, C))),
% 0.11/0.38      inference(modus_ponens,[status(thm)],[72, 70])).
% 0.11/0.38  tff(74,plain,
% 0.11/0.38      (~![B: $i, C: $i] : disjoint(intersection(B, C), symmetric_difference(B, C))),
% 0.11/0.38      inference(modus_ponens,[status(thm)],[73, 70])).
% 0.11/0.38  tff(75,plain,
% 0.11/0.38      (~![B: $i, C: $i] : disjoint(intersection(B, C), symmetric_difference(B, C))),
% 0.11/0.38      inference(modus_ponens,[status(thm)],[74, 70])).
% 0.11/0.38  tff(76,plain,
% 0.11/0.38      (~![B: $i, C: $i] : disjoint(intersection(B, C), symmetric_difference(B, C))),
% 0.11/0.38      inference(modus_ponens,[status(thm)],[75, 70])).
% 0.11/0.38  tff(77,plain,
% 0.11/0.38      (~![B: $i, C: $i] : disjoint(intersection(B, C), symmetric_difference(B, C))),
% 0.11/0.38      inference(modus_ponens,[status(thm)],[76, 70])).
% 0.11/0.38  tff(78,plain,
% 0.11/0.38      (~![B: $i, C: $i] : disjoint(intersection(B, C), symmetric_difference(B, C))),
% 0.11/0.38      inference(modus_ponens,[status(thm)],[77, 70])).
% 0.11/0.38  tff(79,plain,(
% 0.11/0.38      ~disjoint(intersection(B!3, C!2), symmetric_difference(B!3, C!2))),
% 0.11/0.38      inference(skolemize,[status(sab)],[78])).
% 0.11/0.38  tff(80,plain,
% 0.11/0.38      ((~(disjoint(intersection(B!3, C!2), symmetric_difference(B!3, C!2)) <=> (~intersect(intersection(B!3, C!2), symmetric_difference(B!3, C!2))))) | disjoint(intersection(B!3, C!2), symmetric_difference(B!3, C!2)) | intersect(intersection(B!3, C!2), symmetric_difference(B!3, C!2))),
% 0.11/0.38      inference(tautology,[status(thm)],[])).
% 0.11/0.38  tff(81,plain,
% 0.11/0.38      ((~(disjoint(intersection(B!3, C!2), symmetric_difference(B!3, C!2)) <=> (~intersect(intersection(B!3, C!2), symmetric_difference(B!3, C!2))))) | intersect(intersection(B!3, C!2), symmetric_difference(B!3, C!2))),
% 0.11/0.38      inference(unit_resolution,[status(thm)],[80, 79])).
% 0.11/0.38  tff(82,plain,
% 0.11/0.38      (intersect(intersection(B!3, C!2), symmetric_difference(B!3, C!2))),
% 0.11/0.38      inference(unit_resolution,[status(thm)],[81, 69])).
% 0.11/0.38  tff(83,plain,
% 0.11/0.38      (intersect(intersection(B!3, C!2), union(difference(B!3, C!2), difference(C!2, B!3)))),
% 0.11/0.38      inference(modus_ponens,[status(thm)],[82, 67])).
% 0.11/0.38  tff(84,plain,
% 0.11/0.38      ((~(intersect(intersection(B!3, C!2), union(difference(B!3, C!2), difference(C!2, B!3))) <=> (intersect(intersection(B!3, C!2), difference(B!3, C!2)) | intersect(intersection(B!3, C!2), difference(C!2, B!3))))) | (~intersect(intersection(B!3, C!2), union(difference(B!3, C!2), difference(C!2, B!3)))) | (intersect(intersection(B!3, C!2), difference(B!3, C!2)) | intersect(intersection(B!3, C!2), difference(C!2, B!3)))),
% 0.11/0.38      inference(tautology,[status(thm)],[])).
% 0.11/0.38  tff(85,plain,
% 0.11/0.38      (intersect(intersection(B!3, C!2), difference(B!3, C!2)) | intersect(intersection(B!3, C!2), difference(C!2, B!3))),
% 0.11/0.38      inference(unit_resolution,[status(thm)],[84, 83, 55])).
% 0.11/0.38  tff(86,plain,
% 0.11/0.38      ((~(intersect(intersection(B!3, C!2), difference(B!3, C!2)) | intersect(intersection(B!3, C!2), difference(C!2, B!3)))) | intersect(intersection(B!3, C!2), difference(B!3, C!2)) | intersect(intersection(B!3, C!2), difference(C!2, B!3))),
% 0.11/0.38      inference(tautology,[status(thm)],[])).
% 0.11/0.38  tff(87,plain,
% 0.11/0.38      (intersect(intersection(B!3, C!2), difference(C!2, B!3))),
% 0.11/0.38      inference(unit_resolution,[status(thm)],[86, 85, 38])).
% 0.11/0.38  tff(88,plain,
% 0.11/0.38      ((~(disjoint(intersection(B!3, C!2), difference(C!2, B!3)) <=> (~intersect(intersection(B!3, C!2), difference(C!2, B!3))))) | (~disjoint(intersection(B!3, C!2), difference(C!2, B!3))) | (~intersect(intersection(B!3, C!2), difference(C!2, B!3)))),
% 0.11/0.38      inference(tautology,[status(thm)],[])).
% 0.11/0.38  tff(89,plain,
% 0.11/0.38      (~disjoint(intersection(B!3, C!2), difference(C!2, B!3))),
% 0.11/0.38      inference(unit_resolution,[status(thm)],[88, 87, 31])).
% 0.11/0.38  tff(90,plain,
% 0.11/0.38      ($false),
% 0.11/0.38      inference(unit_resolution,[status(thm)],[89, 22])).
% 0.11/0.38  % SZS output end Proof
%------------------------------------------------------------------------------