%------------------------------------------------------------------------------ % File : Satallax---3.5 % Problem : LCL579^1 : TPTP v9.3.1. Released v3.6.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 : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 01:02:04 PM UTC 2026 % Result : Theorem 0.14s 0.37s % Output : Proof 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL579^1 : TPTP v9.3.1. Released v3.6.0. % 0.00/0.03 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s % 0.08/0.35 % Computer : n001.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Fri Sep 4 23:48:00 UTC 2026 % 0.08/0.35 % CPUTime : % 0.14/0.37 % SZS status Theorem % 0.14/0.37 % Mode: mode213 % 0.14/0.37 % Inferences: 4 % 0.14/0.37 % SZS output start Proof % 0.14/0.37 thf(ty_eigen__2, type, eigen__2 : ($i>$o)). % 0.14/0.37 thf(ty_eigen__1, type, eigen__1 : $i). % 0.14/0.37 thf(ty_eigen__0, type, eigen__0 : $i). % 0.14/0.37 thf(sP1,plain,sP1 <=> (eigen__2 @ eigen__1),introduced(definition,[new_symbols(definition,[sP1])])). % 0.14/0.37 thf(sP2,plain,sP2 <=> ((eigen__0 = eigen__1) => (eigen__1 = eigen__0)),introduced(definition,[new_symbols(definition,[sP2])])). % 0.14/0.37 thf(sP3,plain,sP3 <=> (![X1:$i]:(![X2:$i]:((X1 = X2) => (X2 = X1)))),introduced(definition,[new_symbols(definition,[sP3])])). % 0.14/0.37 thf(sP4,plain,sP4 <=> (![X1:$i]:((eigen__0 = X1) => (X1 = eigen__0))),introduced(definition,[new_symbols(definition,[sP4])])). % 0.14/0.37 thf(sP5,plain,sP5 <=> (eigen__0 = eigen__1),introduced(definition,[new_symbols(definition,[sP5])])). % 0.14/0.37 thf(sP6,plain,sP6 <=> (eigen__2 @ eigen__0),introduced(definition,[new_symbols(definition,[sP6])])). % 0.14/0.37 thf(sP7,plain,sP7 <=> (eigen__1 = eigen__0),introduced(definition,[new_symbols(definition,[sP7])])). % 0.14/0.37 thf(a,conjecture,(![X1:$i]:(![X2:$i]:((![X3:$i>$o]:((X3 @ X1) => (X3 @ X2))) => (![X3:$i>$o]:((X3 @ X2) => (X3 @ X1))))))). % 0.14/0.37 thf(h0,negated_conjecture,(~((![X1:$i]:(![X2:$i]:((![X3:$i>$o]:((X3 @ X1) => (X3 @ X2))) => (![X3:$i>$o]:((X3 @ X2) => (X3 @ X1)))))))),inference(assume_negation,[status(cth)],[a])). % 0.14/0.37 thf(h1,assumption,(~((![X1:$i]:((![X2:$i>$o]:((X2 @ eigen__0) => (X2 @ X1))) => (![X2:$i>$o]:((X2 @ X1) => (X2 @ eigen__0))))))),introduced(assumption,[])). % 0.14/0.37 thf(h2,assumption,(~(((![X1:$i>$o]:((X1 @ eigen__0) => (X1 @ eigen__1))) => (![X1:$i>$o]:((X1 @ eigen__1) => (X1 @ eigen__0)))))),introduced(assumption,[])). % 0.14/0.37 thf(h3,assumption,(![X1:$i>$o]:((X1 @ eigen__0) => (X1 @ eigen__1))),introduced(assumption,[])). % 0.14/0.37 thf(h4,assumption,(~((![X1:$i>$o]:((X1 @ eigen__1) => (X1 @ eigen__0))))),introduced(assumption,[])). % 0.14/0.37 thf(h5,assumption,(~((sP1 => sP6))),introduced(assumption,[])). % 0.14/0.37 thf(h6,assumption,sP1,introduced(assumption,[])). % 0.14/0.37 thf(h7,assumption,(~(sP6)),introduced(assumption,[])). % 0.14/0.37 thf(1,plain,((~(sP1) | sP6) | ~(sP7)),inference(mating_rule,[status(thm)],[])). % 0.14/0.37 thf(2,plain,((~(sP2) | ~(sP5)) | sP7),inference(prop_rule,[status(thm)],[])). % 0.14/0.37 thf(3,plain,(~(sP4) | sP2),inference(all_rule,[status(thm)],[])). % 0.14/0.37 thf(4,plain,(~(sP3) | sP4),inference(all_rule,[status(thm)],[])). % 0.14/0.37 thf(5,plain,sP3,inference(eq_sym,[status(thm)],[])). % 0.14/0.37 thf(6,plain,sP5,inference(normalize,[status(thm)],[h3]). % 0.14/0.37 thf(7,plain,$false,inference(prop_unsat,[status(thm),assumptions([h6,h7,h5,h3,h4,h2,h1,h0])],[1,2,3,4,5,6,h6,h7])). % 0.14/0.37 thf(8,plain,$false,inference(tab_negimp,[status(thm),assumptions([h5,h3,h4,h2,h1,h0]),tab_negimp(discharge,[h6,h7])],[h5,7,h6,h7])). % 0.14/0.37 thf(9,plain,$false,inference(tab_negall,[status(thm),assumptions([h3,h4,h2,h1,h0]),tab_negall(discharge,[h5]),tab_negall(eigenvar,eigen__2)],[h4,8,h5])). % 0.14/0.37 thf(10,plain,$false,inference(tab_negimp,[status(thm),assumptions([h2,h1,h0]),tab_negimp(discharge,[h3,h4])],[h2,9,h3,h4])). % 0.14/0.37 thf(11,plain,$false,inference(tab_negall,[status(thm),assumptions([h1,h0]),tab_negall(discharge,[h2]),tab_negall(eigenvar,eigen__1)],[h1,10,h2])). % 0.14/0.37 thf(12,plain,$false,inference(tab_negall,[status(thm),assumptions([h0]),tab_negall(discharge,[h1]),tab_negall(eigenvar,eigen__0)],[h0,11,h1])). % 0.14/0.37 thf(0,theorem,(![X1:$i]:(![X2:$i]:((![X3:$i>$o]:((X3 @ X1) => (X3 @ X2))) => (![X3:$i>$o]:((X3 @ X2) => (X3 @ X1)))))),inference(contra,[status(thm),contra(discharge,[h0])],[12,h0])). % 0.14/0.37 % SZS output end Proof %------------------------------------------------------------------------------