TSTP Solution File: MED008+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MED008+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Wed Dec 29 16:01:19 EST 2010
% Result : Theorem 1.86s
% Output : Solution 1.86s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP17635/MED008+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17635/MED008+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17635/MED008+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 17731
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.023 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:~(gt(X1,X1)),file('/tmp/SRASS.s.p', irreflexivity_gt)).
% fof(3, axiom,![X4]:(~(conditionhyper(X4))|~(conditionnormo(X4))),file('/tmp/SRASS.s.p', xorcondition3)).
% fof(16, axiom,![X4]:(~(s1(X4))|~(s3(X4))),file('/tmp/SRASS.s.p', xorstep6)).
% fof(20, axiom,![X4]:(![X5]:(~(gt(X4,X5))=>conditionnormo(X5))=>((((((![X5]:(~(gt(X4,X5))=>bsecretioni(X5))&bcapacitysn(X4))&qilt27(X4))&![X5]:(gt(X4,X5)=>conditionhyper(X5)))|(((![X5]:(~(gt(X4,X5))=>~(releaselg(X5)))&bcapacitysn(X4))&~(qilt27(X4)))&![X5]:(gt(X4,X5)=>conditionhyper(X5))))|((((![X5]:(~(gt(X4,X5))=>~(releaselg(X5)))|![X5]:(~(gt(X4,X5))=>uptakepg(X5)))&bcapacityne(X4))&![X5]:(~(gt(X4,X5))=>bsecretioni(X5)))&![X5]:(gt(X4,X5)=>conditionhyper(X5))))|(((![X5]:(~(gt(X4,X5))=>uptakelg(X5))&![X5]:(~(gt(X4,X5))=>uptakepg(X5)))&bcapacityex(X4))&![X5]:(gt(X4,X5)=>conditionhyper(X5))))),file('/tmp/SRASS.s.p', normo)).
% fof(24, axiom,![X4]:((![X5]:(~(gt(X4,X5))=>uptakelg(X5))|![X5]:(~(gt(X4,X5))=>uptakepg(X5)))=>![X5]:(~(gt(X4,X5))=>drugi(X5))),file('/tmp/SRASS.s.p', insulin_completion)).
% fof(29, axiom,![X4]:![X5]:(~(gt(X4,X5))=>(~(releaselg(X5))=>uptakelg(X5))),file('/tmp/SRASS.s.p', uptake_completion)).
% fof(36, axiom,![X4]:(drugi(X4)=>s3(X4)),file('/tmp/SRASS.s.p', insulincomp)).
% fof(41, conjecture,((((s1(n0)&![X4]:(gt(n0,X4)=>conditionhyper(X4)))&~(bcapacitysn(n0)))&~(qilt27(n0)))=>~(![X4]:(~(gt(n0,X4))=>conditionnormo(X4)))),file('/tmp/SRASS.s.p', unsuccessfuls1_qige27)).
% fof(42, negated_conjecture,~(((((s1(n0)&![X4]:(gt(n0,X4)=>conditionhyper(X4)))&~(bcapacitysn(n0)))&~(qilt27(n0)))=>~(![X4]:(~(gt(n0,X4))=>conditionnormo(X4))))),inference(assume_negation,[status(cth)],[41])).
% fof(43, plain,![X1]:~(gt(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(44, plain,![X4]:(~(conditionhyper(X4))|~(conditionnormo(X4))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(55, plain,![X4]:(~(s1(X4))|~(s3(X4))),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(59, plain,![X4]:(![X5]:(~(gt(X4,X5))=>conditionnormo(X5))=>((((((![X5]:(~(gt(X4,X5))=>bsecretioni(X5))&bcapacitysn(X4))&qilt27(X4))&![X5]:(gt(X4,X5)=>conditionhyper(X5)))|(((![X5]:(~(gt(X4,X5))=>~(releaselg(X5)))&bcapacitysn(X4))&~(qilt27(X4)))&![X5]:(gt(X4,X5)=>conditionhyper(X5))))|((((![X5]:(~(gt(X4,X5))=>~(releaselg(X5)))|![X5]:(~(gt(X4,X5))=>uptakepg(X5)))&bcapacityne(X4))&![X5]:(~(gt(X4,X5))=>bsecretioni(X5)))&![X5]:(gt(X4,X5)=>conditionhyper(X5))))|(((![X5]:(~(gt(X4,X5))=>uptakelg(X5))&![X5]:(~(gt(X4,X5))=>uptakepg(X5)))&bcapacityex(X4))&![X5]:(gt(X4,X5)=>conditionhyper(X5))))),inference(fof_simplification,[status(thm)],[20,theory(equality)])).
% fof(63, plain,![X4]:((![X5]:(~(gt(X4,X5))=>uptakelg(X5))|![X5]:(~(gt(X4,X5))=>uptakepg(X5)))=>![X5]:(~(gt(X4,X5))=>drugi(X5))),inference(fof_simplification,[status(thm)],[24,theory(equality)])).
% fof(67, plain,![X4]:![X5]:(~(gt(X4,X5))=>(~(releaselg(X5))=>uptakelg(X5))),inference(fof_simplification,[status(thm)],[29,theory(equality)])).
% fof(74, negated_conjecture,~(((((s1(n0)&![X4]:(gt(n0,X4)=>conditionhyper(X4)))&~(bcapacitysn(n0)))&~(qilt27(n0)))=>~(![X4]:(~(gt(n0,X4))=>conditionnormo(X4))))),inference(fof_simplification,[status(thm)],[42,theory(equality)])).
% fof(75, plain,![X4]:(epred1_1(X4)=>(((((![X5]:(~(gt(X4,X5))=>bsecretioni(X5))&bcapacitysn(X4))&qilt27(X4))&![X5]:(gt(X4,X5)=>conditionhyper(X5)))|(((![X5]:(~(gt(X4,X5))=>~(releaselg(X5)))&bcapacitysn(X4))&~(qilt27(X4)))&![X5]:(gt(X4,X5)=>conditionhyper(X5))))|((((![X5]:(~(gt(X4,X5))=>~(releaselg(X5)))|![X5]:(~(gt(X4,X5))=>uptakepg(X5)))&bcapacityne(X4))&![X5]:(~(gt(X4,X5))=>bsecretioni(X5)))&![X5]:(gt(X4,X5)=>conditionhyper(X5))))),introduced(definition)).
% fof(76, plain,![X4]:(![X5]:(~(gt(X4,X5))=>conditionnormo(X5))=>(epred1_1(X4)|(((![X5]:(~(gt(X4,X5))=>uptakelg(X5))&![X5]:(~(gt(X4,X5))=>uptakepg(X5)))&bcapacityex(X4))&![X5]:(gt(X4,X5)=>conditionhyper(X5))))),inference(apply_def,[status(esa)],[59,75,theory(equality)])).
% fof(77, plain,![X2]:~(gt(X2,X2)),inference(variable_rename,[status(thm)],[43])).
% cnf(78,plain,(~gt(X1,X1)),inference(split_conjunct,[status(thm)],[77])).
% fof(82, plain,![X5]:(~(conditionhyper(X5))|~(conditionnormo(X5))),inference(variable_rename,[status(thm)],[44])).
% cnf(83,plain,(~conditionnormo(X1)|~conditionhyper(X1)),inference(split_conjunct,[status(thm)],[82])).
% fof(137, plain,![X5]:(~(s1(X5))|~(s3(X5))),inference(variable_rename,[status(thm)],[55])).
% cnf(138,plain,(~s3(X1)|~s1(X1)),inference(split_conjunct,[status(thm)],[137])).
% fof(152, plain,![X4]:(?[X5]:(~(gt(X4,X5))&~(conditionnormo(X5)))|(epred1_1(X4)|(((![X5]:(gt(X4,X5)|uptakelg(X5))&![X5]:(gt(X4,X5)|uptakepg(X5)))&bcapacityex(X4))&![X5]:(~(gt(X4,X5))|conditionhyper(X5))))),inference(fof_nnf,[status(thm)],[76])).
% fof(153, plain,![X6]:(?[X7]:(~(gt(X6,X7))&~(conditionnormo(X7)))|(epred1_1(X6)|(((![X8]:(gt(X6,X8)|uptakelg(X8))&![X9]:(gt(X6,X9)|uptakepg(X9)))&bcapacityex(X6))&![X10]:(~(gt(X6,X10))|conditionhyper(X10))))),inference(variable_rename,[status(thm)],[152])).
% fof(154, plain,![X6]:((~(gt(X6,esk8_1(X6)))&~(conditionnormo(esk8_1(X6))))|(epred1_1(X6)|(((![X8]:(gt(X6,X8)|uptakelg(X8))&![X9]:(gt(X6,X9)|uptakepg(X9)))&bcapacityex(X6))&![X10]:(~(gt(X6,X10))|conditionhyper(X10))))),inference(skolemize,[status(esa)],[153])).
% fof(155, plain,![X6]:![X8]:![X9]:![X10]:((((~(gt(X6,X10))|conditionhyper(X10))&(((gt(X6,X9)|uptakepg(X9))&(gt(X6,X8)|uptakelg(X8)))&bcapacityex(X6)))|epred1_1(X6))|(~(gt(X6,esk8_1(X6)))&~(conditionnormo(esk8_1(X6))))),inference(shift_quantors,[status(thm)],[154])).
% fof(156, plain,![X6]:![X8]:![X9]:![X10]:(((~(gt(X6,esk8_1(X6)))|((~(gt(X6,X10))|conditionhyper(X10))|epred1_1(X6)))&(~(conditionnormo(esk8_1(X6)))|((~(gt(X6,X10))|conditionhyper(X10))|epred1_1(X6))))&((((~(gt(X6,esk8_1(X6)))|((gt(X6,X9)|uptakepg(X9))|epred1_1(X6)))&(~(conditionnormo(esk8_1(X6)))|((gt(X6,X9)|uptakepg(X9))|epred1_1(X6))))&((~(gt(X6,esk8_1(X6)))|((gt(X6,X8)|uptakelg(X8))|epred1_1(X6)))&(~(conditionnormo(esk8_1(X6)))|((gt(X6,X8)|uptakelg(X8))|epred1_1(X6)))))&((~(gt(X6,esk8_1(X6)))|(bcapacityex(X6)|epred1_1(X6)))&(~(conditionnormo(esk8_1(X6)))|(bcapacityex(X6)|epred1_1(X6)))))),inference(distribute,[status(thm)],[155])).
% cnf(161,plain,(epred1_1(X1)|uptakepg(X2)|gt(X1,X2)|~conditionnormo(esk8_1(X1))),inference(split_conjunct,[status(thm)],[156])).
% cnf(162,plain,(epred1_1(X1)|uptakepg(X2)|gt(X1,X2)|~gt(X1,esk8_1(X1))),inference(split_conjunct,[status(thm)],[156])).
% cnf(163,plain,(epred1_1(X1)|conditionhyper(X2)|~gt(X1,X2)|~conditionnormo(esk8_1(X1))),inference(split_conjunct,[status(thm)],[156])).
% fof(208, plain,![X4]:((?[X5]:(~(gt(X4,X5))&~(uptakelg(X5)))&?[X5]:(~(gt(X4,X5))&~(uptakepg(X5))))|![X5]:(gt(X4,X5)|drugi(X5))),inference(fof_nnf,[status(thm)],[63])).
% fof(209, plain,![X6]:((?[X7]:(~(gt(X6,X7))&~(uptakelg(X7)))&?[X8]:(~(gt(X6,X8))&~(uptakepg(X8))))|![X9]:(gt(X6,X9)|drugi(X9))),inference(variable_rename,[status(thm)],[208])).
% fof(210, plain,![X6]:(((~(gt(X6,esk17_1(X6)))&~(uptakelg(esk17_1(X6))))&(~(gt(X6,esk18_1(X6)))&~(uptakepg(esk18_1(X6)))))|![X9]:(gt(X6,X9)|drugi(X9))),inference(skolemize,[status(esa)],[209])).
% fof(211, plain,![X6]:![X9]:((gt(X6,X9)|drugi(X9))|((~(gt(X6,esk17_1(X6)))&~(uptakelg(esk17_1(X6))))&(~(gt(X6,esk18_1(X6)))&~(uptakepg(esk18_1(X6)))))),inference(shift_quantors,[status(thm)],[210])).
% fof(212, plain,![X6]:![X9]:(((~(gt(X6,esk17_1(X6)))|(gt(X6,X9)|drugi(X9)))&(~(uptakelg(esk17_1(X6)))|(gt(X6,X9)|drugi(X9))))&((~(gt(X6,esk18_1(X6)))|(gt(X6,X9)|drugi(X9)))&(~(uptakepg(esk18_1(X6)))|(gt(X6,X9)|drugi(X9))))),inference(distribute,[status(thm)],[211])).
% cnf(213,plain,(drugi(X1)|gt(X2,X1)|~uptakepg(esk18_1(X2))),inference(split_conjunct,[status(thm)],[212])).
% cnf(214,plain,(drugi(X1)|gt(X2,X1)|~gt(X2,esk18_1(X2))),inference(split_conjunct,[status(thm)],[212])).
% cnf(215,plain,(drugi(X1)|gt(X2,X1)|~uptakelg(esk17_1(X2))),inference(split_conjunct,[status(thm)],[212])).
% cnf(216,plain,(drugi(X1)|gt(X2,X1)|~gt(X2,esk17_1(X2))),inference(split_conjunct,[status(thm)],[212])).
% fof(234, plain,![X4]:![X5]:(gt(X4,X5)|(releaselg(X5)|uptakelg(X5))),inference(fof_nnf,[status(thm)],[67])).
% fof(235, plain,![X6]:![X7]:(gt(X6,X7)|(releaselg(X7)|uptakelg(X7))),inference(variable_rename,[status(thm)],[234])).
% cnf(236,plain,(uptakelg(X1)|releaselg(X1)|gt(X2,X1)),inference(split_conjunct,[status(thm)],[235])).
% fof(259, plain,![X4]:(~(drugi(X4))|s3(X4)),inference(fof_nnf,[status(thm)],[36])).
% fof(260, plain,![X5]:(~(drugi(X5))|s3(X5)),inference(variable_rename,[status(thm)],[259])).
% cnf(261,plain,(s3(X1)|~drugi(X1)),inference(split_conjunct,[status(thm)],[260])).
% fof(286, negated_conjecture,((((s1(n0)&![X4]:(~(gt(n0,X4))|conditionhyper(X4)))&~(bcapacitysn(n0)))&~(qilt27(n0)))&![X4]:(gt(n0,X4)|conditionnormo(X4))),inference(fof_nnf,[status(thm)],[74])).
% fof(287, negated_conjecture,((((s1(n0)&![X5]:(~(gt(n0,X5))|conditionhyper(X5)))&~(bcapacitysn(n0)))&~(qilt27(n0)))&![X6]:(gt(n0,X6)|conditionnormo(X6))),inference(variable_rename,[status(thm)],[286])).
% fof(288, negated_conjecture,![X5]:![X6]:((gt(n0,X6)|conditionnormo(X6))&((((~(gt(n0,X5))|conditionhyper(X5))&s1(n0))&~(bcapacitysn(n0)))&~(qilt27(n0)))),inference(shift_quantors,[status(thm)],[287])).
% cnf(290,negated_conjecture,(~bcapacitysn(n0)),inference(split_conjunct,[status(thm)],[288])).
% cnf(291,negated_conjecture,(s1(n0)),inference(split_conjunct,[status(thm)],[288])).
% cnf(292,negated_conjecture,(conditionhyper(X1)|~gt(n0,X1)),inference(split_conjunct,[status(thm)],[288])).
% cnf(293,negated_conjecture,(conditionnormo(X1)|gt(n0,X1)),inference(split_conjunct,[status(thm)],[288])).
% fof(294, plain,![X4]:(~(epred1_1(X4))|(((((![X5]:(gt(X4,X5)|bsecretioni(X5))&bcapacitysn(X4))&qilt27(X4))&![X5]:(~(gt(X4,X5))|conditionhyper(X5)))|(((![X5]:(gt(X4,X5)|~(releaselg(X5)))&bcapacitysn(X4))&~(qilt27(X4)))&![X5]:(~(gt(X4,X5))|conditionhyper(X5))))|((((![X5]:(gt(X4,X5)|~(releaselg(X5)))|![X5]:(gt(X4,X5)|uptakepg(X5)))&bcapacityne(X4))&![X5]:(gt(X4,X5)|bsecretioni(X5)))&![X5]:(~(gt(X4,X5))|conditionhyper(X5))))),inference(fof_nnf,[status(thm)],[75])).
% fof(295, plain,![X6]:(~(epred1_1(X6))|(((((![X7]:(gt(X6,X7)|bsecretioni(X7))&bcapacitysn(X6))&qilt27(X6))&![X8]:(~(gt(X6,X8))|conditionhyper(X8)))|(((![X9]:(gt(X6,X9)|~(releaselg(X9)))&bcapacitysn(X6))&~(qilt27(X6)))&![X10]:(~(gt(X6,X10))|conditionhyper(X10))))|((((![X11]:(gt(X6,X11)|~(releaselg(X11)))|![X12]:(gt(X6,X12)|uptakepg(X12)))&bcapacityne(X6))&![X13]:(gt(X6,X13)|bsecretioni(X13)))&![X14]:(~(gt(X6,X14))|conditionhyper(X14))))),inference(variable_rename,[status(thm)],[294])).
% fof(296, plain,![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:((((~(gt(X6,X14))|conditionhyper(X14))&((gt(X6,X13)|bsecretioni(X13))&(((gt(X6,X12)|uptakepg(X12))|(gt(X6,X11)|~(releaselg(X11))))&bcapacityne(X6))))|(((~(gt(X6,X10))|conditionhyper(X10))&(((gt(X6,X9)|~(releaselg(X9)))&bcapacitysn(X6))&~(qilt27(X6))))|((~(gt(X6,X8))|conditionhyper(X8))&(((gt(X6,X7)|bsecretioni(X7))&bcapacitysn(X6))&qilt27(X6)))))|~(epred1_1(X6))),inference(shift_quantors,[status(thm)],[295])).
% fof(297, plain,![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:(((((((~(gt(X6,X8))|conditionhyper(X8))|(~(gt(X6,X10))|conditionhyper(X10)))|(~(gt(X6,X14))|conditionhyper(X14)))|~(epred1_1(X6)))&((((((gt(X6,X7)|bsecretioni(X7))|(~(gt(X6,X10))|conditionhyper(X10)))|(~(gt(X6,X14))|conditionhyper(X14)))|~(epred1_1(X6)))&(((bcapacitysn(X6)|(~(gt(X6,X10))|conditionhyper(X10)))|(~(gt(X6,X14))|conditionhyper(X14)))|~(epred1_1(X6))))&(((qilt27(X6)|(~(gt(X6,X10))|conditionhyper(X10)))|(~(gt(X6,X14))|conditionhyper(X14)))|~(epred1_1(X6)))))&(((((((~(gt(X6,X8))|conditionhyper(X8))|(gt(X6,X9)|~(releaselg(X9))))|(~(gt(X6,X14))|conditionhyper(X14)))|~(epred1_1(X6)))&((((((gt(X6,X7)|bsecretioni(X7))|(gt(X6,X9)|~(releaselg(X9))))|(~(gt(X6,X14))|conditionhyper(X14)))|~(epred1_1(X6)))&(((bcapacitysn(X6)|(gt(X6,X9)|~(releaselg(X9))))|(~(gt(X6,X14))|conditionhyper(X14)))|~(epred1_1(X6))))&(((qilt27(X6)|(gt(X6,X9)|~(releaselg(X9))))|(~(gt(X6,X14))|conditionhyper(X14)))|~(epred1_1(X6)))))&(((((~(gt(X6,X8))|conditionhyper(X8))|bcapacitysn(X6))|(~(gt(X6,X14))|conditionhyper(X14)))|~(epred1_1(X6)))&((((((gt(X6,X7)|bsecretioni(X7))|bcapacitysn(X6))|(~(gt(X6,X14))|conditionhyper(X14)))|~(epred1_1(X6)))&(((bcapacitysn(X6)|bcapacitysn(X6))|(~(gt(X6,X14))|conditionhyper(X14)))|~(epred1_1(X6))))&(((qilt27(X6)|bcapacitysn(X6))|(~(gt(X6,X14))|conditionhyper(X14)))|~(epred1_1(X6))))))&(((((~(gt(X6,X8))|conditionhyper(X8))|~(qilt27(X6)))|(~(gt(X6,X14))|conditionhyper(X14)))|~(epred1_1(X6)))&((((((gt(X6,X7)|bsecretioni(X7))|~(qilt27(X6)))|(~(gt(X6,X14))|conditionhyper(X14)))|~(epred1_1(X6)))&(((bcapacitysn(X6)|~(qilt27(X6)))|(~(gt(X6,X14))|conditionhyper(X14)))|~(epred1_1(X6))))&(((qilt27(X6)|~(qilt27(X6)))|(~(gt(X6,X14))|conditionhyper(X14)))|~(epred1_1(X6)))))))&(((((((~(gt(X6,X8))|conditionhyper(X8))|(~(gt(X6,X10))|conditionhyper(X10)))|(gt(X6,X13)|bsecretioni(X13)))|~(epred1_1(X6)))&((((((gt(X6,X7)|bsecretioni(X7))|(~(gt(X6,X10))|conditionhyper(X10)))|(gt(X6,X13)|bsecretioni(X13)))|~(epred1_1(X6)))&(((bcapacitysn(X6)|(~(gt(X6,X10))|conditionhyper(X10)))|(gt(X6,X13)|bsecretioni(X13)))|~(epred1_1(X6))))&(((qilt27(X6)|(~(gt(X6,X10))|conditionhyper(X10)))|(gt(X6,X13)|bsecretioni(X13)))|~(epred1_1(X6)))))&(((((((~(gt(X6,X8))|conditionhyper(X8))|(gt(X6,X9)|~(releaselg(X9))))|(gt(X6,X13)|bsecretioni(X13)))|~(epred1_1(X6)))&((((((gt(X6,X7)|bsecretioni(X7))|(gt(X6,X9)|~(releaselg(X9))))|(gt(X6,X13)|bsecretioni(X13)))|~(epred1_1(X6)))&(((bcapacitysn(X6)|(gt(X6,X9)|~(releaselg(X9))))|(gt(X6,X13)|bsecretioni(X13)))|~(epred1_1(X6))))&(((qilt27(X6)|(gt(X6,X9)|~(releaselg(X9))))|(gt(X6,X13)|bsecretioni(X13)))|~(epred1_1(X6)))))&(((((~(gt(X6,X8))|conditionhyper(X8))|bcapacitysn(X6))|(gt(X6,X13)|bsecretioni(X13)))|~(epred1_1(X6)))&((((((gt(X6,X7)|bsecretioni(X7))|bcapacitysn(X6))|(gt(X6,X13)|bsecretioni(X13)))|~(epred1_1(X6)))&(((bcapacitysn(X6)|bcapacitysn(X6))|(gt(X6,X13)|bsecretioni(X13)))|~(epred1_1(X6))))&(((qilt27(X6)|bcapacitysn(X6))|(gt(X6,X13)|bsecretioni(X13)))|~(epred1_1(X6))))))&(((((~(gt(X6,X8))|conditionhyper(X8))|~(qilt27(X6)))|(gt(X6,X13)|bsecretioni(X13)))|~(epred1_1(X6)))&((((((gt(X6,X7)|bsecretioni(X7))|~(qilt27(X6)))|(gt(X6,X13)|bsecretioni(X13)))|~(epred1_1(X6)))&(((bcapacitysn(X6)|~(qilt27(X6)))|(gt(X6,X13)|bsecretioni(X13)))|~(epred1_1(X6))))&(((qilt27(X6)|~(qilt27(X6)))|(gt(X6,X13)|bsecretioni(X13)))|~(epred1_1(X6)))))))&(((((((~(gt(X6,X8))|conditionhyper(X8))|(~(gt(X6,X10))|conditionhyper(X10)))|((gt(X6,X12)|uptakepg(X12))|(gt(X6,X11)|~(releaselg(X11)))))|~(epred1_1(X6)))&((((((gt(X6,X7)|bsecretioni(X7))|(~(gt(X6,X10))|conditionhyper(X10)))|((gt(X6,X12)|uptakepg(X12))|(gt(X6,X11)|~(releaselg(X11)))))|~(epred1_1(X6)))&(((bcapacitysn(X6)|(~(gt(X6,X10))|conditionhyper(X10)))|((gt(X6,X12)|uptakepg(X12))|(gt(X6,X11)|~(releaselg(X11)))))|~(epred1_1(X6))))&(((qilt27(X6)|(~(gt(X6,X10))|conditionhyper(X10)))|((gt(X6,X12)|uptakepg(X12))|(gt(X6,X11)|~(releaselg(X11)))))|~(epred1_1(X6)))))&(((((((~(gt(X6,X8))|conditionhyper(X8))|(gt(X6,X9)|~(releaselg(X9))))|((gt(X6,X12)|uptakepg(X12))|(gt(X6,X11)|~(releaselg(X11)))))|~(epred1_1(X6)))&((((((gt(X6,X7)|bsecretioni(X7))|(gt(X6,X9)|~(releaselg(X9))))|((gt(X6,X12)|uptakepg(X12))|(gt(X6,X11)|~(releaselg(X11)))))|~(epred1_1(X6)))&(((bcapacitysn(X6)|(gt(X6,X9)|~(releaselg(X9))))|((gt(X6,X12)|uptakepg(X12))|(gt(X6,X11)|~(releaselg(X11)))))|~(epred1_1(X6))))&(((qilt27(X6)|(gt(X6,X9)|~(releaselg(X9))))|((gt(X6,X12)|uptakepg(X12))|(gt(X6,X11)|~(releaselg(X11)))))|~(epred1_1(X6)))))&(((((~(gt(X6,X8))|conditionhyper(X8))|bcapacitysn(X6))|((gt(X6,X12)|uptakepg(X12))|(gt(X6,X11)|~(releaselg(X11)))))|~(epred1_1(X6)))&((((((gt(X6,X7)|bsecretioni(X7))|bcapacitysn(X6))|((gt(X6,X12)|uptakepg(X12))|(gt(X6,X11)|~(releaselg(X11)))))|~(epred1_1(X6)))&(((bcapacitysn(X6)|bcapacitysn(X6))|((gt(X6,X12)|uptakepg(X12))|(gt(X6,X11)|~(releaselg(X11)))))|~(epred1_1(X6))))&(((qilt27(X6)|bcapacitysn(X6))|((gt(X6,X12)|uptakepg(X12))|(gt(X6,X11)|~(releaselg(X11)))))|~(epred1_1(X6))))))&(((((~(gt(X6,X8))|conditionhyper(X8))|~(qilt27(X6)))|((gt(X6,X12)|uptakepg(X12))|(gt(X6,X11)|~(releaselg(X11)))))|~(epred1_1(X6)))&((((((gt(X6,X7)|bsecretioni(X7))|~(qilt27(X6)))|((gt(X6,X12)|uptakepg(X12))|(gt(X6,X11)|~(releaselg(X11)))))|~(epred1_1(X6)))&(((bcapacitysn(X6)|~(qilt27(X6)))|((gt(X6,X12)|uptakepg(X12))|(gt(X6,X11)|~(releaselg(X11)))))|~(epred1_1(X6))))&(((qilt27(X6)|~(qilt27(X6)))|((gt(X6,X12)|uptakepg(X12))|(gt(X6,X11)|~(releaselg(X11)))))|~(epred1_1(X6)))))))&((((((~(gt(X6,X8))|conditionhyper(X8))|(~(gt(X6,X10))|conditionhyper(X10)))|bcapacityne(X6))|~(epred1_1(X6)))&((((((gt(X6,X7)|bsecretioni(X7))|(~(gt(X6,X10))|conditionhyper(X10)))|bcapacityne(X6))|~(epred1_1(X6)))&(((bcapacitysn(X6)|(~(gt(X6,X10))|conditionhyper(X10)))|bcapacityne(X6))|~(epred1_1(X6))))&(((qilt27(X6)|(~(gt(X6,X10))|conditionhyper(X10)))|bcapacityne(X6))|~(epred1_1(X6)))))&(((((((~(gt(X6,X8))|conditionhyper(X8))|(gt(X6,X9)|~(releaselg(X9))))|bcapacityne(X6))|~(epred1_1(X6)))&((((((gt(X6,X7)|bsecretioni(X7))|(gt(X6,X9)|~(releaselg(X9))))|bcapacityne(X6))|~(epred1_1(X6)))&(((bcapacitysn(X6)|(gt(X6,X9)|~(releaselg(X9))))|bcapacityne(X6))|~(epred1_1(X6))))&(((qilt27(X6)|(gt(X6,X9)|~(releaselg(X9))))|bcapacityne(X6))|~(epred1_1(X6)))))&(((((~(gt(X6,X8))|conditionhyper(X8))|bcapacitysn(X6))|bcapacityne(X6))|~(epred1_1(X6)))&((((((gt(X6,X7)|bsecretioni(X7))|bcapacitysn(X6))|bcapacityne(X6))|~(epred1_1(X6)))&(((bcapacitysn(X6)|bcapacitysn(X6))|bcapacityne(X6))|~(epred1_1(X6))))&(((qilt27(X6)|bcapacitysn(X6))|bcapacityne(X6))|~(epred1_1(X6))))))&(((((~(gt(X6,X8))|conditionhyper(X8))|~(qilt27(X6)))|bcapacityne(X6))|~(epred1_1(X6)))&((((((gt(X6,X7)|bsecretioni(X7))|~(qilt27(X6)))|bcapacityne(X6))|~(epred1_1(X6)))&(((bcapacitysn(X6)|~(qilt27(X6)))|bcapacityne(X6))|~(epred1_1(X6))))&(((qilt27(X6)|~(qilt27(X6)))|bcapacityne(X6))|~(epred1_1(X6)))))))))),inference(distribute,[status(thm)],[296])).
% cnf(319,plain,(gt(X1,X2)|uptakepg(X3)|gt(X1,X3)|bcapacitysn(X1)|bcapacitysn(X1)|~epred1_1(X1)|~releaselg(X2)),inference(split_conjunct,[status(thm)],[297])).
% cnf(442,negated_conjecture,(gt(n0,X1)|~conditionhyper(X1)),inference(spm,[status(thm)],[83,293,theory(equality)])).
% cnf(452,plain,(uptakelg(X1)|releaselg(X1)),inference(spm,[status(thm)],[78,236,theory(equality)])).
% cnf(474,negated_conjecture,(epred1_1(X1)|conditionhyper(X2)|gt(n0,esk8_1(X1))|~gt(X1,X2)),inference(spm,[status(thm)],[163,293,theory(equality)])).
% cnf(514,negated_conjecture,(epred1_1(X1)|uptakepg(X2)|gt(X1,X2)|gt(n0,esk8_1(X1))),inference(spm,[status(thm)],[161,293,theory(equality)])).
% cnf(598,plain,(drugi(X1)|gt(X2,X1)|releaselg(esk17_1(X2))),inference(spm,[status(thm)],[215,452,theory(equality)])).
% cnf(652,plain,(uptakepg(X1)|bcapacitysn(X2)|gt(X2,X1)|gt(X2,esk17_1(X3))|drugi(X4)|gt(X3,X4)|~epred1_1(X2)),inference(spm,[status(thm)],[319,598,theory(equality)])).
% cnf(860,negated_conjecture,(epred1_1(X1)|conditionhyper(X2)|gt(n0,esk8_1(X1))|uptakepg(X2)),inference(spm,[status(thm)],[474,514,theory(equality)])).
% cnf(1303,negated_conjecture,(epred1_1(n0)|uptakepg(X1)|gt(n0,X1)|uptakepg(X2)|conditionhyper(X2)),inference(spm,[status(thm)],[162,860,theory(equality)])).
% cnf(1361,negated_conjecture,(epred1_1(n0)|uptakepg(X3)|conditionhyper(X3)|gt(n0,X3)),inference(ef,[status(thm)],[1303,theory(equality)])).
% cnf(1369,negated_conjecture,(epred1_1(n0)|uptakepg(X3)|conditionhyper(X3)),inference(csr,[status(thm)],[1361,292])).
% cnf(1370,negated_conjecture,(drugi(X1)|gt(X2,X1)|epred1_1(n0)|conditionhyper(esk18_1(X2))),inference(spm,[status(thm)],[213,1369,theory(equality)])).
% cnf(1437,negated_conjecture,(epred1_1(n0)|drugi(X1)|conditionhyper(esk18_1(X1))),inference(spm,[status(thm)],[78,1370,theory(equality)])).
% cnf(1451,negated_conjecture,(gt(n0,esk18_1(X1))|epred1_1(n0)|drugi(X1)),inference(spm,[status(thm)],[442,1437,theory(equality)])).
% cnf(1461,negated_conjecture,(drugi(X1)|gt(n0,X1)|epred1_1(n0)|drugi(n0)),inference(spm,[status(thm)],[214,1451,theory(equality)])).
% cnf(1462,negated_conjecture,(epred1_1(n0)|drugi(n0)|gt(n0,n0)),inference(ef,[status(thm)],[1461,theory(equality)])).
% cnf(1468,negated_conjecture,(epred1_1(n0)|drugi(n0)),inference(sr,[status(thm)],[1462,78,theory(equality)])).
% cnf(1470,negated_conjecture,(s3(n0)|epred1_1(n0)),inference(spm,[status(thm)],[261,1468,theory(equality)])).
% cnf(1471,negated_conjecture,(epred1_1(n0)|~s1(n0)),inference(spm,[status(thm)],[138,1470,theory(equality)])).
% cnf(1473,negated_conjecture,(epred1_1(n0)|$false),inference(rw,[status(thm)],[1471,291,theory(equality)])).
% cnf(1474,negated_conjecture,(epred1_1(n0)),inference(cn,[status(thm)],[1473,theory(equality)])).
% cnf(13964,negated_conjecture,(drugi(X1)|uptakepg(X2)|bcapacitysn(n0)|gt(n0,esk17_1(X3))|gt(X3,X1)|gt(n0,X2)),inference(spm,[status(thm)],[652,1474,theory(equality)])).
% cnf(13966,negated_conjecture,(drugi(X1)|uptakepg(X2)|gt(n0,esk17_1(X3))|gt(X3,X1)|gt(n0,X2)),inference(sr,[status(thm)],[13964,290,theory(equality)])).
% cnf(14020,negated_conjecture,(drugi(X1)|uptakepg(X2)|gt(n0,esk17_1(X1))|gt(n0,X2)),inference(spm,[status(thm)],[78,13966,theory(equality)])).
% cnf(14104,negated_conjecture,(drugi(X1)|gt(n0,X1)|drugi(n0)|uptakepg(X2)|gt(n0,X2)),inference(spm,[status(thm)],[216,14020,theory(equality)])).
% cnf(14154,negated_conjecture,(drugi(n0)|uptakepg(X3)|gt(n0,X3)|gt(n0,n0)),inference(ef,[status(thm)],[14104,theory(equality)])).
% cnf(14173,negated_conjecture,(drugi(n0)|uptakepg(X3)|gt(n0,X3)),inference(sr,[status(thm)],[14154,78,theory(equality)])).
% cnf(14188,negated_conjecture,(s3(n0)|uptakepg(X1)|gt(n0,X1)),inference(spm,[status(thm)],[261,14173,theory(equality)])).
% cnf(14189,negated_conjecture,(uptakepg(X1)|gt(n0,X1)|~s1(n0)),inference(spm,[status(thm)],[138,14188,theory(equality)])).
% cnf(14204,negated_conjecture,(uptakepg(X1)|gt(n0,X1)|$false),inference(rw,[status(thm)],[14189,291,theory(equality)])).
% cnf(14205,negated_conjecture,(uptakepg(X1)|gt(n0,X1)),inference(cn,[status(thm)],[14204,theory(equality)])).
% cnf(14206,negated_conjecture,(drugi(X1)|gt(X2,X1)|gt(n0,esk18_1(X2))),inference(spm,[status(thm)],[213,14205,theory(equality)])).
% cnf(14275,negated_conjecture,(drugi(X1)|gt(n0,esk18_1(X1))),inference(spm,[status(thm)],[78,14206,theory(equality)])).
% cnf(14346,negated_conjecture,(drugi(X1)|gt(n0,X1)|drugi(n0)),inference(spm,[status(thm)],[214,14275,theory(equality)])).
% cnf(14370,negated_conjecture,(drugi(n0)|gt(n0,n0)),inference(ef,[status(thm)],[14346,theory(equality)])).
% cnf(14376,negated_conjecture,(drugi(n0)),inference(sr,[status(thm)],[14370,78,theory(equality)])).
% cnf(14378,negated_conjecture,(s3(n0)),inference(spm,[status(thm)],[261,14376,theory(equality)])).
% cnf(14379,negated_conjecture,(~s1(n0)),inference(spm,[status(thm)],[138,14378,theory(equality)])).
% cnf(14381,negated_conjecture,($false),inference(rw,[status(thm)],[14379,291,theory(equality)])).
% cnf(14382,negated_conjecture,($false),inference(cn,[status(thm)],[14381,theory(equality)])).
% cnf(14383,negated_conjecture,($false),14382,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1294
% # ...of these trivial : 12
% # ...subsumed : 308
% # ...remaining for further processing: 974
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 116
% # Backward-rewritten : 27
% # Generated clauses : 12560
% # ...of the previous two non-trivial : 12211
% # Contextual simplify-reflections : 431
% # Paramodulations : 12528
% # Factorizations : 32
% # Equation resolutions : 0
% # Current number of processed clauses: 711
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 699
% # Current number of unprocessed clauses: 9082
% # ...number of literals in the above : 62999
% # Clause-clause subsumption calls (NU) : 20588
% # Rec. Clause-clause subsumption calls : 6205
% # Unit Clause-clause subsumption calls : 416
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 282 leaves, 1.73+/-2.044 terms/leaf
% # Paramod-from index: 101 leaves, 1.86+/-2.621 terms/leaf
% # Paramod-into index: 210 leaves, 1.77+/-2.153 terms/leaf
% # -------------------------------------------------
% # User time : 0.718 s
% # System time : 0.017 s
% # Total time : 0.735 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.01 CPU 1.10 WC
% FINAL PrfWatch: 1.01 CPU 1.10 WC
% SZS output end Solution for /tmp/SystemOnTPTP17635/MED008+1.tptp
%
%------------------------------------------------------------------------------