↑ Up

Satallax---3.5.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Satallax---3.5
% Problem  : SWV434^4 : TPTP v9.2.0. Released v3.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s

% Computer : n007.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:07:22 PM UTC 2025

% Result   : Theorem 5.16s 5.19s
% Output   : Proof 5.16s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV434^4 : TPTP v9.2.0. Released v3.6.0.
% 0.07/0.13  % Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.12/0.34  % Computer : n007.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed Oct  8 14:04:23 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 5.16/5.19  % SZS status Theorem
% 5.16/5.19  % Mode: mode495
% 5.16/5.19  % Inferences: 7
% 5.16/5.19  % SZS output start Proof
% 5.16/5.19  thf(ty_eigen__2, type, eigen__2 : $i).
% 5.16/5.19  thf(ty_s, type, s : ($i>$o)).
% 5.16/5.19  thf(ty_eigen__1, type, eigen__1 : $i).
% 5.16/5.19  thf(ty_eigen__0, type, eigen__0 : $i).
% 5.16/5.19  thf(ty_rel, type, rel : ($i>$i>$o)).
% 5.16/5.19  thf(sP1,plain,sP1 <=> ((![X1:$i]:(((rel @ eigen__1) @ X1) => ((~($false)) => (![X2:$i]:(((rel @ X1) @ X2) => (s @ X2)))))) => ((~($false)) => (![X1:$i]:(((rel @ eigen__1) @ X1) => (s @ X1))))),introduced(definition,[new_symbols(definition,[sP1])])).
% 5.16/5.19  thf(sP2,plain,sP2 <=> (![X1:$i]:(((rel @ eigen__1) @ X1) => ((~($false)) => (![X2:$i]:(((rel @ X1) @ X2) => (s @ X2)))))),introduced(definition,[new_symbols(definition,[sP2])])).
% 5.16/5.19  thf(sP3,plain,sP3 <=> (![X1:$i]:((![X2:$i]:(((rel @ X1) @ X2) => ((~($false)) => (![X3:$i]:(((rel @ X2) @ X3) => (s @ X3)))))) => ((~($false)) => (![X2:$i]:(((rel @ X1) @ X2) => (s @ X2)))))),introduced(definition,[new_symbols(definition,[sP3])])).
% 5.16/5.19  thf(sP4,plain,sP4 <=> ((~($false)) => (![X1:$i]:(((rel @ eigen__1) @ X1) => (s @ X1)))),introduced(definition,[new_symbols(definition,[sP4])])).
% 5.16/5.19  thf(sP5,plain,sP5 <=> $false,introduced(definition,[new_symbols(definition,[sP5])])).
% 5.16/5.19  thf(sP6,plain,sP6 <=> (![X1:$i]:(((rel @ eigen__1) @ X1) => (s @ X1))),introduced(definition,[new_symbols(definition,[sP6])])).
% 5.16/5.19  thf(sP7,plain,sP7 <=> (s @ eigen__2),introduced(definition,[new_symbols(definition,[sP7])])).
% 5.16/5.19  thf(sP8,plain,sP8 <=> (![X1:$i>$o]:(![X2:$i]:((![X3:$i]:(((rel @ X2) @ X3) => (X1 @ X3))) => (X1 @ X2)))),introduced(definition,[new_symbols(definition,[sP8])])).
% 5.16/5.19  thf(sP9,plain,sP9 <=> (((rel @ eigen__1) @ eigen__2) => sP7),introduced(definition,[new_symbols(definition,[sP9])])).
% 5.16/5.19  thf(sP10,plain,sP10 <=> ((rel @ eigen__1) @ eigen__2),introduced(definition,[new_symbols(definition,[sP10])])).
% 5.16/5.19  thf(def_mfalse,definition,(mfalse = (^[X1:$i]:sP5))).
% 5.16/5.19  thf(def_mtrue,definition,(mtrue = (^[X1:$i]:(~(sP5))))).
% 5.16/5.19  thf(def_mnot,definition,(mnot = (^[X1:$i>$o]:(^[X2:$i]:(~((X1 @ X2))))))).
% 5.16/5.19  thf(def_mor,definition,(mor = (^[X1:$i>$o]:(^[X2:$i>$o]:(^[X3:$i]:((~((X1 @ X3))) => (X2 @ X3))))))).
% 5.16/5.19  thf(def_mand,definition,(mand = (^[X1:$i>$o]:(^[X2:$i>$o]:(^[X3:$i]:(~(((X1 @ X3) => (~((X2 @ X3))))))))))).
% 5.16/5.19  thf(def_mimpl,definition,(mimpl = (^[X1:$i>$o]:(mor @ (mnot @ X1))))).
% 5.16/5.19  thf(def_miff,definition,(miff = (^[X1:$i>$o]:(^[X2:$i>$o]:((mand @ ((mimpl @ X1) @ X2)) @ ((mimpl @ X2) @ X1)))))).
% 5.16/5.19  thf(def_mbox,definition,(mbox = (^[X1:$i>$i>$o]:(^[X2:$i>$o]:(^[X3:$i]:(![X4:$i]:(((X1 @ X3) @ X4) => (X2 @ X4)))))))).
% 5.16/5.19  thf(def_mdia,definition,(mdia = (^[X1:$i>$i>$o]:(^[X2:$i>$o]:(^[X3:$i]:(~((![X4:$i]:(((X1 @ X3) @ X4) => (~((X2 @ X4)))))))))))).
% 5.16/5.19  thf(def_mall,definition,(mall = (^[X1:individuals>$i>$o]:(^[X2:$i]:(![X3:individuals]:((X1 @ X3) @ X2)))))).
% 5.16/5.19  thf(def_mexists,definition,(mexists = (^[X1:individuals>$i>$o]:(^[X2:$i]:(~((![X3:individuals]:(~(((X1 @ X3) @ X2)))))))))).
% 5.16/5.19  thf(def_mvalid,definition,(mvalid = (!!))).
% 5.16/5.19  thf(def_msatisfiable,definition,(msatisfiable = (^[X1:$i>$o]:(~((![X2:$i]:(~((X1 @ X2))))))))).
% 5.16/5.19  thf(def_mcountersatisfiable,definition,(mcountersatisfiable = (^[X1:$i>$o]:(~(((!!) @ X1)))))).
% 5.16/5.19  thf(def_minvalid,definition,(minvalid = (^[X1:$i>$o]:(![X2:$i]:(~((X1 @ X2))))))).
% 5.16/5.19  thf(def_icl_atom,definition,(icl_atom = (mbox @ rel))).
% 5.16/5.19  thf(def_icl_princ,definition,(icl_princ = (^[X1:$i>$o]:X1))).
% 5.16/5.19  thf(def_icl_and,definition,(icl_and = mand)).
% 5.16/5.19  thf(def_icl_or,definition,(icl_or = mor)).
% 5.16/5.19  thf(def_icl_impl,definition,(icl_impl = (^[X1:$i>$o]:(^[X2:$i>$o]:((mbox @ rel) @ ((mimpl @ X1) @ X2)))))).
% 5.16/5.19  thf(def_icl_true,definition,(icl_true = mtrue)).
% 5.16/5.19  thf(def_icl_false,definition,(icl_false = mfalse)).
% 5.16/5.19  thf(def_icl_says,definition,(icl_says = (^[X1:$i>$o]:(^[X2:$i>$o]:((mbox @ rel) @ ((mor @ X1) @ X2)))))).
% 5.16/5.19  thf(def_iclval,definition,(iclval = mvalid)).
% 5.16/5.19  thf(trust,conjecture,(![X1:$i]:(![X2:$i]:(((rel @ X1) @ X2) => ((~((~((![X3:$i]:(((rel @ X2) @ X3) => ((~(sP5)) => (![X4:$i]:(((rel @ X3) @ X4) => (s @ X4)))))))))) => (![X3:$i]:(((rel @ X2) @ X3) => (s @ X3)))))))).
% 5.16/5.19  thf(h0,negated_conjecture,(~((![X1:$i]:(![X2:$i]:(((rel @ X1) @ X2) => ((![X3:$i]:(((rel @ X2) @ X3) => ((~(sP5)) => (![X4:$i]:(((rel @ X3) @ X4) => (s @ X4)))))) => (![X3:$i]:(((rel @ X2) @ X3) => (s @ X3))))))))),inference(assume_negation,[status(cth)],[trust])).
% 5.16/5.19  thf(h1,assumption,(~((![X1:$i]:(((rel @ eigen__0) @ X1) => ((![X2:$i]:(((rel @ X1) @ X2) => ((~(sP5)) => (![X3:$i]:(((rel @ X2) @ X3) => (s @ X3)))))) => (![X2:$i]:(((rel @ X1) @ X2) => (s @ X2)))))))),introduced(assumption,[])).
% 5.16/5.19  thf(h2,assumption,(~((((rel @ eigen__0) @ eigen__1) => (sP2 => sP6)))),introduced(assumption,[])).
% 5.16/5.19  thf(h3,assumption,((rel @ eigen__0) @ eigen__1),introduced(assumption,[])).
% 5.16/5.19  thf(h4,assumption,(~((sP2 => sP6))),introduced(assumption,[])).
% 5.16/5.19  thf(h5,assumption,sP2,introduced(assumption,[])).
% 5.16/5.19  thf(h6,assumption,(~(sP6)),introduced(assumption,[])).
% 5.16/5.19  thf(h7,assumption,(~(sP9)),introduced(assumption,[])).
% 5.16/5.19  thf(h8,assumption,sP10,introduced(assumption,[])).
% 5.16/5.19  thf(h9,assumption,(~(sP7)),introduced(assumption,[])).
% 5.16/5.19  thf(1,plain,(~(sP8) | sP3),inference(all_rule,[status(thm)],[])).
% 5.16/5.19  thf(2,plain,(~(sP3) | sP1),inference(all_rule,[status(thm)],[])).
% 5.16/5.19  thf(3,plain,((~(sP1) | ~(sP2)) | sP4),inference(prop_rule,[status(thm)],[])).
% 5.16/5.19  thf(4,plain,((~(sP4) | sP5) | sP6),inference(prop_rule,[status(thm)],[])).
% 5.16/5.19  thf(5,plain,(~(sP6) | sP9),inference(all_rule,[status(thm)],[])).
% 5.16/5.19  thf(6,plain,((~(sP9) | ~(sP10)) | sP7),inference(prop_rule,[status(thm)],[])).
% 5.16/5.19  thf(7,plain,~(sP5),inference(prop_rule,[status(thm)],[])).
% 5.16/5.19  thf(refl_axiom,axiom,(![X1:$i>$o]:(mvalid @ ((mimpl @ ((mbox @ rel) @ X1)) @ X1)))).
% 5.16/5.19  thf(8,plain,sP8,inference(preprocess,[status(thm)],[refl_axiom]).
% 5.16/5.19  thf(9,plain,$false,inference(prop_unsat,[status(thm),assumptions([h8,h9,h7,h5,h6,h3,h4,h2,h1,h0])],[1,2,3,4,5,6,7,h5,h8,h9,8])).
% 5.16/5.19  thf(10,plain,$false,inference(tab_negimp,[status(thm),assumptions([h7,h5,h6,h3,h4,h2,h1,h0]),tab_negimp(discharge,[h8,h9])],[h7,9,h8,h9])).
% 5.16/5.19  thf(11,plain,$false,inference(tab_negall,[status(thm),assumptions([h5,h6,h3,h4,h2,h1,h0]),tab_negall(discharge,[h7]),tab_negall(eigenvar,eigen__2)],[h6,10,h7])).
% 5.16/5.19  thf(12,plain,$false,inference(tab_negimp,[status(thm),assumptions([h3,h4,h2,h1,h0]),tab_negimp(discharge,[h5,h6])],[h4,11,h5,h6])).
% 5.16/5.19  thf(13,plain,$false,inference(tab_negimp,[status(thm),assumptions([h2,h1,h0]),tab_negimp(discharge,[h3,h4])],[h2,12,h3,h4])).
% 5.16/5.19  thf(14,plain,$false,inference(tab_negall,[status(thm),assumptions([h1,h0]),tab_negall(discharge,[h2]),tab_negall(eigenvar,eigen__1)],[h1,13,h2])).
% 5.16/5.19  thf(15,plain,$false,inference(tab_negall,[status(thm),assumptions([h0]),tab_negall(discharge,[h1]),tab_negall(eigenvar,eigen__0)],[h0,14,h1])).
% 5.16/5.19  thf(0,theorem,(![X1:$i]:(![X2:$i]:(((rel @ X1) @ X2) => ((~((~((![X3:$i]:(((rel @ X2) @ X3) => ((~(sP5)) => (![X4:$i]:(((rel @ X3) @ X4) => (s @ X4)))))))))) => (![X3:$i]:(((rel @ X2) @ X3) => (s @ X3))))))),inference(contra,[status(thm),contra(discharge,[h0])],[15,h0])).
% 5.16/5.19  % SZS output end Proof
%------------------------------------------------------------------------------