%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : MED001+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:25:08 PM UTC 2026
% Result : Theorem 0.24s 5.60s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 4
% Syntax : Number of formulae : 42 ( 6 unt; 0 def)
% Number of atoms : 199 ( 0 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 231 ( 74 ~; 105 |; 26 &)
% ( 0 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 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 : 70 ( 0 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(treatmentsn2,conjecture,
( ( qilt27(n0)
& bcapacitysn(n0)
& ! [X4] :
( gt(n0,X4)
=> conditionhyper(X4) )
& ! [X4] :
( ~ gt(n0,X4)
=> drugsu(X4) ) )
=> ! [X4] :
( ~ gt(n0,X4)
=> conditionnormo(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',treatmentsn2) ).
fof(sulfonylurea_effect,axiom,
! [X4] :
( ( ~ bcapacityex(X4)
& ! [X5] :
( ~ gt(X4,X5)
=> drugsu(X5) ) )
=> ! [X5] :
( ~ gt(X4,X5)
=> bsecretioni(X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MED001+0.ax',sulfonylurea_effect) ).
fof(xorcapacity4,axiom,
! [X4] :
( ~ bcapacitysn(X4)
| ~ bcapacityex(X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/MED001+0.ax',xorcapacity4) ).
fof(sn_cure_1,axiom,
! [X4] :
( ( ! [X5] :
( gt(X4,X5)
=> conditionhyper(X5) )
& qilt27(X4)
& bcapacitysn(X4)
& ! [X5] :
( ~ gt(X4,X5)
=> bsecretioni(X5) ) )
=> ! [X5] :
( ~ gt(X4,X5)
=> conditionnormo(X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/MED001+0.ax',sn_cure_1) ).
fof(c_0_4,negated_conjecture,
~ ( ( qilt27(n0)
& bcapacitysn(n0)
& ! [X4] :
( gt(n0,X4)
=> conditionhyper(X4) )
& ! [X4] :
( ~ gt(n0,X4)
=> drugsu(X4) ) )
=> ! [X4] :
( ~ gt(n0,X4)
=> conditionnormo(X4) ) ),
inference(assume_negation,[status(cth)],[treatmentsn2]) ).
fof(c_0_5,plain,
! [X4] :
( ( ~ bcapacityex(X4)
& ! [X5] :
( ~ gt(X4,X5)
=> drugsu(X5) ) )
=> ! [X5] :
( ~ gt(X4,X5)
=> bsecretioni(X5) ) ),
inference(fof_simplification,[status(thm)],[sulfonylurea_effect]) ).
fof(c_0_6,negated_conjecture,
~ ( ( qilt27(n0)
& bcapacitysn(n0)
& ! [X4] :
( gt(n0,X4)
=> conditionhyper(X4) )
& ! [X4] :
( ~ gt(n0,X4)
=> drugsu(X4) ) )
=> ! [X4] :
( ~ gt(n0,X4)
=> conditionnormo(X4) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_7,plain,
! [X4] :
( ~ bcapacitysn(X4)
| ~ bcapacityex(X4) ),
inference(fof_simplification,[status(thm)],[xorcapacity4]) ).
fof(c_0_8,plain,
! [X25,X27] :
( ( bsecretioni(X27)
| gt(X25,X27)
| bcapacityex(X25)
| ~ drugsu(esk6_1(X25)) )
& ( bsecretioni(X27)
| gt(X25,X27)
| bcapacityex(X25)
| ~ gt(X25,esk6_1(X25)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])]) ).
fof(c_0_9,negated_conjecture,
! [X6,X7] :
( ~ conditionnormo(esk1_0)
& ~ gt(n0,esk1_0)
& qilt27(n0)
& bcapacitysn(n0)
& ( conditionhyper(X7)
| ~ gt(n0,X7) )
& ( drugsu(X6)
| gt(n0,X6) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
fof(c_0_10,plain,
! [X24] :
( ~ bcapacitysn(X24)
| ~ bcapacityex(X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_7])]) ).
cnf(c_0_11,plain,
( ~ drugsu(esk6_1(X1))
| bsecretioni(X2)
| gt(X1,X2)
| bcapacityex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( drugsu(X1)
| gt(n0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( ~ bcapacitysn(X1)
| ~ bcapacityex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
bcapacitysn(n0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X4] :
( ( ! [X5] :
( gt(X4,X5)
=> conditionhyper(X5) )
& qilt27(X4)
& bcapacitysn(X4)
& ! [X5] :
( ~ gt(X4,X5)
=> bsecretioni(X5) ) )
=> ! [X5] :
( ~ gt(X4,X5)
=> conditionnormo(X5) ) ),
inference(fof_simplification,[status(thm)],[sn_cure_1]) ).
cnf(c_0_16,plain,
( ~ gt(X1,esk6_1(X1))
| bsecretioni(X2)
| gt(X1,X2)
| bcapacityex(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
( gt(X2,X1)
| gt(n0,esk6_1(X2))
| bcapacityex(X2)
| bsecretioni(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
~ bcapacityex(n0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_19,plain,
! [X14,X17] :
( ( conditionnormo(X17)
| gt(X14,X17)
| ~ qilt27(X14)
| ~ bcapacitysn(X14)
| ~ bsecretioni(esk2_1(X14))
| ~ conditionhyper(esk3_1(X14)) )
& ( conditionnormo(X17)
| gt(X14,X17)
| ~ qilt27(X14)
| ~ bcapacitysn(X14)
| ~ bsecretioni(esk2_1(X14))
| gt(X14,esk3_1(X14)) )
& ( conditionnormo(X17)
| gt(X14,X17)
| ~ qilt27(X14)
| ~ bcapacitysn(X14)
| ~ gt(X14,esk2_1(X14))
| ~ conditionhyper(esk3_1(X14)) )
& ( conditionnormo(X17)
| gt(X14,X17)
| ~ qilt27(X14)
| ~ bcapacitysn(X14)
| ~ gt(X14,esk2_1(X14))
| gt(X14,esk3_1(X14)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])])]) ).
cnf(c_0_20,negated_conjecture,
( gt(n0,X2)
| gt(n0,X1)
| bsecretioni(X2)
| bsecretioni(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_21,plain,
( ~ qilt27(X1)
| ~ bcapacitysn(X1)
| ~ bsecretioni(esk2_1(X1))
| conditionnormo(X2)
| gt(X1,X2)
| gt(X1,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( gt(n0,X1)
| bsecretioni(X1) ),
inference(ef,[status(thm)],[c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( ~ bcapacitysn(X2)
| ~ qilt27(X2)
| gt(X2,X1)
| gt(X2,esk3_1(X2))
| gt(n0,esk2_1(X2))
| conditionnormo(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
qilt27(n0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,plain,
( ~ qilt27(X1)
| ~ bcapacitysn(X1)
| ~ bsecretioni(esk2_1(X1))
| ~ conditionhyper(esk3_1(X1))
| conditionnormo(X2)
| gt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( ~ qilt27(X1)
| ~ bcapacitysn(X1)
| ~ gt(X1,esk2_1(X1))
| conditionnormo(X2)
| gt(X1,X2)
| gt(X1,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,negated_conjecture,
( gt(n0,X1)
| gt(n0,esk2_1(n0))
| gt(n0,esk3_1(n0))
| conditionnormo(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_14])]) ).
cnf(c_0_28,negated_conjecture,
( ~ bcapacitysn(X2)
| ~ conditionhyper(esk3_1(X2))
| ~ qilt27(X2)
| gt(X2,X1)
| gt(n0,esk2_1(X2))
| conditionnormo(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( ~ gt(n0,X1)
| conditionhyper(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_30,negated_conjecture,
( gt(n0,X2)
| gt(n0,X1)
| gt(n0,esk3_1(n0))
| conditionnormo(X2)
| conditionnormo(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24]),c_0_14])]) ).
cnf(c_0_31,negated_conjecture,
( ~ gt(n0,esk3_1(X2))
| ~ bcapacitysn(X2)
| ~ qilt27(X2)
| gt(X2,X1)
| gt(n0,esk2_1(X2))
| conditionnormo(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( gt(n0,X1)
| gt(n0,esk3_1(n0))
| conditionnormo(X1) ),
inference(ef,[status(thm)],[c_0_30]) ).
cnf(c_0_33,negated_conjecture,
( gt(n0,X2)
| gt(n0,X1)
| gt(n0,esk2_1(n0))
| conditionnormo(X2)
| conditionnormo(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_24]),c_0_14])]) ).
cnf(c_0_34,plain,
( ~ qilt27(X1)
| ~ bcapacitysn(X1)
| ~ gt(X1,esk2_1(X1))
| ~ conditionhyper(esk3_1(X1))
| conditionnormo(X2)
| gt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_35,negated_conjecture,
( gt(n0,X1)
| gt(n0,esk2_1(n0))
| conditionnormo(X1) ),
inference(ef,[status(thm)],[c_0_33]) ).
cnf(c_0_36,negated_conjecture,
( ~ conditionhyper(esk3_1(n0))
| gt(n0,X2)
| gt(n0,X1)
| conditionnormo(X2)
| conditionnormo(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_24]),c_0_14])]) ).
cnf(c_0_37,negated_conjecture,
( gt(n0,X2)
| gt(n0,X1)
| conditionnormo(X2)
| conditionnormo(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_29]),c_0_32]) ).
cnf(c_0_38,negated_conjecture,
~ conditionnormo(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_39,negated_conjecture,
( gt(n0,X1)
| conditionnormo(X1) ),
inference(ef,[status(thm)],[c_0_37]) ).
cnf(c_0_40,negated_conjecture,
~ gt(n0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : MED001+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/5.52 % Computer : n015.cluster.edu
% 0.19/5.52 % Model : x86_64 x86_64
% 0.19/5.52 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.52 % Memory : 8046.5625MB
% 0.19/5.52 % OS : Linux 6.8.0-71-generic
% 0.19/5.52 % CPULimit : 300
% 0.19/5.52 % WCLimit : 300
% 0.19/5.52 % DateTime : Mon Sep 21 01:23:13 UTC 2026
% 0.19/5.53 % CPUTime :
% 0.19/5.53 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/5.57 Running first-order theorem proving
% 0.19/5.57 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.24/5.60 % Version: 3.5.1
% 0.24/5.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/5.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/5.60 % Starting new_bool_3 with 300s (1) cores
% 0.24/5.60 % Starting new_bool_1 with 300s (1) cores
% 0.24/5.60 % Starting sh5l with 300s (1) cores
% 0.24/5.60 % new_bool_3 with pid 248412 completed with status 0
% 0.24/5.60 % Result found by new_bool_3
% 0.24/5.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/5.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/5.60 % Starting new_bool_3 with 300s (1) cores
% 0.24/5.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/5.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/5.60 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.24/5.60 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/5.60 % Starting SubtermCWHack with 31s (1) cores
% 0.24/5.60 % SubtermCWHack with pid 248417 completed with status 0
% 0.24/5.60 % Result found by SubtermCWHack
% 0.24/5.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/5.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/5.60 % Starting new_bool_3 with 300s (1) cores
% 0.24/5.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/5.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/5.60 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.24/5.60 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/5.60 % Starting SubtermCWHack with 31s (1) cores
% 0.24/5.60 % Preprocessing time : 0.002 s
% 0.24/5.60
% 0.24/5.60 % Proof found!
% 0.24/5.60 % SZS status Theorem
% 0.24/5.60 % SZS output start CNFRefutation
% See solution above
% 0.24/5.60 % Parsed axioms : 19
% 0.24/5.60 % Removed by relevancy pruning/SinE : 5
% 0.24/5.60 % Initial clauses : 48
% 0.24/5.60 % Removed in clause preprocessing : 0
% 0.24/5.60 % Initial clauses in saturation : 48
% 0.24/5.60 % Processed clauses : 67
% 0.24/5.60 % ...of these trivial : 0
% 0.24/5.60 % ...subsumed : 3
% 0.24/5.60 % ...remaining for further processing : 64
% 0.24/5.60 % Other redundant clauses eliminated : 0
% 0.24/5.60 % Clauses deleted for lack of memory : 0
% 0.24/5.60 % Backward-subsumed : 11
% 0.24/5.60 % Backward-rewritten : 0
% 0.24/5.60 % Generated clauses : 83
% 0.24/5.60 % ...of the previous two non-redundant : 69
% 0.24/5.60 % ...aggressively subsumed : 0
% 0.24/5.60 % Contextual simplify-reflections : 1
% 0.24/5.60 % Paramodulations : 73
% 0.24/5.60 % Factorizations : 10
% 0.24/5.60 % NegExts : 0
% 0.24/5.60 % Equation resolutions : 0
% 0.24/5.60 % Disequality decompositions : 0
% 0.24/5.60 % Total rewrite steps : 16
% 0.24/5.60 % ...of those cached : 13
% 0.24/5.60 % Propositional unsat checks : 0
% 0.24/5.60 % Propositional check models : 0
% 0.24/5.60 % Propositional check unsatisfiable : 0
% 0.24/5.60 % Propositional clauses : 0
% 0.24/5.60 % Propositional clauses after purity: 0
% 0.24/5.60 % Propositional unsat core size : 0
% 0.24/5.60 % Propositional preprocessing time : 0.000
% 0.24/5.60 % Propositional encoding time : 0.000
% 0.24/5.60 % Propositional solver time : 0.000
% 0.24/5.60 % Success case prop preproc time : 0.000
% 0.24/5.60 % Success case prop encoding time : 0.000
% 0.24/5.60 % Success case prop solver time : 0.000
% 0.24/5.60 % Current number of processed clauses : 53
% 0.24/5.60 % Positive orientable unit clauses : 3
% 0.24/5.60 % Positive unorientable unit clauses: 0
% 0.24/5.60 % Negative unit clauses : 5
% 0.24/5.60 % Non-unit-clauses : 45
% 0.24/5.60 % Current number of unprocessed clauses: 45
% 0.24/5.60 % ...number of literals in the above : 299
% 0.24/5.60 % Current number of archived formulas : 0
% 0.24/5.60 % Current number of archived clauses : 11
% 0.24/5.60 % Clause-clause subsumption calls (NU) : 1268
% 0.24/5.60 % Rec. Clause-clause subsumption calls : 142
% 0.24/5.60 % Non-unit clause-clause subsumptions : 14
% 0.24/5.60 % Unit Clause-clause subsumption calls : 13
% 0.24/5.60 % Rewrite failures with RHS unbound : 0
% 0.24/5.60 % BW rewrite match attempts : 1
% 0.24/5.60 % BW rewrite match successes : 1
% 0.24/5.60 % Condensation attempts : 0
% 0.24/5.60 % Condensation successes : 0
% 0.24/5.60 % Termbank termtop insertions : 5382
% 0.24/5.60 % Search garbage collected termcells : 782
% 0.24/5.60
% 0.24/5.60 % -------------------------------------------------
% 0.24/5.60 % User time : 0.011 s
% 0.24/5.60 % System time : 0.004 s
% 0.24/5.60 % Total time : 0.015 s
% 0.24/5.60 % Maximum resident set size: 3652 pages
% 0.24/5.60
% 0.24/5.60 % -------------------------------------------------
% 0.24/5.60 % User time : 0.013 s
% 0.24/5.60 % System time : 0.008 s
% 0.24/5.60 % Total time : 0.021 s
% 0.24/5.60 % Maximum resident set size: 4864 pages
% 0.24/5.60 % E exiting
%------------------------------------------------------------------------------