TSTP Solution File: SET620+3 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SET620+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n007.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:21 EDT 2022
% Result : Theorem 0.20s 0.40s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET620+3 : TPTP v8.1.0. Released v2.2.0.
% 0.08/0.14 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Sep 3 06:44:04 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.35 Usage: tptp [options] [-file:]file
% 0.13/0.35 -h, -? prints this message.
% 0.13/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.35 -m, -model generate model.
% 0.13/0.35 -p, -proof generate proof.
% 0.13/0.35 -c, -core generate unsat core of named formulas.
% 0.13/0.35 -st, -statistics display statistics.
% 0.13/0.35 -t:timeout set timeout (in second).
% 0.13/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.35 -<param>:<value> configuration parameter and value.
% 0.13/0.35 -o:<output-file> file to place output in.
% 0.20/0.40 % SZS status Theorem
% 0.20/0.40 % SZS output start Proof
% 0.20/0.40 tff(difference_type, type, (
% 0.20/0.40 difference: ( $i * $i ) > $i)).
% 0.20/0.40 tff(intersection_type, type, (
% 0.20/0.40 intersection: ( $i * $i ) > $i)).
% 0.20/0.40 tff(tptp_fun_C_2_type, type, (
% 0.20/0.40 tptp_fun_C_2: $i)).
% 0.20/0.40 tff(tptp_fun_B_3_type, type, (
% 0.20/0.40 tptp_fun_B_3: $i)).
% 0.20/0.40 tff(union_type, type, (
% 0.20/0.40 union: ( $i * $i ) > $i)).
% 0.20/0.40 tff(symmetric_difference_type, type, (
% 0.20/0.40 symmetric_difference: ( $i * $i ) > $i)).
% 0.20/0.40 tff(1,plain,
% 0.20/0.40 (^[B: $i, C: $i, D: $i] : refl((difference(union(B, C), D) = union(difference(B, D), difference(C, D))) <=> (difference(union(B, C), D) = union(difference(B, D), difference(C, D))))),
% 0.20/0.40 inference(bind,[status(th)],[])).
% 0.20/0.40 tff(2,plain,
% 0.20/0.40 (![B: $i, C: $i, D: $i] : (difference(union(B, C), D) = union(difference(B, D), difference(C, D))) <=> ![B: $i, C: $i, D: $i] : (difference(union(B, C), D) = union(difference(B, D), difference(C, D)))),
% 0.20/0.40 inference(quant_intro,[status(thm)],[1])).
% 0.20/0.40 tff(3,plain,
% 0.20/0.40 (![B: $i, C: $i, D: $i] : (difference(union(B, C), D) = union(difference(B, D), difference(C, D))) <=> ![B: $i, C: $i, D: $i] : (difference(union(B, C), D) = union(difference(B, D), difference(C, D)))),
% 0.20/0.40 inference(rewrite,[status(thm)],[])).
% 0.20/0.40 tff(4,axiom,(![B: $i, C: $i, D: $i] : (difference(union(B, C), D) = union(difference(B, D), difference(C, D)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','difference_distributes_over_union')).
% 0.20/0.40 tff(5,plain,
% 0.20/0.40 (![B: $i, C: $i, D: $i] : (difference(union(B, C), D) = union(difference(B, D), difference(C, D)))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[4, 3])).
% 0.20/0.40 tff(6,plain,(
% 0.20/0.40 ![B: $i, C: $i, D: $i] : (difference(union(B, C), D) = union(difference(B, D), difference(C, D)))),
% 0.20/0.40 inference(skolemize,[status(sab)],[5])).
% 0.20/0.40 tff(7,plain,
% 0.20/0.40 (![B: $i, C: $i, D: $i] : (difference(union(B, C), D) = union(difference(B, D), difference(C, D)))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[6, 2])).
% 0.20/0.40 tff(8,plain,
% 0.20/0.40 ((~![B: $i, C: $i, D: $i] : (difference(union(B, C), D) = union(difference(B, D), difference(C, D)))) | (difference(union(B!3, C!2), intersection(B!3, C!2)) = union(difference(B!3, intersection(B!3, C!2)), difference(C!2, intersection(B!3, C!2))))),
% 0.20/0.40 inference(quant_inst,[status(thm)],[])).
% 0.20/0.40 tff(9,plain,
% 0.20/0.40 (difference(union(B!3, C!2), intersection(B!3, C!2)) = union(difference(B!3, intersection(B!3, C!2)), difference(C!2, intersection(B!3, C!2)))),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[8, 7])).
% 0.20/0.40 tff(10,plain,
% 0.20/0.40 (union(difference(B!3, intersection(B!3, C!2)), difference(C!2, intersection(B!3, C!2))) = difference(union(B!3, C!2), intersection(B!3, C!2))),
% 0.20/0.40 inference(symmetry,[status(thm)],[9])).
% 0.20/0.40 tff(11,plain,
% 0.20/0.40 (^[B: $i, C: $i] : refl((intersection(B, C) = intersection(C, B)) <=> (intersection(B, C) = intersection(C, B)))),
% 0.20/0.40 inference(bind,[status(th)],[])).
% 0.20/0.40 tff(12,plain,
% 0.20/0.40 (![B: $i, C: $i] : (intersection(B, C) = intersection(C, B)) <=> ![B: $i, C: $i] : (intersection(B, C) = intersection(C, B))),
% 0.20/0.40 inference(quant_intro,[status(thm)],[11])).
% 0.20/0.40 tff(13,plain,
% 0.20/0.40 (![B: $i, C: $i] : (intersection(B, C) = intersection(C, B)) <=> ![B: $i, C: $i] : (intersection(B, C) = intersection(C, B))),
% 0.20/0.40 inference(rewrite,[status(thm)],[])).
% 0.20/0.40 tff(14,axiom,(![B: $i, C: $i] : (intersection(B, C) = intersection(C, B))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','commutativity_of_intersection')).
% 0.20/0.40 tff(15,plain,
% 0.20/0.40 (![B: $i, C: $i] : (intersection(B, C) = intersection(C, B))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[14, 13])).
% 0.20/0.40 tff(16,plain,(
% 0.20/0.40 ![B: $i, C: $i] : (intersection(B, C) = intersection(C, B))),
% 0.20/0.40 inference(skolemize,[status(sab)],[15])).
% 0.20/0.40 tff(17,plain,
% 0.20/0.40 (![B: $i, C: $i] : (intersection(B, C) = intersection(C, B))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[16, 12])).
% 0.20/0.40 tff(18,plain,
% 0.20/0.40 ((~![B: $i, C: $i] : (intersection(B, C) = intersection(C, B))) | (intersection(C!2, B!3) = intersection(B!3, C!2))),
% 0.20/0.40 inference(quant_inst,[status(thm)],[])).
% 0.20/0.40 tff(19,plain,
% 0.20/0.40 (intersection(C!2, B!3) = intersection(B!3, C!2)),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[18, 17])).
% 0.20/0.40 tff(20,plain,
% 0.20/0.40 (intersection(B!3, C!2) = intersection(C!2, B!3)),
% 0.20/0.40 inference(symmetry,[status(thm)],[19])).
% 0.20/0.40 tff(21,plain,
% 0.20/0.40 (difference(C!2, intersection(B!3, C!2)) = difference(C!2, intersection(C!2, B!3))),
% 0.20/0.40 inference(monotonicity,[status(thm)],[20])).
% 0.20/0.40 tff(22,plain,
% 0.20/0.40 (difference(C!2, intersection(C!2, B!3)) = difference(C!2, intersection(B!3, C!2))),
% 0.20/0.40 inference(symmetry,[status(thm)],[21])).
% 0.20/0.40 tff(23,plain,
% 0.20/0.40 (^[B: $i, C: $i] : refl((difference(B, intersection(B, C)) = difference(B, C)) <=> (difference(B, intersection(B, C)) = difference(B, C)))),
% 0.20/0.40 inference(bind,[status(th)],[])).
% 0.20/0.40 tff(24,plain,
% 0.20/0.40 (![B: $i, C: $i] : (difference(B, intersection(B, C)) = difference(B, C)) <=> ![B: $i, C: $i] : (difference(B, intersection(B, C)) = difference(B, C))),
% 0.20/0.40 inference(quant_intro,[status(thm)],[23])).
% 0.20/0.40 tff(25,plain,
% 0.20/0.40 (![B: $i, C: $i] : (difference(B, intersection(B, C)) = difference(B, C)) <=> ![B: $i, C: $i] : (difference(B, intersection(B, C)) = difference(B, C))),
% 0.20/0.40 inference(rewrite,[status(thm)],[])).
% 0.20/0.40 tff(26,axiom,(![B: $i, C: $i] : (difference(B, intersection(B, C)) = difference(B, C))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','difference_into_intersection')).
% 0.20/0.40 tff(27,plain,
% 0.20/0.40 (![B: $i, C: $i] : (difference(B, intersection(B, C)) = difference(B, C))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[26, 25])).
% 0.20/0.40 tff(28,plain,(
% 0.20/0.40 ![B: $i, C: $i] : (difference(B, intersection(B, C)) = difference(B, C))),
% 0.20/0.40 inference(skolemize,[status(sab)],[27])).
% 0.20/0.40 tff(29,plain,
% 0.20/0.40 (![B: $i, C: $i] : (difference(B, intersection(B, C)) = difference(B, C))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[28, 24])).
% 0.20/0.40 tff(30,plain,
% 0.20/0.40 ((~![B: $i, C: $i] : (difference(B, intersection(B, C)) = difference(B, C))) | (difference(C!2, intersection(C!2, B!3)) = difference(C!2, B!3))),
% 0.20/0.40 inference(quant_inst,[status(thm)],[])).
% 0.20/0.40 tff(31,plain,
% 0.20/0.40 (difference(C!2, intersection(C!2, B!3)) = difference(C!2, B!3)),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[30, 29])).
% 0.20/0.40 tff(32,plain,
% 0.20/0.40 (difference(C!2, B!3) = difference(C!2, intersection(C!2, B!3))),
% 0.20/0.40 inference(symmetry,[status(thm)],[31])).
% 0.20/0.40 tff(33,plain,
% 0.20/0.40 (difference(C!2, B!3) = difference(C!2, intersection(B!3, C!2))),
% 0.20/0.40 inference(transitivity,[status(thm)],[32, 22])).
% 0.20/0.40 tff(34,plain,
% 0.20/0.40 ((~![B: $i, C: $i] : (difference(B, intersection(B, C)) = difference(B, C))) | (difference(B!3, intersection(B!3, C!2)) = difference(B!3, C!2))),
% 0.20/0.40 inference(quant_inst,[status(thm)],[])).
% 0.20/0.40 tff(35,plain,
% 0.20/0.40 (difference(B!3, intersection(B!3, C!2)) = difference(B!3, C!2)),
% 0.20/0.40 inference(unit_resolution,[status(thm)],[34, 29])).
% 0.20/0.40 tff(36,plain,
% 0.20/0.40 (difference(B!3, C!2) = difference(B!3, intersection(B!3, C!2))),
% 0.20/0.40 inference(symmetry,[status(thm)],[35])).
% 0.20/0.40 tff(37,plain,
% 0.20/0.40 (union(difference(B!3, C!2), difference(C!2, B!3)) = union(difference(B!3, intersection(B!3, C!2)), difference(C!2, intersection(B!3, C!2)))),
% 0.20/0.40 inference(monotonicity,[status(thm)],[36, 33])).
% 0.20/0.40 tff(38,plain,
% 0.20/0.40 (^[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.20/0.40 inference(bind,[status(th)],[])).
% 0.20/0.40 tff(39,plain,
% 0.20/0.40 (![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.20/0.40 inference(quant_intro,[status(thm)],[38])).
% 0.20/0.40 tff(40,plain,
% 0.20/0.40 (![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.20/0.40 inference(rewrite,[status(thm)],[])).
% 0.20/0.40 tff(41,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.20/0.40 tff(42,plain,
% 0.20/0.40 (![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B)))),
% 0.20/0.40 inference(modus_ponens,[status(thm)],[41, 40])).
% 0.20/0.40 tff(43,plain,(
% 0.20/0.40 ![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B)))),
% 0.20/0.41 inference(skolemize,[status(sab)],[42])).
% 0.20/0.41 tff(44,plain,
% 0.20/0.41 (![B: $i, C: $i] : (symmetric_difference(B, C) = union(difference(B, C), difference(C, B)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[43, 39])).
% 0.20/0.41 tff(45,plain,
% 0.20/0.41 ((~![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.20/0.41 inference(quant_inst,[status(thm)],[])).
% 0.20/0.41 tff(46,plain,
% 0.20/0.41 (symmetric_difference(B!3, C!2) = union(difference(B!3, C!2), difference(C!2, B!3))),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[45, 44])).
% 0.20/0.41 tff(47,plain,
% 0.20/0.41 (symmetric_difference(B!3, C!2) = difference(union(B!3, C!2), intersection(B!3, C!2))),
% 0.20/0.41 inference(transitivity,[status(thm)],[46, 37, 10])).
% 0.20/0.41 tff(48,plain,
% 0.20/0.41 ((~![B: $i, C: $i] : (symmetric_difference(B, C) = difference(union(B, C), intersection(B, C)))) <=> (~![B: $i, C: $i] : (symmetric_difference(B, C) = difference(union(B, C), intersection(B, C))))),
% 0.20/0.41 inference(rewrite,[status(thm)],[])).
% 0.20/0.41 tff(49,axiom,(~![B: $i, C: $i] : (symmetric_difference(B, C) = difference(union(B, C), intersection(B, C)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_th96')).
% 0.20/0.41 tff(50,plain,
% 0.20/0.41 (~![B: $i, C: $i] : (symmetric_difference(B, C) = difference(union(B, C), intersection(B, C)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[49, 48])).
% 0.20/0.41 tff(51,plain,
% 0.20/0.41 (~![B: $i, C: $i] : (symmetric_difference(B, C) = difference(union(B, C), intersection(B, C)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[50, 48])).
% 0.20/0.41 tff(52,plain,
% 0.20/0.41 (~![B: $i, C: $i] : (symmetric_difference(B, C) = difference(union(B, C), intersection(B, C)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[51, 48])).
% 0.20/0.41 tff(53,plain,
% 0.20/0.41 (~![B: $i, C: $i] : (symmetric_difference(B, C) = difference(union(B, C), intersection(B, C)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[52, 48])).
% 0.20/0.41 tff(54,plain,
% 0.20/0.41 (~![B: $i, C: $i] : (symmetric_difference(B, C) = difference(union(B, C), intersection(B, C)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[53, 48])).
% 0.20/0.41 tff(55,plain,
% 0.20/0.41 (~![B: $i, C: $i] : (symmetric_difference(B, C) = difference(union(B, C), intersection(B, C)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[54, 48])).
% 0.20/0.41 tff(56,plain,
% 0.20/0.41 (~![B: $i, C: $i] : (symmetric_difference(B, C) = difference(union(B, C), intersection(B, C)))),
% 0.20/0.41 inference(modus_ponens,[status(thm)],[55, 48])).
% 0.20/0.41 tff(57,plain,(
% 0.20/0.41 ~(symmetric_difference(B!3, C!2) = difference(union(B!3, C!2), intersection(B!3, C!2)))),
% 0.20/0.41 inference(skolemize,[status(sab)],[56])).
% 0.20/0.41 tff(58,plain,
% 0.20/0.41 ($false),
% 0.20/0.41 inference(unit_resolution,[status(thm)],[57, 47])).
% 0.20/0.41 % SZS output end Proof
%------------------------------------------------------------------------------