TSTP Solution File: AGT037^1 by Satallax---3.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : AGT037^1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% Computer : n021.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 14 12:03:42 EDT 2022
% Result : Theorem 6.05s 6.25s
% Output : Proof 6.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : AGT037^1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.13 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.13/0.35 % Computer : n021.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 : 600
% 0.13/0.35 % DateTime : Sat Jun 4 03:58:48 EDT 2022
% 0.13/0.35 % CPUTime :
% 6.05/6.25 % SZS status Theorem
% 6.05/6.25 % Mode: mode94:USE_SINE=true:SINE_TOLERANCE=1.2:SINE_GENERALITY_THRESHOLD=4:SINE_RANK_LIMIT=3.:SINE_DEPTH=0
% 6.05/6.25 % Inferences: 119
% 6.05/6.25 % SZS output start Proof
% 6.05/6.25 thf(ty_mu, type, mu : $tType).
% 6.05/6.25 thf(ty_jan, type, jan : mu).
% 6.05/6.25 thf(ty_a3, type, a3 : ($i>$i>$o)).
% 6.05/6.25 thf(ty_cola, type, cola : mu).
% 6.05/6.25 thf(ty_eigen__1, type, eigen__1 : $i).
% 6.05/6.25 thf(ty_eigen__0, type, eigen__0 : $i).
% 6.05/6.25 thf(ty_possibly_likes, type, possibly_likes : (mu>mu>$i>$o)).
% 6.05/6.25 thf(ty_likes, type, likes : (mu>mu>$i>$o)).
% 6.05/6.25 thf(ty_piotr, type, piotr : mu).
% 6.05/6.25 thf(ty_pepsi, type, pepsi : mu).
% 6.05/6.25 thf(h0, assumption, (![X1:$i>$o]:(![X2:$i]:((X1 @ X2) => (X1 @ (eps__0 @ X1))))),introduced(assumption,[])).
% 6.05/6.25 thf(eigendef_eigen__1, definition, eigen__1 = (eps__0 @ (^[X1:$i]:(~((((a3 @ eigen__0) @ X1) => (~((((likes @ piotr) @ pepsi) @ X1)))))))), introduced(definition,[new_symbols(definition,[eigen__1])])).
% 6.05/6.25 thf(sP1,plain,sP1 <=> (![X1:$i]:(((a3 @ eigen__0) @ X1) => (~((((likes @ jan) @ cola) @ X1))))),introduced(definition,[new_symbols(definition,[sP1])])).
% 6.05/6.25 thf(sP2,plain,sP2 <=> (![X1:$i]:(![X2:$i]:(((a3 @ X1) @ X2) => (((likes @ jan) @ cola) @ X2)))),introduced(definition,[new_symbols(definition,[sP2])])).
% 6.05/6.25 thf(sP3,plain,sP3 <=> (![X1:$i]:(((a3 @ eigen__0) @ X1) => (((likes @ jan) @ cola) @ X1))),introduced(definition,[new_symbols(definition,[sP3])])).
% 6.05/6.25 thf(sP4,plain,sP4 <=> (![X1:mu]:((~((![X2:$i]:(((a3 @ eigen__0) @ X2) => (~((((likes @ jan) @ X1) @ X2))))))) => (((possibly_likes @ jan) @ X1) @ eigen__0))),introduced(definition,[new_symbols(definition,[sP4])])).
% 6.05/6.25 thf(sP5,plain,sP5 <=> (((a3 @ eigen__0) @ eigen__1) => (((likes @ jan) @ cola) @ eigen__1)),introduced(definition,[new_symbols(definition,[sP5])])).
% 6.05/6.25 thf(sP6,plain,sP6 <=> (((possibly_likes @ jan) @ cola) @ eigen__0),introduced(definition,[new_symbols(definition,[sP6])])).
% 6.05/6.25 thf(sP7,plain,sP7 <=> ((a3 @ eigen__0) @ eigen__1),introduced(definition,[new_symbols(definition,[sP7])])).
% 6.05/6.25 thf(sP8,plain,sP8 <=> (![X1:$i]:(~((![X2:$i]:(((a3 @ X1) @ X2) => (~((((likes @ piotr) @ pepsi) @ X2)))))))),introduced(definition,[new_symbols(definition,[sP8])])).
% 6.05/6.25 thf(sP9,plain,sP9 <=> (((likes @ jan) @ cola) @ eigen__1),introduced(definition,[new_symbols(definition,[sP9])])).
% 6.05/6.25 thf(sP10,plain,sP10 <=> (![X1:$i]:(((a3 @ eigen__0) @ X1) => (~((((likes @ piotr) @ pepsi) @ X1))))),introduced(definition,[new_symbols(definition,[sP10])])).
% 6.05/6.25 thf(sP11,plain,sP11 <=> ((~(sP1)) => sP6),introduced(definition,[new_symbols(definition,[sP11])])).
% 6.05/6.25 thf(sP12,plain,sP12 <=> (![X1:mu]:(![X2:mu]:((~((![X3:$i]:(((a3 @ eigen__0) @ X3) => (~((((likes @ X1) @ X2) @ X3))))))) => (((possibly_likes @ X1) @ X2) @ eigen__0)))),introduced(definition,[new_symbols(definition,[sP12])])).
% 6.05/6.25 thf(sP13,plain,sP13 <=> (sP7 => (~((((likes @ piotr) @ pepsi) @ eigen__1)))),introduced(definition,[new_symbols(definition,[sP13])])).
% 6.05/6.25 thf(sP14,plain,sP14 <=> (sP7 => (~(sP9))),introduced(definition,[new_symbols(definition,[sP14])])).
% 6.05/6.25 thf(sP15,plain,sP15 <=> (![X1:$i]:(![X2:mu]:(![X3:mu]:((~((![X4:$i]:(((a3 @ X1) @ X4) => (~((((likes @ X2) @ X3) @ X4))))))) => (((possibly_likes @ X2) @ X3) @ X1))))),introduced(definition,[new_symbols(definition,[sP15])])).
% 6.05/6.25 thf(def_mnot,definition,(mnot = (^[X1:$i>$o]:(^[X2:$i]:(~((X1 @ X2))))))).
% 6.05/6.25 thf(def_mor,definition,(mor = (^[X1:$i>$o]:(^[X2:$i>$o]:(^[X3:$i]:((~((X1 @ X3))) => (X2 @ X3))))))).
% 6.05/6.25 thf(def_mimplies,definition,(mimplies = (^[X1:$i>$o]:(mor @ (mnot @ X1))))).
% 6.05/6.25 thf(def_mforall_ind,definition,(mforall_ind = (^[X1:mu>$i>$o]:(^[X2:$i]:(![X3:mu]:((X1 @ X3) @ X2)))))).
% 6.05/6.25 thf(def_mbox,definition,(mbox = (^[X1:$i>$i>$o]:(^[X2:$i>$o]:(^[X3:$i]:(![X4:$i]:(((X1 @ X3) @ X4) => (X2 @ X4)))))))).
% 6.05/6.25 thf(def_mdia,definition,(mdia = (^[X1:$i>$i>$o]:(^[X2:$i>$o]:(mnot @ ((mbox @ X1) @ (mnot @ X2))))))).
% 6.05/6.25 thf(def_mvalid,definition,(mvalid = (!!))).
% 6.05/6.25 thf(conj,conjecture,((!!) @ ((possibly_likes @ jan) @ cola))).
% 6.05/6.25 thf(h1,negated_conjecture,(~(((!!) @ ((possibly_likes @ jan) @ cola)))),inference(assume_negation,[status(cth)],[conj])).
% 6.05/6.25 thf(h2,assumption,(~(sP6)),introduced(assumption,[])).
% 6.05/6.25 thf(1,plain,(~(sP1) | sP14),inference(all_rule,[status(thm)],[])).
% 6.05/6.25 thf(2,plain,((~(sP14) | ~(sP7)) | ~(sP9)),inference(prop_rule,[status(thm)],[])).
% 6.05/6.25 thf(3,plain,(~(sP3) | sP5),inference(all_rule,[status(thm)],[])).
% 6.05/6.25 thf(4,plain,((~(sP5) | ~(sP7)) | sP9),inference(prop_rule,[status(thm)],[])).
% 6.05/6.25 thf(5,plain,(sP13 | sP7),inference(prop_rule,[status(thm)],[])).
% 6.05/6.25 thf(6,plain,(sP10 | ~(sP13)),inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__1])).
% 6.05/6.25 thf(7,plain,(~(sP2) | sP3),inference(all_rule,[status(thm)],[])).
% 6.05/6.25 thf(8,plain,(~(sP8) | ~(sP10)),inference(all_rule,[status(thm)],[])).
% 6.05/6.25 thf(9,plain,(~(sP15) | sP12),inference(all_rule,[status(thm)],[])).
% 6.05/6.25 thf(10,plain,(~(sP12) | sP4),inference(all_rule,[status(thm)],[])).
% 6.05/6.25 thf(11,plain,(~(sP4) | sP11),inference(all_rule,[status(thm)],[])).
% 6.05/6.25 thf(12,plain,((~(sP11) | sP1) | sP6),inference(prop_rule,[status(thm)],[])).
% 6.05/6.25 thf(axiom_user_communication_5,axiom,(mvalid @ (mforall_ind @ (^[X1:mu]:(mforall_ind @ (^[X2:mu]:((mimplies @ ((mdia @ a3) @ ((likes @ X1) @ X2))) @ ((possibly_likes @ X1) @ X2)))))))).
% 6.05/6.25 thf(13,plain,sP15,inference(preprocess,[status(thm)],[axiom_user_communication_5]).
% 6.05/6.25 thf(axiom_a3_2,axiom,(mvalid @ ((mdia @ a3) @ ((likes @ piotr) @ pepsi)))).
% 6.05/6.25 thf(14,plain,sP8,inference(preprocess,[status(thm)],[axiom_a3_2]).
% 6.05/6.25 thf(axiom_a3_1,axiom,(mvalid @ ((mbox @ a3) @ ((likes @ jan) @ cola)))).
% 6.05/6.25 thf(15,plain,sP2,inference(preprocess,[status(thm)],[axiom_a3_1]).
% 6.05/6.25 thf(16,plain,$false,inference(prop_unsat,[status(thm),assumptions([h2,h1,h0])],[1,2,3,4,5,6,7,8,9,10,11,12,h2,13,14,15])).
% 6.05/6.25 thf(17,plain,$false,inference(tab_negall,[status(thm),assumptions([h1,h0]),tab_negall(discharge,[h2]),tab_negall(eigenvar,eigen__0)],[h1,16,h2])).
% 6.05/6.25 thf(18,plain,$false,inference(eigenvar_choice,[status(thm),assumptions([h1]),eigenvar_choice(discharge,[h0])],[17,h0])).
% 6.05/6.25 thf(0,theorem,((!!) @ ((possibly_likes @ jan) @ cola)),inference(contra,[status(thm),contra(discharge,[h1])],[17,h1])).
% 6.05/6.25 % SZS output end Proof
%------------------------------------------------------------------------------