%------------------------------------------------------------------------------ % File : Satallax---3.5 % Problem : SYO016^1 : TPTP v9.2.0. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s % Computer : n001.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 03:24:40 PM UTC 2025 % Result : Theorem 0.13s 0.38s % Output : Proof 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.13 % Problem : SYO016^1 : TPTP v9.2.0. Released v3.7.0. % 0.13/0.13 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s % 0.13/0.35 % Computer : n001.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 : Thu Oct 9 01:37:53 EDT 2025 % 0.13/0.35 % CPUTime : % 0.13/0.38 % SZS status Theorem % 0.13/0.38 % Mode: mode213 % 0.13/0.38 % Inferences: 34 % 0.13/0.38 % SZS output start Proof % 0.13/0.38 thf(ty_h, type, h : ($o>$o)). % 0.13/0.38 thf(ty_eigen__0, type, eigen__0 : ($o>$o)). % 0.13/0.38 thf(sP1,plain,sP1 <=> (eigen__0 @ (h @ ((h @ (~($false))) = (h @ $false)))),introduced(definition,[new_symbols(definition,[sP1])])). % 0.13/0.38 thf(sP2,plain,sP2 <=> (![X1:$o]:(((~($false)) = X1) => (X1 = (~($false))))),introduced(definition,[new_symbols(definition,[sP2])])). % 0.13/0.38 thf(sP3,plain,sP3 <=> (h @ ((h @ (~($false))) = (h @ $false))),introduced(definition,[new_symbols(definition,[sP3])])). % 0.13/0.38 thf(sP4,plain,sP4 <=> (![X1:$o]:(![X2:$o]:((X1 = X2) => (X2 = X1)))),introduced(definition,[new_symbols(definition,[sP4])])). % 0.13/0.38 thf(sP5,plain,sP5 <=> (((h @ (~($false))) = (h @ $false)) = (~($false))),introduced(definition,[new_symbols(definition,[sP5])])). % 0.13/0.38 thf(sP6,plain,sP6 <=> (((~($false)) = ((h @ (~($false))) = (h @ $false))) => sP5),introduced(definition,[new_symbols(definition,[sP6])])). % 0.13/0.38 thf(sP7,plain,sP7 <=> ((h @ (~($false))) = (h @ $false)),introduced(definition,[new_symbols(definition,[sP7])])). % 0.13/0.38 thf(sP8,plain,sP8 <=> (sP7 = $false),introduced(definition,[new_symbols(definition,[sP8])])). % 0.13/0.38 thf(sP9,plain,sP9 <=> (h @ $false),introduced(definition,[new_symbols(definition,[sP9])])). % 0.13/0.38 thf(sP10,plain,sP10 <=> ((~($false)) = sP7),introduced(definition,[new_symbols(definition,[sP10])])). % 0.13/0.38 thf(sP11,plain,sP11 <=> (h @ (~($false))),introduced(definition,[new_symbols(definition,[sP11])])). % 0.13/0.38 thf(sP12,plain,sP12 <=> (sP3 = sP9),introduced(definition,[new_symbols(definition,[sP12])])). % 0.13/0.38 thf(sP13,plain,sP13 <=> (eigen__0 @ sP9),introduced(definition,[new_symbols(definition,[sP13])])). % 0.13/0.38 thf(sP14,plain,sP14 <=> ($false = sP7),introduced(definition,[new_symbols(definition,[sP14])])). % 0.13/0.38 thf(sP15,plain,sP15 <=> $false,introduced(definition,[new_symbols(definition,[sP15])])). % 0.13/0.38 thf(def_leibeq,definition,(leibeq = (^[X1:$o]:(^[X2:$o]:(![X3:$o>$o]:((X3 @ X1) => (X3 @ X2))))))). % 0.13/0.38 thf(conj,conjecture,(![X1:$o>$o]:((X1 @ (h @ (![X2:$o>$o]:((X2 @ sP11) => (X2 @ sP9))))) => (X1 @ sP9)))). % 0.13/0.38 thf(h0,negated_conjecture,(~((![X1:$o>$o]:((X1 @ (h @ (![X2:$o>$o]:((X2 @ sP11) => (X2 @ sP9))))) => (X1 @ sP9))))),inference(assume_negation,[status(cth)],[conj])). % 0.13/0.38 thf(h1,assumption,(~(((eigen__0 @ (h @ (![X1:$o>$o]:((X1 @ sP11) => (X1 @ sP9))))) => sP13))),introduced(assumption,[])). % 0.13/0.38 thf(h2,assumption,(eigen__0 @ (h @ (![X1:$o>$o]:((X1 @ sP11) => (X1 @ sP9))))),introduced(assumption,[])). % 0.13/0.38 thf(h3,assumption,(~(sP13)),introduced(assumption,[])). % 0.13/0.38 thf(1,plain,((sP10 | sP15) | ~(sP7)),inference(prop_rule,[status(thm)],[])). % 0.13/0.38 thf(2,plain,((~(sP6) | ~(sP10)) | sP5),inference(prop_rule,[status(thm)],[])). % 0.13/0.38 thf(3,plain,(~(sP2) | sP6),inference(all_rule,[status(thm)],[])). % 0.13/0.38 thf(4,plain,(~(sP4) | sP2),inference(all_rule,[status(thm)],[])). % 0.13/0.38 thf(5,plain,((~(sP3) | sP11) | ~(sP5)),inference(mating_rule,[status(thm)],[])). % 0.13/0.38 thf(6,plain,((~(sP11) | sP3) | ~(sP10)),inference(mating_rule,[status(thm)],[])). % 0.13/0.38 thf(7,plain,((~(sP7) | ~(sP11)) | sP9),inference(prop_rule,[status(thm)],[])). % 0.13/0.38 thf(8,plain,((~(sP7) | sP11) | ~(sP9)),inference(prop_rule,[status(thm)],[])). % 0.13/0.38 thf(9,plain,~(sP15),inference(prop_rule,[status(thm)],[])). % 0.13/0.38 thf(10,plain,((sP8 | sP7) | sP15),inference(prop_rule,[status(thm)],[])). % 0.13/0.38 thf(11,plain,((sP14 | sP15) | sP7),inference(prop_rule,[status(thm)],[])). % 0.13/0.38 thf(12,plain,((~(sP3) | sP9) | ~(sP8)),inference(mating_rule,[status(thm)],[])). % 0.13/0.38 thf(13,plain,((~(sP9) | sP3) | ~(sP14)),inference(mating_rule,[status(thm)],[])). % 0.13/0.38 thf(14,plain,((sP12 | ~(sP3)) | ~(sP9)),inference(prop_rule,[status(thm)],[])). % 0.13/0.38 thf(15,plain,((sP12 | sP3) | sP9),inference(prop_rule,[status(thm)],[])). % 0.13/0.38 thf(16,plain,sP4,inference(eq_sym,[status(thm)],[])). % 0.13/0.38 thf(17,plain,((~(sP1) | sP13) | ~(sP12)),inference(mating_rule,[status(thm)],[])). % 0.13/0.38 thf(18,plain,sP1,inference(normalize,[status(thm)],[h2]). % 0.13/0.38 thf(19,plain,$false,inference(prop_unsat,[status(thm),assumptions([h2,h3,h1,h0])],[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,h3])). % 0.13/0.38 thf(20,plain,$false,inference(tab_negimp,[status(thm),assumptions([h1,h0]),tab_negimp(discharge,[h2,h3])],[h1,19,h2,h3])). % 0.13/0.38 thf(21,plain,$false,inference(tab_negall,[status(thm),assumptions([h0]),tab_negall(discharge,[h1]),tab_negall(eigenvar,eigen__0)],[h0,20,h1])). % 0.13/0.38 thf(0,theorem,(![X1:$o>$o]:((X1 @ (h @ (![X2:$o>$o]:((X2 @ sP11) => (X2 @ sP9))))) => (X1 @ sP9))),inference(contra,[status(thm),contra(discharge,[h0])],[21,h0])). % 0.13/0.38 % SZS output end Proof %------------------------------------------------------------------------------