%------------------------------------------------------------------------------ % File : Satallax---3.5 % Problem : PHI002^2 : TPTP v9.2.0. Released v6.1.0. % Transfm : none % Format : tptp:raw % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s % Computer : n015.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 : Thu Oct 9 02:13:37 PM UTC 2025 % Result : Theorem 1.10s 1.37s % Output : Proof 1.10s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : PHI002^2 : TPTP v9.2.0. Released v6.1.0. % 0.08/0.13 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s % 0.13/0.34 % Computer : n015.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.35 % DateTime : Wed Oct 8 23:17:23 EDT 2025 % 0.13/0.35 % CPUTime : % 1.10/1.37 % SZS status Theorem % 1.10/1.37 % Mode: mode506 % 1.10/1.37 % Inferences: 49128 % 1.10/1.37 % SZS output start Proof % 1.10/1.37 thf(ty_mu, type, mu : $tType). % 1.10/1.37 thf(ty_eigen__1, type, eigen__1 : (mu>$i>$o)). % 1.10/1.37 thf(ty_eigen__0, type, eigen__0 : $i). % 1.10/1.37 thf(ty_positive, type, positive : ((mu>$i>$o)>$i>$o)). % 1.10/1.37 thf(ty_eigen__11, type, eigen__11 : $i). % 1.10/1.37 thf(ty_rel, type, rel : ($i>$i>$o)). % 1.10/1.37 thf(ty_eigen__22, type, eigen__22 : mu). % 1.10/1.37 thf(h0, assumption, (![X1:$i>$o]:(![X2:$i]:((X1 @ X2) => (X1 @ (eps__0 @ X1))))),introduced(assumption,[])). % 1.10/1.37 thf(eigendef_eigen__11, definition, eigen__11 = (eps__0 @ (^[X1:$i]:(~((((rel @ eigen__0) @ X1) => (![X2:mu]:(((eigen__1 @ X2) @ X1) => (~(((eigen__1 @ X2) @ X1)))))))))), introduced(definition,[new_symbols(definition,[eigen__11])])). % 1.10/1.37 thf(h1, assumption, (![X1:(mu>$i>$o)>$o]:(![X2:mu>$i>$o]:((X1 @ X2) => (X1 @ (eps__1 @ X1))))),introduced(assumption,[])). % 1.10/1.37 thf(eigendef_eigen__1, definition, eigen__1 = (eps__1 @ (^[X1:mu>$i>$o]:(~((((positive @ X1) @ eigen__0) => (~((![X2:$i]:(((rel @ eigen__0) @ X2) => (![X3:mu]:(~(((X1 @ X3) @ X2))))))))))))), introduced(definition,[new_symbols(definition,[eigen__1])])). % 1.10/1.37 thf(eigendef_eigen__0, definition, eigen__0 = (eps__0 @ (^[X1:$i]:(~((![X2:mu>$i>$o]:(((positive @ X2) @ X1) => (~((![X3:$i]:(((rel @ X1) @ X3) => (![X4:mu]:(~(((X2 @ X4) @ X3)))))))))))))), introduced(definition,[new_symbols(definition,[eigen__0])])). % 1.10/1.37 thf(h2, assumption, (![X1:mu>$o]:(![X2:mu]:((X1 @ X2) => (X1 @ (eps__2 @ X1))))),introduced(assumption,[])). % 1.10/1.37 thf(eigendef_eigen__22, definition, eigen__22 = (eps__2 @ (^[X1:mu]:(~((((eigen__1 @ X1) @ eigen__11) => (~(((eigen__1 @ X1) @ eigen__11)))))))), introduced(definition,[new_symbols(definition,[eigen__22])])). % 1.10/1.37 thf(sP1,plain,sP1 <=> (![X1:$i]:(![X2:mu>$i>$o]:(((positive @ (^[X3:mu]:(^[X4:$i]:(~(((X2 @ X3) @ X4)))))) @ X1) = (~(((positive @ X2) @ X1)))))),introduced(definition,[new_symbols(definition,[sP1])])). % 1.10/1.37 thf(sP2,plain,sP2 <=> (![X1:mu]:(((eigen__1 @ X1) @ eigen__11) => (~(((eigen__1 @ X1) @ eigen__11))))),introduced(definition,[new_symbols(definition,[sP2])])). % 1.10/1.37 thf(sP3,plain,sP3 <=> (![X1:$i]:(((rel @ eigen__0) @ X1) => (![X2:mu]:(~(((eigen__1 @ X2) @ X1)))))),introduced(definition,[new_symbols(definition,[sP3])])). % 1.10/1.37 thf(sP4,plain,sP4 <=> (((positive @ eigen__1) @ eigen__0) => (~(sP3))),introduced(definition,[new_symbols(definition,[sP4])])). % 1.10/1.37 thf(sP5,plain,sP5 <=> ((~((((positive @ eigen__1) @ eigen__0) => (~((![X1:$i]:(((rel @ eigen__0) @ X1) => (![X2:mu]:(((eigen__1 @ X2) @ X1) => (~(((eigen__1 @ X2) @ X1)))))))))))) => ((positive @ (^[X1:mu]:(^[X2:$i]:(~(((eigen__1 @ X1) @ X2)))))) @ eigen__0)),introduced(definition,[new_symbols(definition,[sP5])])). % 1.10/1.37 thf(sP6,plain,sP6 <=> (((rel @ eigen__0) @ eigen__11) => sP2),introduced(definition,[new_symbols(definition,[sP6])])). % 1.10/1.37 thf(sP7,plain,sP7 <=> (((positive @ eigen__1) @ eigen__0) => (~((![X1:$i]:(((rel @ eigen__0) @ X1) => (![X2:mu]:(((eigen__1 @ X2) @ X1) => (~(((eigen__1 @ X2) @ X1)))))))))),introduced(definition,[new_symbols(definition,[sP7])])). % 1.10/1.37 thf(sP8,plain,sP8 <=> ((positive @ eigen__1) @ eigen__0),introduced(definition,[new_symbols(definition,[sP8])])). % 1.10/1.37 thf(sP9,plain,sP9 <=> (![X1:mu]:(~(((eigen__1 @ X1) @ eigen__11)))),introduced(definition,[new_symbols(definition,[sP9])])). % 1.10/1.37 thf(sP10,plain,sP10 <=> ((positive @ (^[X1:mu]:(^[X2:$i]:(~(((eigen__1 @ X1) @ X2)))))) @ eigen__0),introduced(definition,[new_symbols(definition,[sP10])])). % 1.10/1.37 thf(sP11,plain,sP11 <=> (![X1:$i]:(((rel @ eigen__0) @ X1) => (![X2:mu]:(((eigen__1 @ X2) @ X1) => (~(((eigen__1 @ X2) @ X1))))))),introduced(definition,[new_symbols(definition,[sP11])])). % 1.10/1.37 thf(sP12,plain,sP12 <=> (![X1:mu>$i>$o]:((~((sP8 => (~((![X2:$i]:(((rel @ eigen__0) @ X2) => (![X3:mu]:(((eigen__1 @ X3) @ X2) => ((X1 @ X3) @ X2)))))))))) => ((positive @ X1) @ eigen__0))),introduced(definition,[new_symbols(definition,[sP12])])). % 1.10/1.37 thf(sP13,plain,sP13 <=> (![X1:mu>$i>$o]:(((positive @ (^[X2:mu]:(^[X3:$i]:(~(((X1 @ X2) @ X3)))))) @ eigen__0) = (~(((positive @ X1) @ eigen__0))))),introduced(definition,[new_symbols(definition,[sP13])])). % 1.10/1.37 thf(sP14,plain,sP14 <=> (![X1:$i]:(![X2:mu>$i>$o]:(![X3:mu>$i>$o]:((~((((positive @ X2) @ X1) => (~((![X4:$i]:(((rel @ X1) @ X4) => (![X5:mu]:(((X2 @ X5) @ X4) => ((X3 @ X5) @ X4)))))))))) => ((positive @ X3) @ X1))))),introduced(definition,[new_symbols(definition,[sP14])])). % 1.10/1.37 thf(sP15,plain,sP15 <=> (((eigen__1 @ eigen__22) @ eigen__11) => (~(((eigen__1 @ eigen__22) @ eigen__11)))),introduced(definition,[new_symbols(definition,[sP15])])). % 1.10/1.37 thf(sP16,plain,sP16 <=> (![X1:$i]:(![X2:mu>$i>$o]:(((positive @ X2) @ X1) => (~((![X3:$i]:(((rel @ X1) @ X3) => (![X4:mu]:(~(((X2 @ X4) @ X3))))))))))),introduced(definition,[new_symbols(definition,[sP16])])). % 1.10/1.37 thf(sP17,plain,sP17 <=> ((rel @ eigen__0) @ eigen__11),introduced(definition,[new_symbols(definition,[sP17])])). % 1.10/1.37 thf(sP18,plain,sP18 <=> (![X1:mu>$i>$o]:(![X2:mu>$i>$o]:((~((((positive @ X1) @ eigen__0) => (~((![X3:$i]:(((rel @ eigen__0) @ X3) => (![X4:mu]:(((X1 @ X4) @ X3) => ((X2 @ X4) @ X3)))))))))) => ((positive @ X2) @ eigen__0)))),introduced(definition,[new_symbols(definition,[sP18])])). % 1.10/1.37 thf(sP19,plain,sP19 <=> ((eigen__1 @ eigen__22) @ eigen__11),introduced(definition,[new_symbols(definition,[sP19])])). % 1.10/1.37 thf(sP20,plain,sP20 <=> (sP17 => sP9),introduced(definition,[new_symbols(definition,[sP20])])). % 1.10/1.37 thf(sP21,plain,sP21 <=> (![X1:mu>$i>$o]:(((positive @ X1) @ eigen__0) => (~((![X2:$i]:(((rel @ eigen__0) @ X2) => (![X3:mu]:(~(((X1 @ X3) @ X2)))))))))),introduced(definition,[new_symbols(definition,[sP21])])). % 1.10/1.37 thf(sP22,plain,sP22 <=> (sP10 = (~(sP8))),introduced(definition,[new_symbols(definition,[sP22])])). % 1.10/1.37 thf(def_meq_ind,definition,(meq_ind = (^[X1:mu]:(^[X2:mu]:(^[X3:$i]:(X1 = X2)))))). % 1.10/1.37 thf(def_mtrue,definition,(mtrue = (^[X1:$i]:(~($false))))). % 1.10/1.37 thf(def_mfalse,definition,(mfalse = (^[X1:$i]:$false))). % 1.10/1.37 thf(def_mnot,definition,(mnot = (^[X1:$i>$o]:(^[X2:$i]:(~((X1 @ X2))))))). % 1.10/1.37 thf(def_mor,definition,(mor = (^[X1:$i>$o]:(^[X2:$i>$o]:(^[X3:$i]:((~((X1 @ X3))) => (X2 @ X3))))))). % 1.10/1.37 thf(def_mand,definition,(mand = (^[X1:$i>$o]:(^[X2:$i>$o]:(^[X3:$i]:(~(((X1 @ X3) => (~((X2 @ X3))))))))))). % 1.10/1.37 thf(def_mimplies,definition,(mimplies = (^[X1:$i>$o]:(^[X2:$i>$o]:(^[X3:$i]:((X1 @ X3) => (X2 @ X3))))))). % 1.10/1.37 thf(def_mimplied,definition,(mimplied = (^[X1:$i>$o]:(^[X2:$i>$o]:(^[X3:$i]:((X2 @ X3) => (X1 @ X3))))))). % 1.10/1.37 thf(def_mequiv,definition,(mequiv = (^[X1:$i>$o]:(^[X2:$i>$o]:(^[X3:$i]:((X1 @ X3) = (X2 @ X3))))))). % 1.10/1.37 thf(def_mxor,definition,(mxor = (^[X1:$i>$o]:(^[X2:$i>$o]:(^[X3:$i]:(((X1 @ X3) => (X2 @ X3)) => (~(((~((X1 @ X3))) => (~((X2 @ X3)))))))))))). % 1.10/1.37 thf(def_mforall_ind,definition,(mforall_ind = (^[X1:mu>$i>$o]:(^[X2:$i]:(![X3:mu]:((X1 @ X3) @ X2)))))). % 1.10/1.37 thf(def_mforall_indset,definition,(mforall_indset = (^[X1:(mu>$i>$o)>$i>$o]:(^[X2:$i]:(![X3:mu>$i>$o]:((X1 @ X3) @ X2)))))). % 1.10/1.37 thf(def_mforall_prop,definition,(mforall_prop = (^[X1:($i>$o)>$i>$o]:(^[X2:$i]:(![X3:$i>$o]:((X1 @ X3) @ X2)))))). % 1.10/1.37 thf(def_mexists_ind,definition,(mexists_ind = (^[X1:mu>$i>$o]:(^[X2:$i]:(~((![X3:mu]:(~(((X1 @ X3) @ X2)))))))))). % 1.10/1.37 thf(def_mexists_indset,definition,(mexists_indset = (^[X1:(mu>$i>$o)>$i>$o]:(^[X2:$i]:(~((![X3:mu>$i>$o]:(~(((X1 @ X3) @ X2)))))))))). % 1.10/1.37 thf(def_mexists_prop,definition,(mexists_prop = (^[X1:($i>$o)>$i>$o]:(^[X2:$i]:(~((![X3:$i>$o]:(~(((X1 @ X3) @ X2)))))))))). % 1.10/1.37 thf(def_mbox_generic,definition,(mbox_generic = (^[X1:$i>$i>$o]:(^[X2:$i>$o]:(^[X3:$i]:(![X4:$i]:(((X1 @ X3) @ X4) => (X2 @ X4)))))))). % 1.10/1.37 thf(def_mdia_generic,definition,(mdia_generic = (^[X1:$i>$i>$o]:(^[X2:$i>$o]:(^[X3:$i]:(~((![X4:$i]:(((X1 @ X3) @ X4) => (~((X2 @ X4)))))))))))). % 1.10/1.37 thf(def_mbox,definition,(mbox = (mbox_generic @ rel))). % 1.10/1.37 thf(def_mdia,definition,(mdia = (mdia_generic @ rel))). % 1.10/1.37 thf(def_mvalid,definition,(mvalid = (!!))). % 1.10/1.37 thf(def_minvalid,definition,(minvalid = (^[X1:$i>$o]:(![X2:$i]:(~((X1 @ X2))))))). % 1.10/1.37 thf(thmT1,conjecture,(![X1:$i]:(![X2:mu>$i>$o]:(((positive @ X2) @ X1) => (~((![X3:$i]:(((rel @ X1) @ X3) => (~((~((![X4:mu]:(~(((X2 @ X4) @ X3)))))))))))))))). % 1.10/1.37 thf(h3,negated_conjecture,(~(sP16)),inference(assume_negation,[status(cth)],[thmT1])). % 1.10/1.37 thf(1,plain,(~(sP3) | sP20),inference(all_rule,[status(thm)],[])). % 1.10/1.37 thf(2,plain,((~(sP20) | ~(sP17)) | sP9),inference(prop_rule,[status(thm)],[])). % 1.10/1.37 thf(3,plain,(~(sP9) | ~(sP19)),inference(all_rule,[status(thm)],[])). % 1.10/1.37 thf(4,plain,(sP15 | sP19),inference(prop_rule,[status(thm)],[])). % 1.10/1.37 thf(5,plain,(sP2 | ~(sP15)),inference(eigen_choice_rule,[status(thm),assumptions([h2])],[h2,eigendef_eigen__22])). % 1.10/1.37 thf(6,plain,(sP6 | ~(sP2)),inference(prop_rule,[status(thm)],[])). % 1.10/1.37 thf(7,plain,(sP6 | sP17),inference(prop_rule,[status(thm)],[])). % 1.10/1.37 thf(8,plain,(sP11 | ~(sP6)),inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__11])). % 1.10/1.37 thf(9,plain,((~(sP5) | sP7) | sP10),inference(prop_rule,[status(thm)],[])). % 1.10/1.37 thf(10,plain,((~(sP7) | ~(sP8)) | ~(sP11)),inference(prop_rule,[status(thm)],[])). % 1.10/1.37 thf(11,plain,((~(sP22) | ~(sP10)) | ~(sP8)),inference(prop_rule,[status(thm)],[])). % 1.10/1.37 thf(12,plain,(~(sP12) | sP5),inference(all_rule,[status(thm)],[])). % 1.10/1.37 thf(13,plain,(~(sP13) | sP22),inference(all_rule,[status(thm)],[])). % 1.10/1.37 thf(14,plain,(~(sP1) | sP13),inference(all_rule,[status(thm)],[])). % 1.10/1.37 thf(15,plain,(~(sP14) | sP18),inference(all_rule,[status(thm)],[])). % 1.10/1.37 thf(16,plain,(~(sP18) | sP12),inference(all_rule,[status(thm)],[])). % 1.10/1.37 thf(17,plain,(sP4 | sP3),inference(prop_rule,[status(thm)],[])). % 1.10/1.37 thf(18,plain,(sP4 | sP8),inference(prop_rule,[status(thm)],[])). % 1.10/1.37 thf(19,plain,(sP21 | ~(sP4)),inference(eigen_choice_rule,[status(thm),assumptions([h1])],[h1,eigendef_eigen__1])). % 1.10/1.37 thf(20,plain,(sP16 | ~(sP21)),inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__0])). % 1.10/1.37 thf(axA2,axiom,(mvalid @ (mforall_indset @ (^[X1:mu>$i>$o]:(mforall_indset @ (^[X2:mu>$i>$o]:((mimplies @ ((mand @ (positive @ X1)) @ (mbox @ (mforall_ind @ (^[X3:mu]:((mimplies @ (X1 @ X3)) @ (X2 @ X3))))))) @ (positive @ X2)))))))). % 1.10/1.37 thf(21,plain,sP14,inference(preprocess,[status(thm)],[axA2]). % 1.10/1.37 thf(axA1,axiom,(mvalid @ (mforall_indset @ (^[X1:mu>$i>$o]:((mequiv @ (positive @ (^[X2:mu]:(mnot @ (X1 @ X2))))) @ (mnot @ (positive @ X1))))))). % 1.10/1.37 thf(22,plain,sP1,inference(preprocess,[status(thm)],[axA1]). % 1.10/1.37 thf(23,plain,$false,inference(prop_unsat,[status(thm),assumptions([h3,h2,h1,h0])],[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,h3])). % 1.10/1.37 thf(24,plain,$false,inference(eigenvar_choice,[status(thm),assumptions([h3,h1,h0]),eigenvar_choice(discharge,[h2])],[23,h2])). % 1.10/1.37 thf(25,plain,$false,inference(eigenvar_choice,[status(thm),assumptions([h3,h0]),eigenvar_choice(discharge,[h1])],[24,h1])). % 1.10/1.37 thf(26,plain,$false,inference(eigenvar_choice,[status(thm),assumptions([h3]),eigenvar_choice(discharge,[h0])],[25,h0])). % 1.10/1.37 thf(0,theorem,(![X1:$i]:(![X2:mu>$i>$o]:(((positive @ X2) @ X1) => (~((![X3:$i]:(((rel @ X1) @ X3) => (~((~((![X4:mu]:(~(((X2 @ X4) @ X3))))))))))))))),inference(contra,[status(thm),contra(discharge,[h3])],[23,h3])). % 1.10/1.37 % SZS output end Proof %------------------------------------------------------------------------------