%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : MED001+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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 : Sun Jul 17 19:22:36 EDT 2022
% Result : Theorem 7.04s 2.30s
% Output : CNFRefutation 7.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of clauses : 42 ( 10 unt; 28 nHn; 14 RR)
% Number of literals : 145 ( 0 equ; 52 neg)
% Maximal clause size : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 53 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_41,plain,
( bcapacityex(X1)
| bsecretioni(X2)
| gt(X1,X2)
| ~ drugsu(esk14_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uc5h9kdd/input.p',i_0_41) ).
cnf(i_0_49,negated_conjecture,
( drugsu(X1)
| gt(n0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uc5h9kdd/input.p',i_0_49) ).
cnf(i_0_53,plain,
( ~ bcapacityex(X1)
| ~ bcapacitysn(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uc5h9kdd/input.p',i_0_53) ).
cnf(i_0_47,negated_conjecture,
bcapacitysn(n0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uc5h9kdd/input.p',i_0_47) ).
cnf(i_0_42,plain,
( bcapacityex(X1)
| bsecretioni(X2)
| gt(X1,X2)
| ~ gt(X1,esk14_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uc5h9kdd/input.p',i_0_42) ).
cnf(i_0_34,plain,
( conditionnormo(X1)
| gt(X2,X1)
| gt(X2,esk11_1(X2))
| ~ bcapacitysn(X2)
| ~ qilt27(X2)
| ~ bsecretioni(esk10_1(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uc5h9kdd/input.p',i_0_34) ).
cnf(i_0_46,negated_conjecture,
qilt27(n0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uc5h9kdd/input.p',i_0_46) ).
cnf(i_0_33,plain,
( conditionnormo(X1)
| gt(X2,X1)
| ~ bcapacitysn(X2)
| ~ qilt27(X2)
| ~ conditionhyper(esk11_1(X2))
| ~ bsecretioni(esk10_1(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uc5h9kdd/input.p',i_0_33) ).
cnf(i_0_36,plain,
( conditionnormo(X1)
| gt(X2,X1)
| gt(X2,esk11_1(X2))
| ~ bcapacitysn(X2)
| ~ qilt27(X2)
| ~ gt(X2,esk10_1(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uc5h9kdd/input.p',i_0_36) ).
cnf(i_0_48,negated_conjecture,
( conditionhyper(X1)
| ~ gt(n0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uc5h9kdd/input.p',i_0_48) ).
cnf(i_0_35,plain,
( conditionnormo(X1)
| gt(X2,X1)
| ~ bcapacitysn(X2)
| ~ qilt27(X2)
| ~ conditionhyper(esk11_1(X2))
| ~ gt(X2,esk10_1(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uc5h9kdd/input.p',i_0_35) ).
cnf(i_0_44,negated_conjecture,
~ conditionnormo(esk15_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uc5h9kdd/input.p',i_0_44) ).
cnf(i_0_45,negated_conjecture,
~ gt(n0,esk15_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uc5h9kdd/input.p',i_0_45) ).
cnf(c_0_67,plain,
( bcapacityex(X1)
| bsecretioni(X2)
| gt(X1,X2)
| ~ drugsu(esk14_1(X1)) ),
i_0_41 ).
cnf(c_0_68,negated_conjecture,
( drugsu(X1)
| gt(n0,X1) ),
i_0_49 ).
cnf(c_0_69,plain,
( ~ bcapacityex(X1)
| ~ bcapacitysn(X1) ),
i_0_53 ).
cnf(c_0_70,negated_conjecture,
bcapacitysn(n0),
i_0_47 ).
cnf(c_0_71,plain,
( bcapacityex(X1)
| bsecretioni(X2)
| gt(X1,X2)
| ~ gt(X1,esk14_1(X1)) ),
i_0_42 ).
cnf(c_0_72,negated_conjecture,
( bsecretioni(X1)
| bcapacityex(X2)
| gt(n0,esk14_1(X2))
| gt(X2,X1) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_73,negated_conjecture,
~ bcapacityex(n0),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_74,plain,
( bsecretioni(X1)
| bsecretioni(X2)
| gt(n0,X1)
| gt(n0,X2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]) ).
cnf(c_0_75,plain,
( conditionnormo(X1)
| gt(X2,X1)
| gt(X2,esk11_1(X2))
| ~ bcapacitysn(X2)
| ~ qilt27(X2)
| ~ bsecretioni(esk10_1(X2)) ),
i_0_34 ).
cnf(c_0_76,plain,
( bsecretioni(X1)
| gt(n0,X1) ),
inference(ef,[status(thm)],[c_0_74]) ).
cnf(c_0_77,plain,
( gt(n0,esk10_1(X1))
| gt(X1,esk11_1(X1))
| gt(X1,X2)
| conditionnormo(X2)
| ~ qilt27(X1)
| ~ bcapacitysn(X1) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_78,negated_conjecture,
qilt27(n0),
i_0_46 ).
cnf(c_0_79,plain,
( conditionnormo(X1)
| gt(X2,X1)
| ~ bcapacitysn(X2)
| ~ qilt27(X2)
| ~ conditionhyper(esk11_1(X2))
| ~ bsecretioni(esk10_1(X2)) ),
i_0_33 ).
cnf(c_0_80,plain,
( conditionnormo(X1)
| gt(X2,X1)
| gt(X2,esk11_1(X2))
| ~ bcapacitysn(X2)
| ~ qilt27(X2)
| ~ gt(X2,esk10_1(X2)) ),
i_0_36 ).
cnf(c_0_81,negated_conjecture,
( gt(n0,esk11_1(n0))
| gt(n0,esk10_1(n0))
| gt(n0,X1)
| conditionnormo(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_70])]) ).
cnf(c_0_82,plain,
( gt(n0,esk10_1(X1))
| gt(X1,X2)
| conditionnormo(X2)
| ~ conditionhyper(esk11_1(X1))
| ~ qilt27(X1)
| ~ bcapacitysn(X1) ),
inference(spm,[status(thm)],[c_0_79,c_0_76]) ).
cnf(c_0_83,negated_conjecture,
( conditionhyper(X1)
| ~ gt(n0,X1) ),
i_0_48 ).
cnf(c_0_84,plain,
( gt(n0,esk11_1(n0))
| gt(n0,X1)
| gt(n0,X2)
| conditionnormo(X1)
| conditionnormo(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_78]),c_0_70])]) ).
cnf(c_0_85,negated_conjecture,
( gt(n0,esk10_1(X1))
| gt(X1,X2)
| conditionnormo(X2)
| ~ gt(n0,esk11_1(X1))
| ~ qilt27(X1)
| ~ bcapacitysn(X1) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_86,plain,
( gt(n0,esk11_1(n0))
| gt(n0,X1)
| conditionnormo(X1) ),
inference(ef,[status(thm)],[c_0_84]) ).
cnf(c_0_87,negated_conjecture,
( gt(n0,esk10_1(n0))
| gt(n0,X1)
| gt(n0,X2)
| conditionnormo(X1)
| conditionnormo(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_78]),c_0_70])]) ).
cnf(c_0_88,plain,
( conditionnormo(X1)
| gt(X2,X1)
| ~ bcapacitysn(X2)
| ~ qilt27(X2)
| ~ conditionhyper(esk11_1(X2))
| ~ gt(X2,esk10_1(X2)) ),
i_0_35 ).
cnf(c_0_89,negated_conjecture,
( gt(n0,esk10_1(n0))
| gt(n0,X1)
| conditionnormo(X1) ),
inference(ef,[status(thm)],[c_0_87]) ).
cnf(c_0_90,plain,
( gt(n0,X1)
| gt(n0,X2)
| conditionnormo(X1)
| conditionnormo(X2)
| ~ conditionhyper(esk11_1(n0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_78]),c_0_70])]) ).
cnf(c_0_91,negated_conjecture,
( gt(n0,X1)
| gt(n0,X2)
| conditionnormo(X1)
| conditionnormo(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_83]),c_0_86]) ).
cnf(c_0_92,negated_conjecture,
~ conditionnormo(esk15_0),
i_0_44 ).
cnf(c_0_93,negated_conjecture,
( gt(n0,X1)
| conditionnormo(X1) ),
inference(ef,[status(thm)],[c_0_91]) ).
cnf(c_0_94,negated_conjecture,
~ gt(n0,esk15_0),
i_0_45 ).
cnf(c_0_95,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_94]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MED001+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n026.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Tue Jul 5 01:52:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.04/2.30 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.04/2.30 # Version: 2.1pre011
% 7.04/2.30 # Preprocessing time : 0.010 s
% 7.04/2.30
% 7.04/2.30 # Proof found!
% 7.04/2.30 # SZS status Theorem
% 7.04/2.30 # SZS output start CNFRefutation
% See solution above
% 7.04/2.30 # Proof object total steps : 42
% 7.04/2.30 # Proof object clause steps : 29
% 7.04/2.30 # Proof object formula steps : 13
% 7.04/2.30 # Proof object conjectures : 21
% 7.04/2.30 # Proof object clause conjectures : 15
% 7.04/2.30 # Proof object formula conjectures : 6
% 7.04/2.30 # Proof object initial clauses used : 13
% 7.04/2.30 # Proof object initial formulas used : 13
% 7.04/2.30 # Proof object generating inferences : 16
% 7.04/2.30 # Proof object simplifying inferences : 14
% 7.04/2.30 # Training examples: 0 positive, 0 negative
% 7.04/2.30 # Parsed axioms : 57
% 7.04/2.30 # Removed by relevancy pruning/SinE : 0
% 7.04/2.30 # Initial clauses : 57
% 7.04/2.30 # Removed in clause preprocessing : 0
% 7.04/2.30 # Initial clauses in saturation : 57
% 7.04/2.30 # Processed clauses : 111
% 7.04/2.30 # ...of these trivial : 0
% 7.04/2.30 # ...subsumed : 11
% 7.04/2.30 # ...remaining for further processing : 100
% 7.04/2.30 # Other redundant clauses eliminated : 0
% 7.04/2.30 # Clauses deleted for lack of memory : 0
% 7.04/2.30 # Backward-subsumed : 16
% 7.04/2.30 # Backward-rewritten : 0
% 7.04/2.30 # Generated clauses : 185
% 7.04/2.30 # ...of the previous two non-trivial : 155
% 7.04/2.30 # Contextual simplify-reflections : 5
% 7.04/2.30 # Paramodulations : 135
% 7.04/2.30 # Factorizations : 50
% 7.04/2.30 # Equation resolutions : 0
% 7.04/2.30 # Propositional unsat checks : 0
% 7.04/2.30 # Propositional unsat check successes : 0
% 7.04/2.30 # Current number of processed clauses : 84
% 7.04/2.30 # Positive orientable unit clauses : 3
% 7.04/2.30 # Positive unorientable unit clauses: 0
% 7.04/2.30 # Negative unit clauses : 5
% 7.04/2.30 # Non-unit-clauses : 76
% 7.04/2.30 # Current number of unprocessed clauses: 66
% 7.04/2.30 # ...number of literals in the above : 437
% 7.04/2.30 # Current number of archived formulas : 0
% 7.04/2.30 # Current number of archived clauses : 16
% 7.04/2.30 # Clause-clause subsumption calls (NU) : 2677
% 7.04/2.30 # Rec. Clause-clause subsumption calls : 218
% 7.04/2.30 # Non-unit clause-clause subsumptions : 31
% 7.04/2.30 # Unit Clause-clause subsumption calls : 81
% 7.04/2.30 # Rewrite failures with RHS unbound : 0
% 7.04/2.30 # BW rewrite match attempts : 1
% 7.04/2.30 # BW rewrite match successes : 1
% 7.04/2.30 # Condensation attempts : 0
% 7.04/2.30 # Condensation successes : 0
% 7.04/2.30 # Termbank termtop insertions : 5857
% 7.04/2.30
% 7.04/2.30 # -------------------------------------------------
% 7.04/2.30 # User time : 0.015 s
% 7.04/2.30 # System time : 0.001 s
% 7.04/2.30 # Total time : 0.016 s
% 7.04/2.30 # ...preprocessing : 0.010 s
% 7.04/2.30 # ...main loop : 0.006 s
% 7.04/2.30 # Maximum resident set size: 7136 pages
% 7.04/2.30
%------------------------------------------------------------------------------