%------------------------------------------------------------------------------ % File : Lash---1.13 % Problem : SEV427^1 : TPTP v9.2.0. Released v5.2.0. % Transfm : none % Format : tptp:raw % Command : lash -P picomus -M modes -p tstp -t %d %s % Computer : n011.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:55:53 PM UTC 2025 % Result : Theorem 0.12s 0.39s % Output : Proof 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SEV427^1 : TPTP v9.2.0. Released v5.2.0. % 0.11/0.12 % Command : lash -P picomus -M modes -p tstp -t %d %s % 0.12/0.33 % Computer : n011.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Wed Oct 8 18:57:38 EDT 2025 % 0.12/0.34 % CPUTime : % 0.12/0.39 % SZS status Theorem % 0.12/0.39 % Mode: cade22grackle2xfee4 % 0.12/0.39 % Steps: 17 % 0.12/0.39 % SZS output start Proof % 0.12/0.39 thf(ty_p, type, p : ($i>$o)). % 0.12/0.39 thf(ty_q, type, q : ($i>$o)). % 0.12/0.39 thf(ty_eps, type, eps : (($i>$o)>$i)). % 0.12/0.39 thf(sP1,plain,sP1 <=> (q @ (eps @ q)),introduced(definition,[new_symbols(definition,[sP1])])). % 0.12/0.39 thf(sP2,plain,sP2 <=> (p @ (eps @ q)),introduced(definition,[new_symbols(definition,[sP2])])). % 0.12/0.39 thf(sP3,plain,sP3 <=> (![X1:$i]:(~((p @ X1)))),introduced(definition,[new_symbols(definition,[sP3])])). % 0.12/0.39 thf(sP4,plain,sP4 <=> (p @ (eps @ p)),introduced(definition,[new_symbols(definition,[sP4])])). % 0.12/0.39 thf(sP5,plain,sP5 <=> (![X1:$i]:((~((p @ X1))) => (q @ X1))),introduced(definition,[new_symbols(definition,[sP5])])). % 0.12/0.39 thf(sP6,plain,sP6 <=> ((~(sP2)) => sP1),introduced(definition,[new_symbols(definition,[sP6])])). % 0.12/0.39 thf(conj,conjecture,((~(sP4)) => sP1)). % 0.12/0.39 thf(h0,negated_conjecture,(~(((~(sP4)) => sP1))),inference(assume_negation,[status(cth)],[conj])). % 0.12/0.39 thf(h1,assumption,(~(sP4)),introduced(assumption,[])). % 0.12/0.39 thf(h2,assumption,(~(sP1)),introduced(assumption,[])). % 0.12/0.39 thf(1,plain,(~(sP3) | ~(sP2)),inference(all_rule,[status(thm)],[])). % 0.12/0.39 thf(choiceax,axiom,(![X1:$i>$o]:((~((![X2:$i]:(~((X1 @ X2)))))) => (X1 @ (eps @ X1))))). % 0.12/0.39 thf(2,plain,(![X1:$i>$o]:((~((![X2:$i]:(~((X1 @ X2)))))) => (X1 @ (eps @ X1)))),inference(preprocess,[status(thm)],[2]). % 0.12/0.39 thf(3,plain,(sP4 | sP3),inference(choice_rule,[status(thm)],[2])). % 0.12/0.39 thf(4,plain,((~(sP6) | sP2) | sP1),inference(prop_rule,[status(thm)],[])). % 0.12/0.39 thf(5,plain,(~(sP5) | sP6),inference(all_rule,[status(thm)],[])). % 0.12/0.39 thf(pq,axiom,sP5). % 0.12/0.39 thf(6,plain,$false,inference(prop_unsat,[status(thm),assumptions([h1,h2,h0])],[1,3,4,5,h1,h2,pq])). % 0.12/0.39 thf(7,plain,$false,inference(tab_negimp,[status(thm),assumptions([h0]),tab_negimp(discharge,[h1,h2])],[h0,6,h1,h2])). % 0.12/0.39 thf(0,theorem,((~(sP4)) => sP1),inference(contra,[status(thm),contra(discharge,[h0])],[7,h0])). % 0.12/0.39 % SZS output end Proof %------------------------------------------------------------------------------