TSTP Solution File: SET019^4 by Satallax---3.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Satallax---3.5
% Problem  : SET019^4 : TPTP v8.1.0. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s

% Computer : n025.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  : 600s
% DateTime : Tue Jul 19 04:49:50 EDT 2022

% Result   : Theorem 1.99s 2.24s
% Output   : Proof 1.99s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET019^4 : TPTP v8.1.0. Released v8.1.0.
% 0.07/0.13  % Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.12/0.34  % Computer : n025.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jul  9 21:11:46 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.99/2.24  % SZS status Theorem
% 1.99/2.24  % Mode: mode506
% 1.99/2.24  % Inferences: 8080
% 1.99/2.24  % SZS output start Proof
% 1.99/2.24  thf(ty_mworld, type, mworld : $tType).
% 1.99/2.24  thf(ty_eiw_di, type, eiw_di : ($i>mworld>$o)).
% 1.99/2.24  thf(ty_subset, type, subset : ($i>$i>mworld>$o)).
% 1.99/2.24  thf(ty_eigen__1, type, eigen__1 : $i).
% 1.99/2.24  thf(ty_eigen__0, type, eigen__0 : $i).
% 1.99/2.24  thf(ty_equal_set, type, equal_set : ($i>$i>mworld>$o)).
% 1.99/2.24  thf(ty_mactual, type, mactual : mworld).
% 1.99/2.24  thf(h0, assumption, (![X1:$i>$o]:(![X2:$i]:((X1 @ X2) => (X1 @ (eps__0 @ X1))))),introduced(assumption,[])).
% 1.99/2.24  thf(eigendef_eigen__1, definition, eigen__1 = (eps__0 @ (^[X1:$i]:(~((((eiw_di @ X1) @ mactual) => ((~(((((subset @ eigen__0) @ X1) @ mactual) => (~((((subset @ X1) @ eigen__0) @ mactual)))))) => (((equal_set @ eigen__0) @ X1) @ mactual))))))), introduced(definition,[new_symbols(definition,[eigen__1])])).
% 1.99/2.24  thf(eigendef_eigen__0, definition, eigen__0 = (eps__0 @ (^[X1:$i]:(~((((eiw_di @ X1) @ mactual) => (![X2:$i]:(((eiw_di @ X2) @ mactual) => ((~(((((subset @ X1) @ X2) @ mactual) => (~((((subset @ X2) @ X1) @ mactual)))))) => (((equal_set @ X1) @ X2) @ mactual))))))))), introduced(definition,[new_symbols(definition,[eigen__0])])).
% 1.99/2.24  thf(sP1,plain,sP1 <=> ((((subset @ eigen__0) @ eigen__1) @ mactual) => (~((((subset @ eigen__1) @ eigen__0) @ mactual)))),introduced(definition,[new_symbols(definition,[sP1])])).
% 1.99/2.24  thf(sP2,plain,sP2 <=> (![X1:$i]:(((eiw_di @ X1) @ mactual) => ((~(((((subset @ eigen__0) @ X1) @ mactual) => (~((((subset @ X1) @ eigen__0) @ mactual)))))) => (((equal_set @ eigen__0) @ X1) @ mactual)))),introduced(definition,[new_symbols(definition,[sP2])])).
% 1.99/2.24  thf(sP3,plain,sP3 <=> ((~(sP1)) => (((equal_set @ eigen__0) @ eigen__1) @ mactual)),introduced(definition,[new_symbols(definition,[sP3])])).
% 1.99/2.24  thf(sP4,plain,sP4 <=> (((((equal_set @ eigen__0) @ eigen__1) @ mactual) = (~(sP1))) => sP1),introduced(definition,[new_symbols(definition,[sP4])])).
% 1.99/2.24  thf(sP5,plain,sP5 <=> ((eiw_di @ eigen__1) @ mactual),introduced(definition,[new_symbols(definition,[sP5])])).
% 1.99/2.24  thf(sP6,plain,sP6 <=> ((~((((equal_set @ eigen__0) @ eigen__1) @ mactual))) => (![X1:$o]:(((((equal_set @ eigen__0) @ eigen__1) @ mactual) = X1) => (~(X1))))),introduced(definition,[new_symbols(definition,[sP6])])).
% 1.99/2.24  thf(sP7,plain,sP7 <=> (((eiw_di @ eigen__0) @ mactual) => sP2),introduced(definition,[new_symbols(definition,[sP7])])).
% 1.99/2.24  thf(sP8,plain,sP8 <=> (((equal_set @ eigen__0) @ eigen__1) @ mactual),introduced(definition,[new_symbols(definition,[sP8])])).
% 1.99/2.24  thf(sP9,plain,sP9 <=> (sP5 => (sP8 = (~(sP1)))),introduced(definition,[new_symbols(definition,[sP9])])).
% 1.99/2.24  thf(sP10,plain,sP10 <=> ((eiw_di @ eigen__0) @ mactual),introduced(definition,[new_symbols(definition,[sP10])])).
% 1.99/2.24  thf(sP11,plain,sP11 <=> (![X1:$i]:(((eiw_di @ X1) @ mactual) => (![X2:$i]:(((eiw_di @ X2) @ mactual) => ((((equal_set @ X1) @ X2) @ mactual) = (~(((((subset @ X1) @ X2) @ mactual) => (~((((subset @ X2) @ X1) @ mactual))))))))))),introduced(definition,[new_symbols(definition,[sP11])])).
% 1.99/2.24  thf(sP12,plain,sP12 <=> (sP8 = (~(sP1))),introduced(definition,[new_symbols(definition,[sP12])])).
% 1.99/2.24  thf(sP13,plain,sP13 <=> (sP10 => (![X1:$i]:(((eiw_di @ X1) @ mactual) => ((((equal_set @ eigen__0) @ X1) @ mactual) = (~(((((subset @ eigen__0) @ X1) @ mactual) => (~((((subset @ X1) @ eigen__0) @ mactual)))))))))),introduced(definition,[new_symbols(definition,[sP13])])).
% 1.99/2.24  thf(sP14,plain,sP14 <=> (sP5 => sP3),introduced(definition,[new_symbols(definition,[sP14])])).
% 1.99/2.24  thf(sP15,plain,sP15 <=> (![X1:$i]:(((eiw_di @ X1) @ mactual) => ((((equal_set @ eigen__0) @ X1) @ mactual) = (~(((((subset @ eigen__0) @ X1) @ mactual) => (~((((subset @ X1) @ eigen__0) @ mactual))))))))),introduced(definition,[new_symbols(definition,[sP15])])).
% 1.99/2.24  thf(sP16,plain,sP16 <=> (![X1:$o]:(![X2:$o>$o]:((X2 @ X1) => (![X3:$o]:((X1 = X3) => (X2 @ X3)))))),introduced(definition,[new_symbols(definition,[sP16])])).
% 1.99/2.24  thf(sP17,plain,sP17 <=> (![X1:$i]:(((eiw_di @ X1) @ mactual) => (![X2:$i]:(((eiw_di @ X2) @ mactual) => ((~(((((subset @ X1) @ X2) @ mactual) => (~((((subset @ X2) @ X1) @ mactual)))))) => (((equal_set @ X1) @ X2) @ mactual)))))),introduced(definition,[new_symbols(definition,[sP17])])).
% 1.99/2.24  thf(sP18,plain,sP18 <=> (![X1:$o]:((sP8 = X1) => (~(X1)))),introduced(definition,[new_symbols(definition,[sP18])])).
% 1.99/2.24  thf(sP19,plain,sP19 <=> (![X1:$o>$o]:((X1 @ sP8) => (![X2:$o]:((sP8 = X2) => (X1 @ X2))))),introduced(definition,[new_symbols(definition,[sP19])])).
% 1.99/2.24  thf(def_mlocal,definition,(mlocal = (^[X1:mworld>$o]:(X1 @ mactual)))).
% 1.99/2.24  thf(def_mnot,definition,(mnot = (^[X1:mworld>$o]:(^[X2:mworld]:(~((X1 @ X2))))))).
% 1.99/2.24  thf(def_mand,definition,(mand = (^[X1:mworld>$o]:(^[X2:mworld>$o]:(^[X3:mworld]:(~(((X1 @ X3) => (~((X2 @ X3))))))))))).
% 1.99/2.24  thf(def_mor,definition,(mor = (^[X1:mworld>$o]:(^[X2:mworld>$o]:(^[X3:mworld]:((~((X1 @ X3))) => (X2 @ X3))))))).
% 1.99/2.24  thf(def_mimplies,definition,(mimplies = (^[X1:mworld>$o]:(^[X2:mworld>$o]:(^[X3:mworld]:((X1 @ X3) => (X2 @ X3))))))).
% 1.99/2.24  thf(def_mequiv,definition,(mequiv = (^[X1:mworld>$o]:(^[X2:mworld>$o]:(^[X3:mworld]:((X1 @ X3) = (X2 @ X3))))))).
% 1.99/2.24  thf(def_mbox,definition,(mbox = (^[X1:mworld>$o]:(^[X2:mworld]:(![X3:mworld]:(((mrel @ X2) @ X3) => (X1 @ X3))))))).
% 1.99/2.24  thf(def_mdia,definition,(mdia = (^[X1:mworld>$o]:(^[X2:mworld]:(~((![X3:mworld]:(((mrel @ X2) @ X3) => (~((X1 @ X3))))))))))).
% 1.99/2.24  thf(def_mforall_di,definition,(mforall_di = (^[X1:$i>mworld>$o]:(^[X2:mworld]:(![X3:$i]:(((eiw_di @ X3) @ X2) => ((X1 @ X3) @ X2))))))).
% 1.99/2.24  thf(def_mexists_di,definition,(mexists_di = (^[X1:$i>mworld>$o]:(^[X2:mworld]:(~((![X3:$i]:(((eiw_di @ X3) @ X2) => (~(((X1 @ X3) @ X2))))))))))).
% 1.99/2.24  thf(thI02,conjecture,sP17).
% 1.99/2.24  thf(h1,negated_conjecture,(~(sP17)),inference(assume_negation,[status(cth)],[thI02])).
% 1.99/2.24  thf(1,plain,((~(sP4) | ~(sP12)) | sP1),inference(prop_rule,[status(thm)],[])).
% 1.99/2.24  thf(2,plain,(~(sP18) | sP4),inference(all_rule,[status(thm)],[])).
% 1.99/2.24  thf(3,plain,((~(sP6) | sP8) | sP18),inference(prop_rule,[status(thm)],[])).
% 1.99/2.24  thf(4,plain,(~(sP19) | sP6),inference(all_rule,[status(thm)],[])).
% 1.99/2.24  thf(5,plain,(~(sP11) | sP13),inference(all_rule,[status(thm)],[])).
% 1.99/2.24  thf(6,plain,((~(sP13) | ~(sP10)) | sP15),inference(prop_rule,[status(thm)],[])).
% 1.99/2.24  thf(7,plain,(~(sP15) | sP9),inference(all_rule,[status(thm)],[])).
% 1.99/2.24  thf(8,plain,((~(sP9) | ~(sP5)) | sP12),inference(prop_rule,[status(thm)],[])).
% 1.99/2.24  thf(9,plain,(~(sP16) | sP19),inference(all_rule,[status(thm)],[])).
% 1.99/2.24  thf(10,plain,sP16,inference(eq_ind,[status(thm)],[])).
% 1.99/2.24  thf(11,plain,(sP3 | ~(sP8)),inference(prop_rule,[status(thm)],[])).
% 1.99/2.24  thf(12,plain,(sP3 | ~(sP1)),inference(prop_rule,[status(thm)],[])).
% 1.99/2.24  thf(13,plain,(sP14 | ~(sP3)),inference(prop_rule,[status(thm)],[])).
% 1.99/2.24  thf(14,plain,(sP14 | sP5),inference(prop_rule,[status(thm)],[])).
% 1.99/2.24  thf(15,plain,(sP2 | ~(sP14)),inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__1])).
% 1.99/2.24  thf(16,plain,(sP7 | ~(sP2)),inference(prop_rule,[status(thm)],[])).
% 1.99/2.24  thf(17,plain,(sP7 | sP10),inference(prop_rule,[status(thm)],[])).
% 1.99/2.24  thf(18,plain,(sP17 | ~(sP7)),inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__0])).
% 1.99/2.24  thf(equal_set_0,axiom,(mlocal @ (mforall_di @ (^[X1:$i]:(mforall_di @ (^[X2:$i]:((mequiv @ ((equal_set @ X1) @ X2)) @ ((mand @ ((subset @ X1) @ X2)) @ ((subset @ X2) @ X1))))))))).
% 1.99/2.24  thf(19,plain,sP11,inference(preprocess,[status(thm)],[equal_set_0]).
% 1.99/2.24  thf(20,plain,$false,inference(prop_unsat,[status(thm),assumptions([h1,h0])],[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,h1])).
% 1.99/2.24  thf(21,plain,$false,inference(eigenvar_choice,[status(thm),assumptions([h1]),eigenvar_choice(discharge,[h0])],[20,h0])).
% 1.99/2.24  thf(0,theorem,sP17,inference(contra,[status(thm),contra(discharge,[h1])],[20,h1])).
% 1.99/2.24  % SZS output end Proof
%------------------------------------------------------------------------------