↑ Up

Z3---4.15.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : SET076-7 : TPTP v9.0.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_E %s %d THM

% Computer : n003.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 : Sat Jun 21 05:25:07 AM UTC 2025

% Result   : Unsatisfiable 0.86s 1.02s
% Output   : Proof 0.86s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : SET076-7 : TPTP v9.0.0. Bugfixed v2.1.0.
% 0.04/0.12  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n003.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   : Fri Jun 20 04:12:54 EDT 2025
% 0.13/0.34  % CPUTime    : 
% 0.86/1.02  % SZS status Unsatisfiable
% 0.86/1.02  % SZS output start Proof
% 0.86/1.02  tff(member_type, type, (
% 0.86/1.02     member: ( $i * $i ) > $o)).
% 0.86/1.02  tff(z_type, type, (
% 0.86/1.02     z: $i)).
% 0.86/1.02  tff(not_subclass_element_type, type, (
% 0.86/1.02     not_subclass_element: ( $i * $i ) > $i)).
% 0.86/1.02  tff(unordered_pair_type, type, (
% 0.86/1.02     unordered_pair: ( $i * $i ) > $i)).
% 0.86/1.02  tff(y_type, type, (
% 0.86/1.02     y: $i)).
% 0.86/1.02  tff(x_type, type, (
% 0.86/1.02     x: $i)).
% 0.86/1.02  tff(subclass_type, type, (
% 0.86/1.02     subclass: ( $i * $i ) > $o)).
% 0.86/1.02  tff(1,assumption,(not_subclass_element(unordered_pair(x, y), z) = x), introduced(assumption)).
% 0.86/1.02  tff(2,plain,
% 0.86/1.02      (member(not_subclass_element(unordered_pair(x, y), z), z) <=> member(x, z)),
% 0.86/1.02      inference(monotonicity,[status(thm)],[1])).
% 0.86/1.02  tff(3,plain,
% 0.86/1.02      (member(x, z) <=> member(not_subclass_element(unordered_pair(x, y), z), z)),
% 0.86/1.02      inference(symmetry,[status(thm)],[2])).
% 0.86/1.02  tff(4,plain,
% 0.86/1.02      (member(x, z) <=> member(x, z)),
% 0.86/1.02      inference(rewrite,[status(thm)],[])).
% 0.86/1.02  tff(5,axiom,(member(x, z)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','prove_unordered_pair_is_subset_1')).
% 0.86/1.02  tff(6,plain,
% 0.86/1.02      (member(x, z)),
% 0.86/1.02      inference(modus_ponens,[status(thm)],[5, 4])).
% 0.86/1.02  tff(7,plain,
% 0.86/1.02      (member(not_subclass_element(unordered_pair(x, y), z), z)),
% 0.86/1.02      inference(modus_ponens,[status(thm)],[6, 3])).
% 0.86/1.02  tff(8,plain,
% 0.86/1.02      ((~subclass(unordered_pair(x, y), z)) <=> (~subclass(unordered_pair(x, y), z))),
% 0.86/1.02      inference(rewrite,[status(thm)],[])).
% 0.86/1.02  tff(9,axiom,(~subclass(unordered_pair(x, y), z)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','prove_unordered_pair_is_subset_3')).
% 0.86/1.02  tff(10,plain,
% 0.86/1.02      (~subclass(unordered_pair(x, y), z)),
% 0.86/1.02      inference(modus_ponens,[status(thm)],[9, 8])).
% 0.86/1.02  tff(11,plain,
% 0.86/1.02      (^[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.86/1.02      inference(bind,[status(th)],[])).
% 0.86/1.02  tff(12,plain,
% 0.86/1.02      (![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.86/1.02      inference(quant_intro,[status(thm)],[11])).
% 0.86/1.02  tff(13,plain,
% 0.86/1.02      (![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.86/1.02      inference(rewrite,[status(thm)],[])).
% 0.86/1.02  tff(14,axiom,(![Y: $i, X: $i] : ((~member(not_subclass_element(X, Y), Y)) | subclass(X, Y))), file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax','not_subclass_members2')).
% 0.86/1.02  tff(15,plain,
% 0.86/1.02      (![Y: $i, X: $i] : ((~member(not_subclass_element(X, Y), Y)) | subclass(X, Y))),
% 0.86/1.02      inference(modus_ponens,[status(thm)],[14, 13])).
% 0.86/1.02  tff(16,plain,(
% 0.86/1.02      ![Y: $i, X: $i] : ((~member(not_subclass_element(X, Y), Y)) | subclass(X, Y))),
% 0.86/1.02      inference(skolemize,[status(sab)],[15])).
% 0.86/1.02  tff(17,plain,
% 0.86/1.02      (![Y: $i, X: $i] : ((~member(not_subclass_element(X, Y), Y)) | subclass(X, Y))),
% 0.86/1.02      inference(modus_ponens,[status(thm)],[16, 12])).
% 0.86/1.02  tff(18,plain,
% 0.86/1.02      (((~![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.86/1.02      inference(rewrite,[status(thm)],[])).
% 0.86/1.02  tff(19,plain,
% 0.86/1.02      ((~![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.86/1.02      inference(quant_inst,[status(thm)],[])).
% 0.86/1.02  tff(20,plain,
% 0.86/1.02      ((~![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.86/1.02      inference(modus_ponens,[status(thm)],[19, 18])).
% 0.86/1.02  tff(21,plain,
% 0.86/1.02      (~member(not_subclass_element(unordered_pair(x, y), z), z)),
% 0.86/1.02      inference(unit_resolution,[status(thm)],[20, 17, 10])).
% 0.86/1.02  tff(22,plain,
% 0.86/1.02      ($false),
% 0.86/1.02      inference(unit_resolution,[status(thm)],[21, 7])).
% 0.86/1.02  tff(23,plain,(~(not_subclass_element(unordered_pair(x, y), z) = x)), inference(lemma,lemma(discharge,[]))).
% 0.86/1.02  tff(24,plain,
% 0.86/1.02      (^[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.86/1.02      inference(bind,[status(th)],[])).
% 0.86/1.02  tff(25,plain,
% 0.86/1.02      (![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.86/1.02      inference(quant_intro,[status(thm)],[24])).
% 0.86/1.02  tff(26,plain,
% 0.86/1.02      (![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.86/1.02      inference(rewrite,[status(thm)],[])).
% 0.86/1.02  tff(27,plain,
% 0.86/1.02      (^[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.86/1.02      inference(bind,[status(th)],[])).
% 0.86/1.02  tff(28,plain,
% 0.86/1.02      (![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.86/1.02      inference(quant_intro,[status(thm)],[27])).
% 0.86/1.02  tff(29,axiom,(![Y: $i, X: $i] : (member(not_subclass_element(X, Y), X) | subclass(X, Y))), file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax','not_subclass_members1')).
% 0.86/1.02  tff(30,plain,
% 0.86/1.02      (![Y: $i, X: $i] : (subclass(X, Y) | member(not_subclass_element(X, Y), X))),
% 0.86/1.02      inference(modus_ponens,[status(thm)],[29, 28])).
% 0.86/1.02  tff(31,plain,
% 0.86/1.02      (![Y: $i, X: $i] : (subclass(X, Y) | member(not_subclass_element(X, Y), X))),
% 0.86/1.02      inference(modus_ponens,[status(thm)],[30, 26])).
% 0.86/1.02  tff(32,plain,(
% 0.86/1.02      ![Y: $i, X: $i] : (subclass(X, Y) | member(not_subclass_element(X, Y), X))),
% 0.86/1.02      inference(skolemize,[status(sab)],[31])).
% 0.86/1.02  tff(33,plain,
% 0.86/1.02      (![Y: $i, X: $i] : (subclass(X, Y) | member(not_subclass_element(X, Y), X))),
% 0.86/1.02      inference(modus_ponens,[status(thm)],[32, 25])).
% 0.86/1.02  tff(34,plain,
% 0.86/1.02      (((~![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.86/1.02      inference(rewrite,[status(thm)],[])).
% 0.86/1.02  tff(35,plain,
% 0.86/1.02      ((~![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.86/1.02      inference(quant_inst,[status(thm)],[])).
% 0.86/1.02  tff(36,plain,
% 0.86/1.02      ((~![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.86/1.02      inference(modus_ponens,[status(thm)],[35, 34])).
% 0.86/1.02  tff(37,plain,
% 0.86/1.02      (member(not_subclass_element(unordered_pair(x, y), z), unordered_pair(x, y))),
% 0.86/1.02      inference(unit_resolution,[status(thm)],[36, 33, 10])).
% 0.86/1.02  tff(38,plain,
% 0.86/1.02      (^[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.86/1.02      inference(bind,[status(th)],[])).
% 0.86/1.02  tff(39,plain,
% 0.86/1.02      (![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.86/1.02      inference(quant_intro,[status(thm)],[38])).
% 0.86/1.02  tff(40,plain,
% 0.86/1.02      (![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.86/1.02      inference(rewrite,[status(thm)],[])).
% 0.86/1.02  tff(41,plain,
% 0.86/1.02      (^[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.86/1.02      inference(bind,[status(th)],[])).
% 0.86/1.02  tff(42,plain,
% 0.86/1.02      (![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.86/1.02      inference(quant_intro,[status(thm)],[41])).
% 0.86/1.02  tff(43,axiom,(![Y: $i, U: $i, X: $i] : (((~member(U, unordered_pair(X, Y))) | (U = X)) | (U = Y))), file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax','unordered_pair_member')).
% 0.86/1.02  tff(44,plain,
% 0.86/1.02      (![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))),
% 0.86/1.02      inference(modus_ponens,[status(thm)],[43, 42])).
% 0.86/1.02  tff(45,plain,
% 0.86/1.02      (![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))),
% 0.86/1.02      inference(modus_ponens,[status(thm)],[44, 40])).
% 0.86/1.02  tff(46,plain,(
% 0.86/1.02      ![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))),
% 0.86/1.02      inference(skolemize,[status(sab)],[45])).
% 0.86/1.02  tff(47,plain,
% 0.86/1.02      (![Y: $i, U: $i, X: $i] : ((U = Y) | (U = X) | (~member(U, unordered_pair(X, Y))))),
% 0.86/1.02      inference(modus_ponens,[status(thm)],[46, 39])).
% 0.86/1.02  tff(48,plain,
% 0.86/1.02      (((~![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.86/1.02      inference(rewrite,[status(thm)],[])).
% 0.86/1.02  tff(49,plain,
% 0.86/1.02      ((~![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.86/1.02      inference(quant_inst,[status(thm)],[])).
% 0.86/1.02  tff(50,plain,
% 0.86/1.02      ((~![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.86/1.02      inference(modus_ponens,[status(thm)],[49, 48])).
% 0.86/1.02  tff(51,plain,
% 0.86/1.02      ((not_subclass_element(unordered_pair(x, y), z) = y) | (not_subclass_element(unordered_pair(x, y), z) = x)),
% 0.86/1.02      inference(unit_resolution,[status(thm)],[50, 47, 37])).
% 0.86/1.02  tff(52,plain,
% 0.86/1.02      (not_subclass_element(unordered_pair(x, y), z) = y),
% 0.86/1.02      inference(unit_resolution,[status(thm)],[51, 23])).
% 0.86/1.02  tff(53,plain,
% 0.86/1.02      (member(not_subclass_element(unordered_pair(x, y), z), z) <=> member(y, z)),
% 0.86/1.02      inference(monotonicity,[status(thm)],[52])).
% 0.86/1.02  tff(54,plain,
% 0.86/1.02      (member(y, z) <=> member(not_subclass_element(unordered_pair(x, y), z), z)),
% 0.86/1.02      inference(symmetry,[status(thm)],[53])).
% 0.86/1.02  tff(55,plain,
% 0.86/1.02      (member(y, z) <=> member(y, z)),
% 0.86/1.02      inference(rewrite,[status(thm)],[])).
% 0.86/1.02  tff(56,axiom,(member(y, z)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p','prove_unordered_pair_is_subset_2')).
% 0.86/1.02  tff(57,plain,
% 0.86/1.02      (member(y, z)),
% 0.86/1.02      inference(modus_ponens,[status(thm)],[56, 55])).
% 0.86/1.02  tff(58,plain,
% 0.86/1.02      (member(not_subclass_element(unordered_pair(x, y), z), z)),
% 0.86/1.02      inference(modus_ponens,[status(thm)],[57, 54])).
% 0.86/1.02  tff(59,plain,
% 0.86/1.02      ($false),
% 0.86/1.02      inference(unit_resolution,[status(thm)],[21, 58])).
% 0.86/1.02  % SZS output end Proof
% 0.86/1.03  % E exiting
%------------------------------------------------------------------------------