TSTP Solution File: SET076-6 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SET076-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n023.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:05:25 EDT 2022
% Result : Unsatisfiable 0.20s 0.49s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET076-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.12/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n023.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 02:26:33 EDT 2022
% 0.13/0.34 % 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.49 % SZS status Unsatisfiable
% 0.20/0.49 % SZS output start Proof
% 0.20/0.49 tff(member_type, type, (
% 0.20/0.49 member: ( $i * $i ) > $o)).
% 0.20/0.49 tff(z_type, type, (
% 0.20/0.49 z: $i)).
% 0.20/0.49 tff(not_subclass_element_type, type, (
% 0.20/0.49 not_subclass_element: ( $i * $i ) > $i)).
% 0.20/0.49 tff(unordered_pair_type, type, (
% 0.20/0.49 unordered_pair: ( $i * $i ) > $i)).
% 0.20/0.49 tff(y_type, type, (
% 0.20/0.49 y: $i)).
% 0.20/0.49 tff(x_type, type, (
% 0.20/0.49 x: $i)).
% 0.20/0.49 tff(subclass_type, type, (
% 0.20/0.49 subclass: ( $i * $i ) > $o)).
% 0.20/0.49 tff(1,assumption,(not_subclass_element(unordered_pair(x, y), z) = y), introduced(assumption)).
% 0.20/0.49 tff(2,plain,
% 0.20/0.49 (member(not_subclass_element(unordered_pair(x, y), z), z) <=> member(y, z)),
% 0.20/0.49 inference(monotonicity,[status(thm)],[1])).
% 0.20/0.49 tff(3,plain,
% 0.20/0.49 (member(y, z) <=> member(not_subclass_element(unordered_pair(x, y), z), z)),
% 0.20/0.49 inference(symmetry,[status(thm)],[2])).
% 0.20/0.49 tff(4,plain,
% 0.20/0.49 (member(y, z) <=> member(y, z)),
% 0.20/0.49 inference(rewrite,[status(thm)],[])).
% 0.20/0.49 tff(5,axiom,(member(y, z)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_unordered_pair_is_subset_2')).
% 0.20/0.49 tff(6,plain,
% 0.20/0.49 (member(y, z)),
% 0.20/0.49 inference(modus_ponens,[status(thm)],[5, 4])).
% 0.20/0.49 tff(7,plain,
% 0.20/0.49 (member(not_subclass_element(unordered_pair(x, y), z), z)),
% 0.20/0.49 inference(modus_ponens,[status(thm)],[6, 3])).
% 0.20/0.49 tff(8,plain,
% 0.20/0.49 ((~subclass(unordered_pair(x, y), z)) <=> (~subclass(unordered_pair(x, y), z))),
% 0.20/0.49 inference(rewrite,[status(thm)],[])).
% 0.20/0.49 tff(9,axiom,(~subclass(unordered_pair(x, y), z)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_unordered_pair_is_subset_3')).
% 0.20/0.49 tff(10,plain,
% 0.20/0.49 (~subclass(unordered_pair(x, y), z)),
% 0.20/0.49 inference(modus_ponens,[status(thm)],[9, 8])).
% 0.20/0.49 tff(11,plain,
% 0.20/0.49 (^[Y: $i, X: $i] : refl(((~member(not_subclass_element(X, Y), Y)) | subclass(X, Y)) <=> ((~member(not_subclass_element(X, Y), Y)) | subclass(X, Y)))),
% 0.20/0.49 inference(bind,[status(th)],[])).
% 0.20/0.49 tff(12,plain,
% 0.20/0.49 (![Y: $i, X: $i] : ((~member(not_subclass_element(X, Y), Y)) | subclass(X, Y)) <=> ![Y: $i, X: $i] : ((~member(not_subclass_element(X, Y), Y)) | subclass(X, Y))),
% 0.20/0.49 inference(quant_intro,[status(thm)],[11])).
% 0.20/0.49 tff(13,plain,
% 0.20/0.49 (![Y: $i, X: $i] : ((~member(not_subclass_element(X, Y), Y)) | subclass(X, Y)) <=> ![Y: $i, X: $i] : ((~member(not_subclass_element(X, Y), Y)) | subclass(X, Y))),
% 0.20/0.49 inference(rewrite,[status(thm)],[])).
% 0.20/0.49 tff(14,axiom,(![Y: $i, X: $i] : ((~member(not_subclass_element(X, Y), Y)) | subclass(X, Y))), file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax','not_subclass_members2')).
% 0.20/0.49 tff(15,plain,
% 0.20/0.49 (![Y: $i, X: $i] : ((~member(not_subclass_element(X, Y), Y)) | subclass(X, Y))),
% 0.20/0.49 inference(modus_ponens,[status(thm)],[14, 13])).
% 0.20/0.49 tff(16,plain,(
% 0.20/0.49 ![Y: $i, X: $i] : ((~member(not_subclass_element(X, Y), Y)) | subclass(X, Y))),
% 0.20/0.49 inference(skolemize,[status(sab)],[15])).
% 0.20/0.49 tff(17,plain,
% 0.20/0.49 (![Y: $i, X: $i] : ((~member(not_subclass_element(X, Y), Y)) | subclass(X, Y))),
% 0.20/0.49 inference(modus_ponens,[status(thm)],[16, 12])).
% 0.20/0.49 tff(18,plain,
% 0.20/0.49 (((~![Y: $i, X: $i] : ((~member(not_subclass_element(X, Y), Y)) | subclass(X, Y))) | ((~member(not_subclass_element(unordered_pair(x, y), z), z)) | subclass(unordered_pair(x, y), z))) <=> ((~![Y: $i, X: $i] : ((~member(not_subclass_element(X, Y), Y)) | subclass(X, Y))) | (~member(not_subclass_element(unordered_pair(x, y), z), z)) | subclass(unordered_pair(x, y), z))),
% 0.20/0.49 inference(rewrite,[status(thm)],[])).
% 0.20/0.49 tff(19,plain,
% 0.20/0.49 ((~![Y: $i, X: $i] : ((~member(not_subclass_element(X, Y), Y)) | subclass(X, Y))) | ((~member(not_subclass_element(unordered_pair(x, y), z), z)) | subclass(unordered_pair(x, y), z))),
% 0.20/0.49 inference(quant_inst,[status(thm)],[])).
% 0.20/0.49 tff(20,plain,
% 0.20/0.49 ((~![Y: $i, X: $i] : ((~member(not_subclass_element(X, Y), Y)) | subclass(X, Y))) | (~member(not_subclass_element(unordered_pair(x, y), z), z)) | subclass(unordered_pair(x, y), z)),
% 0.20/0.49 inference(modus_ponens,[status(thm)],[19, 18])).
% 0.20/0.49 tff(21,plain,
% 0.20/0.49 (~member(not_subclass_element(unordered_pair(x, y), z), z)),
% 0.20/0.49 inference(unit_resolution,[status(thm)],[20, 17, 10])).
% 0.20/0.49 tff(22,plain,
% 0.20/0.49 ($false),
% 0.20/0.49 inference(unit_resolution,[status(thm)],[21, 7])).
% 0.20/0.49 tff(23,plain,(~(not_subclass_element(unordered_pair(x, y), z) = y)), inference(lemma,lemma(discharge,[]))).
% 0.20/0.49 tff(24,plain,
% 0.20/0.49 (^[Y: $i, X: $i] : refl((subclass(X, Y) | member(not_subclass_element(X, Y), X)) <=> (subclass(X, Y) | member(not_subclass_element(X, Y), X)))),
% 0.20/0.49 inference(bind,[status(th)],[])).
% 0.20/0.49 tff(25,plain,
% 0.20/0.49 (![Y: $i, X: $i] : (subclass(X, Y) | member(not_subclass_element(X, Y), X)) <=> ![Y: $i, X: $i] : (subclass(X, Y) | member(not_subclass_element(X, Y), X))),
% 0.20/0.49 inference(quant_intro,[status(thm)],[24])).
% 0.20/0.49 tff(26,plain,
% 0.20/0.49 (![Y: $i, X: $i] : (subclass(X, Y) | member(not_subclass_element(X, Y), X)) <=> ![Y: $i, X: $i] : (subclass(X, Y) | member(not_subclass_element(X, Y), X))),
% 0.20/0.49 inference(rewrite,[status(thm)],[])).
% 0.20/0.49 tff(27,plain,
% 0.20/0.49 (^[Y: $i, X: $i] : rewrite((member(not_subclass_element(X, Y), X) | subclass(X, Y)) <=> (subclass(X, Y) | member(not_subclass_element(X, Y), X)))),
% 0.20/0.49 inference(bind,[status(th)],[])).
% 0.20/0.49 tff(28,plain,
% 0.20/0.49 (![Y: $i, X: $i] : (member(not_subclass_element(X, Y), X) | subclass(X, Y)) <=> ![Y: $i, X: $i] : (subclass(X, Y) | member(not_subclass_element(X, Y), X))),
% 0.20/0.49 inference(quant_intro,[status(thm)],[27])).
% 0.20/0.49 tff(29,axiom,(![Y: $i, X: $i] : (member(not_subclass_element(X, Y), X) | subclass(X, Y))), file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax','not_subclass_members1')).
% 0.20/0.49 tff(30,plain,
% 0.20/0.49 (![Y: $i, X: $i] : (subclass(X, Y) | member(not_subclass_element(X, Y), X))),
% 0.20/0.49 inference(modus_ponens,[status(thm)],[29, 28])).
% 0.20/0.49 tff(31,plain,
% 0.20/0.49 (![Y: $i, X: $i] : (subclass(X, Y) | member(not_subclass_element(X, Y), X))),
% 0.20/0.49 inference(modus_ponens,[status(thm)],[30, 26])).
% 0.20/0.49 tff(32,plain,(
% 0.20/0.49 ![Y: $i, X: $i] : (subclass(X, Y) | member(not_subclass_element(X, Y), X))),
% 0.20/0.49 inference(skolemize,[status(sab)],[31])).
% 0.20/0.49 tff(33,plain,
% 0.20/0.49 (![Y: $i, X: $i] : (subclass(X, Y) | member(not_subclass_element(X, Y), X))),
% 0.20/0.49 inference(modus_ponens,[status(thm)],[32, 25])).
% 0.20/0.49 tff(34,plain,
% 0.20/0.49 (((~![Y: $i, X: $i] : (subclass(X, Y) | member(not_subclass_element(X, Y), X))) | (subclass(unordered_pair(x, y), z) | member(not_subclass_element(unordered_pair(x, y), z), unordered_pair(x, y)))) <=> ((~![Y: $i, X: $i] : (subclass(X, Y) | member(not_subclass_element(X, Y), X))) | subclass(unordered_pair(x, y), z) | member(not_subclass_element(unordered_pair(x, y), z), unordered_pair(x, y)))),
% 0.20/0.49 inference(rewrite,[status(thm)],[])).
% 0.20/0.49 tff(35,plain,
% 0.20/0.49 ((~![Y: $i, X: $i] : (subclass(X, Y) | member(not_subclass_element(X, Y), X))) | (subclass(unordered_pair(x, y), z) | member(not_subclass_element(unordered_pair(x, y), z), unordered_pair(x, y)))),
% 0.20/0.49 inference(quant_inst,[status(thm)],[])).
% 0.20/0.49 tff(36,plain,
% 0.20/0.49 ((~![Y: $i, X: $i] : (subclass(X, Y) | member(not_subclass_element(X, Y), X))) | subclass(unordered_pair(x, y), z) | member(not_subclass_element(unordered_pair(x, y), z), unordered_pair(x, y))),
% 0.20/0.49 inference(modus_ponens,[status(thm)],[35, 34])).
% 0.20/0.49 tff(37,plain,
% 0.20/0.49 (member(not_subclass_element(unordered_pair(x, y), z), unordered_pair(x, y))),
% 0.20/0.49 inference(unit_resolution,[status(thm)],[36, 33, 10])).
% 0.20/0.49 tff(38,plain,
% 0.20/0.49 (^[Y: $i, U: $i, X: $i] : refl(((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y)))) <=> ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y)))))),
% 0.20/0.49 inference(bind,[status(th)],[])).
% 0.20/0.49 tff(39,plain,
% 0.20/0.49 (![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y)))) <=> ![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))),
% 0.20/0.49 inference(quant_intro,[status(thm)],[38])).
% 0.20/0.49 tff(40,plain,
% 0.20/0.49 (![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y)))) <=> ![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))),
% 0.20/0.49 inference(rewrite,[status(thm)],[])).
% 0.20/0.49 tff(41,plain,
% 0.20/0.49 (^[Y: $i, U: $i, X: $i] : rewrite((((~member(U, unordered_pair(X, Y))) | (U = X)) | (U = Y)) <=> ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y)))))),
% 0.20/0.49 inference(bind,[status(th)],[])).
% 0.20/0.49 tff(42,plain,
% 0.20/0.49 (![Y: $i, U: $i, X: $i] : (((~member(U, unordered_pair(X, Y))) | (U = X)) | (U = Y)) <=> ![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))),
% 0.20/0.49 inference(quant_intro,[status(thm)],[41])).
% 0.20/0.49 tff(43,axiom,(![Y: $i, U: $i, X: $i] : (((~member(U, unordered_pair(X, Y))) | (U = X)) | (U = Y))), file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax','unordered_pair_member')).
% 0.20/0.49 tff(44,plain,
% 0.20/0.49 (![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))),
% 0.20/0.49 inference(modus_ponens,[status(thm)],[43, 42])).
% 0.20/0.49 tff(45,plain,
% 0.20/0.49 (![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))),
% 0.20/0.49 inference(modus_ponens,[status(thm)],[44, 40])).
% 0.20/0.49 tff(46,plain,(
% 0.20/0.49 ![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))),
% 0.20/0.49 inference(skolemize,[status(sab)],[45])).
% 0.20/0.49 tff(47,plain,
% 0.20/0.49 (![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))),
% 0.20/0.49 inference(modus_ponens,[status(thm)],[46, 39])).
% 0.20/0.49 tff(48,plain,
% 0.20/0.49 (((~![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))) | ((not_subclass_element(unordered_pair(x, y), z) = y) | (not_subclass_element(unordered_pair(x, y), z) = x) | (~member(not_subclass_element(unordered_pair(x, y), z), unordered_pair(x, y))))) <=> ((~![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))) | (not_subclass_element(unordered_pair(x, y), z) = y) | (not_subclass_element(unordered_pair(x, y), z) = x) | (~member(not_subclass_element(unordered_pair(x, y), z), unordered_pair(x, y))))),
% 0.20/0.49 inference(rewrite,[status(thm)],[])).
% 0.20/0.49 tff(49,plain,
% 0.20/0.49 ((~![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))) | ((not_subclass_element(unordered_pair(x, y), z) = y) | (not_subclass_element(unordered_pair(x, y), z) = x) | (~member(not_subclass_element(unordered_pair(x, y), z), unordered_pair(x, y))))),
% 0.20/0.49 inference(quant_inst,[status(thm)],[])).
% 0.20/0.49 tff(50,plain,
% 0.20/0.49 ((~![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))) | (not_subclass_element(unordered_pair(x, y), z) = y) | (not_subclass_element(unordered_pair(x, y), z) = x) | (~member(not_subclass_element(unordered_pair(x, y), z), unordered_pair(x, y)))),
% 0.20/0.49 inference(modus_ponens,[status(thm)],[49, 48])).
% 0.20/0.49 tff(51,plain,
% 0.20/0.49 ((not_subclass_element(unordered_pair(x, y), z) = y) | (not_subclass_element(unordered_pair(x, y), z) = x)),
% 0.20/0.49 inference(unit_resolution,[status(thm)],[50, 47, 37])).
% 0.20/0.49 tff(52,plain,
% 0.20/0.49 (not_subclass_element(unordered_pair(x, y), z) = x),
% 0.20/0.49 inference(unit_resolution,[status(thm)],[51, 23])).
% 0.20/0.49 tff(53,plain,
% 0.20/0.49 (member(not_subclass_element(unordered_pair(x, y), z), z) <=> member(x, z)),
% 0.20/0.49 inference(monotonicity,[status(thm)],[52])).
% 0.20/0.49 tff(54,plain,
% 0.20/0.49 (member(x, z) <=> member(not_subclass_element(unordered_pair(x, y), z), z)),
% 0.20/0.49 inference(symmetry,[status(thm)],[53])).
% 0.20/0.49 tff(55,plain,
% 0.20/0.49 (member(x, z) <=> member(x, z)),
% 0.20/0.49 inference(rewrite,[status(thm)],[])).
% 0.20/0.49 tff(56,axiom,(member(x, z)), file('/export/starexec/sandbox/benchmark/theBenchmark.p','prove_unordered_pair_is_subset_1')).
% 0.20/0.49 tff(57,plain,
% 0.20/0.49 (member(x, z)),
% 0.20/0.49 inference(modus_ponens,[status(thm)],[56, 55])).
% 0.20/0.49 tff(58,plain,
% 0.20/0.49 (member(not_subclass_element(unordered_pair(x, y), z), z)),
% 0.20/0.49 inference(modus_ponens,[status(thm)],[57, 54])).
% 0.20/0.49 tff(59,plain,
% 0.20/0.49 ($false),
% 0.20/0.49 inference(unit_resolution,[status(thm)],[21, 58])).
% 0.20/0.49 % SZS output end Proof
%------------------------------------------------------------------------------