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

% Computer : n028.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 : Thu Jul 21 19:31:42 EDT 2022

% Result   : Theorem 0.11s 0.35s
% Output   : Proof 0.11s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SYO371^5 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.11  % Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.11/0.32  % Computer : n028.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Sat Jul  9 03:53:25 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.11/0.35  % SZS status Theorem
% 0.11/0.35  % Mode: mode213
% 0.11/0.35  % Inferences: 6
% 0.11/0.35  % SZS output start Proof
% 0.11/0.35  thf(ty_cP, type, cP : $o).
% 0.11/0.35  thf(ty_cQ, type, cQ : $o).
% 0.11/0.35  thf(sP1,plain,sP1 <=> cP,introduced(definition,[new_symbols(definition,[sP1])])).
% 0.11/0.35  thf(sP2,plain,sP2 <=> (sP1 = cQ),introduced(definition,[new_symbols(definition,[sP2])])).
% 0.11/0.35  thf(sP3,plain,sP3 <=> cQ,introduced(definition,[new_symbols(definition,[sP3])])).
% 0.11/0.35  thf(cEXT_O_LEIB,conjecture,((![X1:$o>$o]:((X1 @ sP1) => (X1 @ sP3))) => sP2)).
% 0.11/0.35  thf(h0,negated_conjecture,(~(((![X1:$o>$o]:((X1 @ sP1) => (X1 @ sP3))) => sP2))),inference(assume_negation,[status(cth)],[cEXT_O_LEIB])).
% 0.11/0.35  thf(h1,assumption,(![X1:$o>$o]:((X1 @ sP1) => (X1 @ sP3))),introduced(assumption,[])).
% 0.11/0.35  thf(h2,assumption,(~(sP2)),introduced(assumption,[])).
% 0.11/0.35  thf(h3,assumption,sP1,introduced(assumption,[])).
% 0.11/0.35  thf(h4,assumption,sP3,introduced(assumption,[])).
% 0.11/0.35  thf(h5,assumption,(~(sP1)),introduced(assumption,[])).
% 0.11/0.35  thf(h6,assumption,(~(sP3)),introduced(assumption,[])).
% 0.11/0.35  thf(1,plain,((~(sP2) | ~(sP1)) | sP3),inference(prop_rule,[status(thm)],[])).
% 0.11/0.35  thf(2,plain,sP2,inference(normalize,[status(thm)],[h1]).
% 0.11/0.35  thf(3,plain,$false,inference(prop_unsat,[status(thm),assumptions([h3,h4,h1,h2,h0])],[1,2,h3,h4])).
% 0.11/0.35  thf(4,plain,((~(sP2) | sP1) | ~(sP3)),inference(prop_rule,[status(thm)],[])).
% 0.11/0.35  thf(5,plain,$false,inference(prop_unsat,[status(thm),assumptions([h5,h6,h1,h2,h0])],[4,2,h5,h6])).
% 0.11/0.35  thf(6,plain,$false,inference(tab_be,[status(thm),assumptions([h1,h2,h0]),tab_be(discharge,[h3,h4]),tab_be(discharge,[h5,h6])],[h2,3,5,h3,h4,h5,h6])).
% 0.11/0.35  thf(7,plain,$false,inference(tab_negimp,[status(thm),assumptions([h0]),tab_negimp(discharge,[h1,h2])],[h0,6,h1,h2])).
% 0.11/0.35  thf(0,theorem,((![X1:$o>$o]:((X1 @ sP1) => (X1 @ sP3))) => sP2),inference(contra,[status(thm),contra(discharge,[h0])],[7,h0])).
% 0.11/0.35  % SZS output end Proof
%------------------------------------------------------------------------------