↑ Up

Satallax---3.5.THM-Prf.s

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

% Computer : n027.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:16:12 PM UTC 2025

% Result   : Theorem 1.12s 1.39s
% Output   : Proof 1.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : PUZ149^13 : TPTP v9.2.0. Released v8.1.0.
% 0.07/0.14  % Command  : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.14/0.36  % Computer : n027.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Wed Oct  8 17:24:53 EDT 2025
% 0.14/0.36  % CPUTime  : 
% 1.12/1.39  % SZS status Theorem
% 1.12/1.39  % Mode: mode506
% 1.12/1.39  % Inferences: 39919
% 1.12/1.39  % SZS output start Proof
% 1.12/1.39  thf(ty_mindex, type, mindex : $tType).
% 1.12/1.39  thf(ty_mworld, type, mworld : $tType).
% 1.12/1.39  thf(ty_eigen__2, type, eigen__2 : mworld).
% 1.12/1.39  thf(ty_'#make_c', type, '#make_c' : mindex).
% 1.12/1.39  thf(ty_mrel, type, mrel : (mindex>mworld>mworld>$o)).
% 1.12/1.39  thf(ty_'#pour_a', type, '#pour_a' : mindex).
% 1.12/1.39  thf(ty_'#pour_b', type, '#pour_b' : mindex).
% 1.12/1.39  thf(ty_acid, type, acid : (mworld>$o)).
% 1.12/1.39  thf(ty_mactual, type, mactual : mworld).
% 1.12/1.39  thf(h0, assumption, (![X1:mworld>$o]:(![X2:mworld]:((X1 @ X2) => (X1 @ (eps__0 @ X1))))),introduced(assumption,[])).
% 1.12/1.39  thf(eigendef_eigen__2, definition, eigen__2 = (eps__0 @ (^[X1:mworld]:(~(((((mrel @ '#pour_a') @ mactual) @ X1) => (![X2:mworld]:((((mrel @ '#pour_b') @ X1) @ X2) => (~((acid @ X2)))))))))), introduced(definition,[new_symbols(definition,[eigen__2])])).
% 1.12/1.39  thf(sP1,plain,sP1 <=> (![X1:mworld]:((((mrel @ '#make_c') @ mactual) @ X1) => (~((acid @ X1))))),introduced(definition,[new_symbols(definition,[sP1])])).
% 1.12/1.39  thf(sP2,plain,sP2 <=> ((((mrel @ '#pour_a') @ mactual) @ eigen__2) => (acid @ eigen__2)),introduced(definition,[new_symbols(definition,[sP2])])).
% 1.12/1.39  thf(sP3,plain,sP3 <=> ((((mrel @ '#pour_a') @ mactual) @ eigen__2) => (![X1:mworld]:((((mrel @ '#pour_b') @ eigen__2) @ X1) => (~((acid @ X1)))))),introduced(definition,[new_symbols(definition,[sP3])])).
% 1.12/1.39  thf(sP4,plain,sP4 <=> (acid @ eigen__2),introduced(definition,[new_symbols(definition,[sP4])])).
% 1.12/1.39  thf(sP5,plain,sP5 <=> (![X1:mworld]:((((mrel @ '#pour_a') @ mactual) @ X1) => (~((acid @ X1))))),introduced(definition,[new_symbols(definition,[sP5])])).
% 1.12/1.39  thf(sP6,plain,sP6 <=> ((((mrel @ '#pour_a') @ mactual) @ eigen__2) => (~(sP4))),introduced(definition,[new_symbols(definition,[sP6])])).
% 1.12/1.39  thf(sP7,plain,sP7 <=> (((mrel @ '#pour_a') @ mactual) @ eigen__2),introduced(definition,[new_symbols(definition,[sP7])])).
% 1.12/1.39  thf(sP8,plain,sP8 <=> (![X1:mworld]:((((mrel @ '#pour_a') @ mactual) @ X1) => (![X2:mworld]:((((mrel @ '#pour_b') @ X1) @ X2) => (~((acid @ X2))))))),introduced(definition,[new_symbols(definition,[sP8])])).
% 1.12/1.39  thf(sP9,plain,sP9 <=> (sP8 => sP1),introduced(definition,[new_symbols(definition,[sP9])])).
% 1.12/1.39  thf(sP10,plain,sP10 <=> ((~((![X1:mworld]:((((mrel @ '#pour_a') @ mactual) @ X1) => (acid @ X1))))) => sP8),introduced(definition,[new_symbols(definition,[sP10])])).
% 1.12/1.39  thf(sP11,plain,sP11 <=> (![X1:mworld]:((((mrel @ '#pour_a') @ mactual) @ X1) => (acid @ X1))),introduced(definition,[new_symbols(definition,[sP11])])).
% 1.12/1.39  thf(def_mlocal,definition,(mlocal = (^[X1:mworld>$o]:(X1 @ mactual)))).
% 1.12/1.39  thf(def_mnot,definition,(mnot = (^[X1:mworld>$o]:(^[X2:mworld]:(~((X1 @ X2))))))).
% 1.12/1.39  thf(def_mand,definition,(mand = (^[X1:mworld>$o]:(^[X2:mworld>$o]:(^[X3:mworld]:(~(((X1 @ X3) => (~((X2 @ X3))))))))))).
% 1.12/1.39  thf(def_mor,definition,(mor = (^[X1:mworld>$o]:(^[X2:mworld>$o]:(^[X3:mworld]:((~((X1 @ X3))) => (X2 @ X3))))))).
% 1.12/1.39  thf(def_mimplies,definition,(mimplies = (^[X1:mworld>$o]:(^[X2:mworld>$o]:(^[X3:mworld]:((X1 @ X3) => (X2 @ X3))))))).
% 1.12/1.39  thf(def_mequiv,definition,(mequiv = (^[X1:mworld>$o]:(^[X2:mworld>$o]:(^[X3:mworld]:((X1 @ X3) = (X2 @ X3))))))).
% 1.12/1.39  thf(def_mbox,definition,(mbox = (^[X1:mindex]:(^[X2:mworld>$o]:(^[X3:mworld]:(![X4:mworld]:((((mrel @ X1) @ X3) @ X4) => (X2 @ X4)))))))).
% 1.12/1.39  thf(def_mdia,definition,(mdia = (^[X1:mindex]:(^[X2:mworld>$o]:(^[X3:mworld]:(~((![X4:mworld]:((((mrel @ X1) @ X3) @ X4) => (~((X2 @ X4)))))))))))).
% 1.12/1.39  thf(conj,conjecture,(~(((~((![X1:mworld]:((((mrel @ '#pour_a') @ mactual) @ X1) => (~((~((acid @ X1))))))))) => (~((~((![X1:mworld]:((((mrel @ '#pour_a') @ mactual) @ X1) => (~((~((![X2:mworld]:((((mrel @ '#pour_b') @ X1) @ X2) => (~((acid @ X2))))))))))))))))))).
% 1.12/1.39  thf(h1,negated_conjecture,sP10,inference(assume_negation,[status(cth)],[conj])).
% 1.12/1.39  thf(1,plain,(~(sP5) | sP6),inference(all_rule,[status(thm)],[])).
% 1.12/1.39  thf(2,plain,((~(sP6) | ~(sP7)) | ~(sP4)),inference(prop_rule,[status(thm)],[])).
% 1.12/1.39  thf(3,plain,(~(sP11) | sP2),inference(all_rule,[status(thm)],[])).
% 1.12/1.39  thf(4,plain,((~(sP2) | ~(sP7)) | sP4),inference(prop_rule,[status(thm)],[])).
% 1.12/1.39  thf(5,plain,(sP3 | sP7),inference(prop_rule,[status(thm)],[])).
% 1.12/1.39  thf(6,plain,(sP8 | ~(sP3)),inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__2])).
% 1.12/1.39  thf(7,plain,((~(sP9) | ~(sP8)) | sP1),inference(prop_rule,[status(thm)],[])).
% 1.12/1.39  thf(8,plain,((~(sP10) | sP11) | sP8),inference(prop_rule,[status(thm)],[])).
% 1.12/1.39  thf(make_c_acid,axiom,(mlocal @ ((mdia @ '#make_c') @ acid))).
% 1.12/1.39  thf(9,plain,(~(sP1)),inference(preprocess,[status(thm)],[make_c_acid]).
% 1.12/1.39  thf(pour_a_acid,axiom,(mlocal @ ((mbox @ '#pour_a') @ (mnot @ acid)))).
% 1.12/1.39  thf(10,plain,sP5,inference(preprocess,[status(thm)],[pour_a_acid]).
% 1.12/1.39  thf(pour_ab_make_axiom_2,axiom,(mlocal @ ((mimplies @ ((mbox @ '#pour_a') @ ((mbox @ '#pour_b') @ (mnot @ acid)))) @ ((mbox @ '#make_c') @ (mnot @ acid))))).
% 1.12/1.39  thf(11,plain,sP9,inference(preprocess,[status(thm)],[pour_ab_make_axiom_2]).
% 1.12/1.39  thf(12,plain,$false,inference(prop_unsat,[status(thm),assumptions([h1,h0])],[1,2,3,4,5,6,7,8,9,10,11,h1])).
% 1.12/1.39  thf(13,plain,$false,inference(eigenvar_choice,[status(thm),assumptions([h1]),eigenvar_choice(discharge,[h0])],[12,h0])).
% 1.12/1.39  thf(0,theorem,(~(((~((![X1:mworld]:((((mrel @ '#pour_a') @ mactual) @ X1) => (~((~((acid @ X1))))))))) => (~((~((![X1:mworld]:((((mrel @ '#pour_a') @ mactual) @ X1) => (~((~((![X2:mworld]:((((mrel @ '#pour_b') @ X1) @ X2) => (~((acid @ X2)))))))))))))))))),inference(contra,[status(thm),contra(discharge,[h1])],[12,h1])).
% 1.12/1.39  % SZS output end Proof
%------------------------------------------------------------------------------