%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : MED009+1 : TPTP v9.2.1. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n006.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 May 7 07:28:42 PM UTC 2026
% Result : Theorem 0.39s 0.80s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : MED009+1 : TPTP v9.2.1. Released v3.2.0.
% 0.11/0.14 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.35 % Computer : n006.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Thu May 7 12:41:32 EDT 2026
% 0.16/0.35 % CPUTime :
% 0.16/0.35 SPASS-SCL-FOL version:
% 0.19/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.39/0.80 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.80 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.80 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.80 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.80 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.80 Execution resolution_1 ended with status: unsatisfiable
% 0.39/0.80 Used heuristic: resolution_1
% 0.39/0.80
% 0.39/0.80 Input Clauses:
% 0.39/0.80
% 0.39/0.80 Predicates: gt bcapacityne bcapacityex bcapacitysn conditionhyper conditionhypo conditionnormo drugi uptakelg uptakepg releaselg drugsu bsecretioni drugbg qilt27 s0 s1 s2 s3 qillt27 ren1 ren2 ren3 ren4 ren5 ren6 ren7 ren8 ren9 ren10 ren11 ren12 ren13 ren14 ren15 ren16 ren17 ren18 ren19 ren20 ren21 ren22 ren23 ren24 ren25 ren26 ren27 ren28 ren29 ren30 ren31 ren32
% 0.39/0.80 Fol Constants: n0
% 0.39/0.80 Fol Functions: skf1 skf2 skf3 skf4 skf5 skf6 skf7 skf8 skf9 skf10 skf11 skf12 skf13 skf14 skf15 skf16 skf17 skf18 skf19 skf20 skf21 skf22 skf23
% 0.39/0.80 Problem Properties:
% 0.39/0.80 This is a full first-order problem without equality.
% 0.39/0.80
% 0.39/0.80 After reduction: Problem Properties:
% 0.39/0.80 This is a full first-order problem without equality.
% 0.39/0.80
% 0.39/0.80
% 0.39/0.80 Reduced Input Clauses:
% 0.39/0.80 127:2:1:[80.0,82.1]:Top: s3(x0) -> drugi(x0)
% 0.39/0.80
% 0.39/0.80 Most General Atoms: bcapacitysn(x0) ren1(x1,x0) ren2(x1) gt(x1,x0) ren3(x1,x0) ren4(x1,x0) releaselg(x1) bsecretioni(x0) ren5(x1,x0) ren6(x1,x0) qilt27(x0) conditionnormo(x1) ren7(x1,x0) ren8(x1,x0) ren9(x0) ren10(x1,x0) ren11(x1,x0) ren12(x1,x0) ren13(x1,x0) ren14(x1,x0) conditionhypo(x1) s0(x0) ren15(x1,x0) ren16(x0) ren17(x0) ren18(x0) ren19(x0) uptakelg(x1) uptakepg(x1) ren20(x0) ren21(x0) ren22(x0) ren23(x0) qillt27(x0) ren24(x0) drugi(x1) ren25(x1,x0) ren26(x0) drugsu(x1) ren27(x1,x0) drugbg(x1) ren28(x0,x1) s1(x1) conditionhyper(x2) ren29(x0,x1) s2(x1) bcapacityne(x1) bcapacityex(x1) ren30(x0,x1) s3(x1) ren31(x1,x0) ren32(x0)
% 0.39/0.80
% 0.39/0.80 === Starting SPASS-SCL-FOL A Little Less Naive, considering 52 atoms initially, heuristics mode: resolution_1 ===
% 0.39/0.80
% 0.39/0.80 === Backtracking. Learning clause 128:1:0:[50.2,122.1]:: s0(n0) ->
% 0.39/0.80 === Backtracking. Learning clause 129:2:1:[16.3,1.1]:Top: uptakelg(x0),releaselg(x0) ->
% 0.39/0.80 === Conflict found: 129:2:1:[16.3,1.1]:Top: uptakelg(x0),releaselg(x0) -> {x0 -> skf8(n0)}
% 0.39/0.80 === Backtracking. Learning clause 130:2:1:[129.2,34.1]:Top: uptakelg(skf8(x0)) -> ren9(x0)
% 0.39/0.80 === Backtracking. Learning clause 131:3:2:[12.2,15.1]:TopTop: drugi(skf1(x0)) -> gt(x0,x1),ren2(x1)
% 0.39/0.80 === Backtracking. Learning clause 132:3:2:[11.2,15.1]:TopTop: gt(x0,skf1(x0)) -> gt(x0,x1),ren2(x1)
% 0.39/0.80 === Backtracking. Learning clause 133:4:2:[18.2,19.1]:TopTop: drugsu(skf2(x0)) -> bcapacityex(x0),gt(x0,x1),bsecretioni(x1)
% 0.39/0.80 === Backtracking. Learning clause 134:4:2:[17.2,19.1]:TopTop: gt(x0,skf2(x0)) -> bcapacityex(x0),gt(x0,x1),bsecretioni(x1)
% 0.39/0.80 === Backtracking. Learning clause 136:2:1:[34.0,135.0,22.1,21.2,33.1]:Top: drugbg(skf3(x0)) -> ren9(x0)
% 0.39/0.80 === Backtracking. Learning clause 138:2:1:[34.0,137.0,22.1,20.2,33.1]:Top: gt(x0,skf3(x0)) -> ren9(x0)
% 0.39/0.80 === Clause set with instances from active satisfied. Growing active. New size: 117
% 0.39/0.80 === Restarting.
% 0.39/0.80 === Backtracking. Learning clause 139:2:0:[3.3,124.1]:: -> bcapacityne(n0),bcapacityex(n0)
% 0.39/0.80 === Backtracking. Learning clause 140:1:0:[76.1,122.1,125.1]:: -> drugbg(n0)
% 0.39/0.80 === Backtracking. Learning clause 141:4:1:[87.1,88.2]:Top: drugsu(x0) -> qillt27(x0),s2(x0),s3(x0)
% 0.39/0.80 === Backtracking. Learning clause 142:3:2:[20.2,22.1]:TopTop: gt(x0,skf3(x0)),releaselg(x1) -> gt(x0,x1)
% 0.39/0.80 === Backtracking. Learning clause 143:7:2:[48.4,47.2]:TopTop: ren12(x0,skf12(x0)),ren13(x0,skf13(x0)),bcapacityex(x0),conditionhyper(skf14(x0)) -> gt(x0,x1),conditionnormo(x1),conditionhypo(x1)
% 0.39/0.80 === Backtracking. Learning clause 144:5:1:[56.2,74.1]:Top: gt(x0,skf15(x0)) -> ren16(x0),ren17(x0),ren18(x0),ren19(x0)
% 0.39/0.80 === Backtracking. Learning clause 145:4:2:[103.1,102.2,142.1]:TopTop: releaselg(x0) -> drugbg(skf3(x1)),releaselg(skf19(x1)),gt(x1,x0)
% 0.39/0.80 === Backtracking. Learning clause 146:3:2:[21.2,22.1,145.2]:TopTop: releaselg(x0) -> releaselg(skf19(x1)),gt(x1,x0)
% 0.39/0.80 === Backtracking. Learning clause 147:3:2:[101.2,103.1]:TopTop: gt(x0,skf19(x0)) -> gt(x0,x1),drugbg(x1)
% 0.39/0.80 === Backtracking. Learning clause 148:4:2:[108.1,112.4]:TopTop: gt(x0,skf21(x0)),s1(x0) -> gt(x0,x1),conditionnormo(x1)
% 0.39/0.80 === Clause set with instances from active satisfied. Growing active. New size: 159
% 0.39/0.80 === Restarting.
% 0.39/0.80 === Backtracking. Learning clause 149:1:0:[54.2,89.2,122.1]:: drugi(n0) ->
% 0.39/0.80 === Backtracking. Learning clause 150:2:1:[71.2,1.1]:Top: ren19(x0) -> uptakepg(x0)
% 0.39/0.80 === Backtracking. Learning clause 151:2:1:[94.2,1.1]:Top: ren24(x0) -> drugi(x0)
% 0.39/0.80 === Conflict found: 129:2:1:[16.3,1.1]:Top: uptakelg(x0),releaselg(x0) -> {x0 -> skf19(n0)}
% 0.39/0.80 === Backtracking. Learning clause 152:3:2:[129.2,146.2]:TopTop: uptakelg(skf19(x0)),releaselg(x1) -> gt(x0,x1)
% 0.39/0.80 === Backtracking. Learning clause 153:4:2:[95.1,132.1]:TopTop: -> releaselg(skf1(x0)),uptakelg(skf1(x0)),gt(x0,x1),ren2(x1)
% 0.39/0.80 === Backtracking. Learning clause 154:5:1:[57.2,74.1]:Top: conditionnormo(skf15(x0)) -> ren16(x0),ren17(x0),ren18(x0),ren19(x0)
% 0.39/0.80 === Backtracking. Learning clause 155:2:1:[96.2,100.1]:Top: gt(x0,skf18(x0)) -> ren26(x0)
% 0.39/0.80 === Backtracking. Learning clause 156:2:1:[97.2,100.1]:Top: bsecretioni(skf18(x0)) -> ren26(x0)
% 0.39/0.80 === Backtracking. Learning clause 157:5:3:[110.1,112.4]:TopTopTop: gt(skf21(x0),x1),s1(x0) -> conditionhyper(x1),gt(x0,x2),conditionnormo(x2)
% 0.39/0.80 === Backtracking. Learning clause 158:4:2:[109.1,112.4]:TopTop: s1(x0) -> s2(skf21(x0)),gt(x0,x1),conditionnormo(x1)
% 0.39/0.80 === Clause set with instances from active satisfied. Growing active. New size: 185
% 0.39/0.80 === Restarting.
% 0.39/0.80 === Backtracking. Learning clause 159:3:1:[66.3,1.1]:Top: ren18(x0),releaselg(x0) -> uptakepg(x0)
% 0.39/0.80 === Backtracking. Learning clause 160:4:2:[51.2,158.2]:TopTop: s0(skf21(x0)),s1(x0) -> gt(x0,x1),conditionnormo(x1)
% 0.39/0.80 === Conflict found: 134:4:2:[17.2,19.1]:TopTop: gt(x0,skf2(x0)) -> bcapacityex(x0),gt(x0,x1),bsecretioni(x1) {x0 -> n0, x1 -> skf3(n0)}
% 0.39/0.80 === Backtracking. Learning clause 162:4:1:[99.1,161.1,134.3,138.1,98.2]:Top: ren26(x0) -> bsecretioni(skf3(x0)),ren9(x0),drugsu(skf2(x0))
% 0.39/0.80 === Backtracking. Learning clause 163:3:1:[98.2,33.1]:Top: ren26(x0) -> drugsu(skf8(x0)),ren9(x0)
% 0.39/0.80 === Conflict found: 134:4:2:[17.2,19.1]:TopTop: gt(x0,skf2(x0)) -> bcapacityex(x0),gt(x0,x1),bsecretioni(x1) {x0 -> n0, x1 -> skf8(n0)}
% 0.39/0.80 === Backtracking. Learning clause 165:4:1:[99.1,164.1,134.3,33.1,98.2]:Top: ren26(x0) -> bsecretioni(skf8(x0)),ren9(x0),drugsu(skf2(x0))
% 0.39/0.80 === Backtracking. Learning clause 166:3:1:[98.2,35.1]:Top: ren26(x0) -> drugsu(skf9(x0)),ren9(x0)
% 0.39/0.80 === Backtracking. Learning clause 167:6:1:[98.2,144.1]:Top: ren26(x0) -> drugsu(skf15(x0)),ren16(x0),ren17(x0),ren18(x0),ren19(x0)
% 0.39/0.80 === Conflict found: 134:4:2:[17.2,19.1]:TopTop: gt(x0,skf2(x0)) -> bcapacityex(x0),gt(x0,x1),bsecretioni(x1) {x0 -> n0, x1 -> skf15(n0)}
% 0.39/0.80 === Backtracking. Learning clause 169:7:1:[99.1,168.1,134.3,144.1,98.2]:Top: ren26(x0) -> bsecretioni(skf15(x0)),ren16(x0),ren17(x0),ren18(x0),ren19(x0),drugsu(skf2(x0))
% 0.39/0.80 === Backtracking. Learning clause 170:3:1:[98.2,90.1]:Top: ren26(x0) -> drugsu(skf16(x0)),ren24(x0)
% 0.39/0.80 === Backtracking. Learning clause 172:2:1:[91.0,171.1,95.1,90.1]:Top: -> releaselg(skf16(x0)),ren24(x0)
% 0.39/0.80 === Backtracking. Learning clause 173:3:1:[98.2,92.1]:Top: ren26(x0) -> drugsu(skf17(x0)),ren24(x0)
% 0.39/0.80 === Conflict found: 134:4:2:[17.2,19.1]:TopTop: gt(x0,skf2(x0)) -> bcapacityex(x0),gt(x0,x1),bsecretioni(x1) {x0 -> n0, x1 -> skf17(n0)}
% 0.39/0.80 === Backtracking. Learning clause 175:4:1:[99.1,174.1,134.3,92.1,98.2]:Top: ren26(x0) -> bsecretioni(skf17(x0)),ren24(x0),drugsu(skf2(x0))
% 0.39/0.80 === Conflict found: 147:3:2:[101.2,103.1]:TopTop: gt(x0,skf19(x0)) -> gt(x0,x1),drugbg(x1) {x0 -> n0, x1 -> skf3(n0)}
% 0.39/0.80 === Backtracking. Learning clause 177:4:1:[99.1,176.1,147.1,134.3,138.1,98.2,136.1]:Top: ren26(x0) -> bsecretioni(skf19(x0)),drugsu(skf2(x0)),ren9(x0)
% 0.39/0.80 === Conflict found: 134:4:2:[17.2,19.1]:TopTop: gt(x0,skf2(x0)) -> bcapacityex(x0),gt(x0,x1),bsecretioni(x1) {x0 -> n0, x1 -> skf21(n0)}
% 0.39/0.80 === Backtracking. Learning clause 179:6:2:[99.1,178.2,134.3,148.1,98.2]:TopTop: s1(x0),ren26(x0) -> bsecretioni(skf21(x0)),gt(x0,x1),conditionnormo(x1),drugsu(skf2(x0))
% 0.39/0.80 === Clause set with instances from active satisfied. Growing active. New size: 249
% 0.39/0.80 === Backtracking. Learning clause 180:3:1:[123.2,9.1,98.2]:Top: conditionnormo(x0),ren26(n0) -> drugsu(x0)
% 0.39/0.80 === Clause set with instances from active satisfied. Growing active. New size: 313
% 0.39/0.80 === Backtracking. Learning clause 181:4:1:[86.1,88.2]:Top: drugsu(x0) -> s1(x0),s2(x0),s3(x0)
% 0.39/0.80 === Clause set with instances from active satisfied. Growing active. New size: 377
% 0.39/0.80 === Backtracking. Learning clause 182:2:1:[89.2,55.2]:Top: drugi(x0),s2(x0) ->
% 0.39/0.80 === Backtracking. Learning clause 183:4:1:[19.3,123.1]:Top: ren3(n0,skf2(n0)) -> bcapacityex(n0),bsecretioni(x0),conditionhyper(x0)
% 0.39/0.80 === Clause set with instances from active satisfied. Growing active. New size: 441
% 0.39/0.80 === Backtracking. Learning clause 184:2:1:[62.3,33.1,34.1]:Top: ren17(x0) -> ren9(x0)
% 0.39/0.80 === Backtracking. Learning clause 185:2:2:[111.3,6.1,5.1]:TopTop: ren29(x0,x1),bcapacitysn(x1) ->
% 0.39/0.80 === Clause set with instances from active satisfied. Growing active. New size: 505
% 0.39/0.80 === Backtracking. Learning clause 187:3:2:[109.1,186.1,110.2,118.1,119.1,126.2,121.2]:TopTop: ren29(x0,x1),bcapacityex(x1) -> gt(n0,x1)
% 0.39/0.80 === Backtracking. Learning clause 188:1:0:[110.2,118.1,119.1,126.2,158.2,120.2,111.2,187.2,112.4,148.1,1.1,122.1,9.2]:: conditionhyper(n0) ->
% 0.39/0.80 === Conflict found: 157:5:3:[110.1,112.4]:TopTopTop: gt(skf21(x0),x1),s1(x0) -> conditionhyper(x1),gt(x0,x2),conditionnormo(x2) {x0 -> n0, x1 -> skf23(skf21(n0)), x2 -> skf15(n0)}
% 0.39/0.80 === Backtracking. Learning clause 191:3:1:[122.0,189.1,1.0,190.4,157.5,154.1,144.1,66.1,93.1,60.1,62.1,125.1,70.1,152.1,147.1,21.1,22.1,172.1,90.1,92.1,94.1,149.1]:Top: gt(skf21(n0),x0) -> conditionhyper(x0),gt(n0,skf3(n0))
% 0.39/0.80 === Conflict found: 142:3:2:[20.2,22.1]:TopTop: gt(x0,skf3(x0)),releaselg(x1) -> gt(x0,x1) {x0 -> n0, x1 -> skf16(n0)}
% 0.39/0.80 === Backtracking. Learning clause 193:1:1:[1.0,192.0,142.2,172.1,90.1,94.1,149.1,191.3,119.1,118.1]:Top: -> ren31(skf21(n0),x0)
% 0.39/0.80 === Conflict found: 187:3:2:[109.1,186.1,110.2,118.1,119.1,126.2,121.2]:TopTop: ren29(x0,x1),bcapacityex(x1) -> gt(n0,x1) {x0 -> n0, x1 -> skf21(n0)}
% 0.39/0.80 === Backtracking. Learning clause 194:8:4:[187.1,112.4,148.1,154.1,144.1,62.1,66.1,93.1,60.1,125.1,70.1,122.1,152.1,147.1,21.1,22.1]:TopTopTopTop: bcapacityex(skf21(n0)),releaselg(x0),releaselg(x1) -> gt(n0,skf17(x2)),ren24(x2),gt(n0,x0),gt(n0,skf3(x3)),gt(x3,x1)
% 0.39/0.80
% 0.39/0.80 SZS status Unsatisfiable
% 0.39/0.80
% 0.39/0.80 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.80
% 0.39/0.80 SPASS-SCL-FOL Statistics:
% 0.39/0.80 Number of learned clauses: 54
% 0.39/0.80 Number of propagations: 2434
% 0.39/0.80 Number of decisions: 2324
% 0.39/0.80 Number of resolutions: 147
% 0.39/0.80 Number of condensations: 3
% 0.39/0.80 Number of sub resolutions: 14
% 0.39/0.80 Number of input literals (deduplicated): 84
% 0.39/0.80 Number of grows: 8
% 0.39/0.80 Number of considered ground atoms: 505
% 0.39/0.80
% 0.39/0.80 Needed: 0:00:00.22
% 0.39/0.80
%------------------------------------------------------------------------------