%------------------------------------------------------------------------------ % File : SPASS-SCL---0.1 % Problem : LCL663+1.010 : TPTP v9.2.1. Released v4.0.0. % Transfm : none % Format : tptp % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p % Computer : n002.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:10 PM UTC 2026 % Result : CounterSatisfiable 7.05s 2.22s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : LCL663+1.010 : TPTP v9.2.1. Released v4.0.0. % 0.11/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.33 % Computer : n002.cluster.edu % 0.14/0.33 % Model : x86_64 x86_64 % 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.33 % Memory : 8042.1875MB % 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Thu May 7 12:38:32 EDT 2026 % 0.14/0.34 % CPUTime : % 0.14/0.34 SPASS-SCL-FOL version: % 0.18/0.42 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode] % 7.05/2.22 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 7.05/2.22 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 7.05/2.22 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 7.05/2.22 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 7.05/2.22 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 7.05/2.22 Execution resolution_2 ended with status: satisfiable % 7.05/2.22 Used heuristic: resolution_2 % 7.05/2.22 % 7.05/2.22 Input Clauses: % 7.05/2.22 % 7.05/2.22 Predicates: r1 p1 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 ren33 ren34 ren35 ren36 ren37 ren38 ren39 ren40 ren41 ren42 ren43 ren44 ren45 % 7.05/2.22 Fol Constants: skc37 % 7.05/2.22 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 skf24 skf25 skf26 skf27 skf28 skf29 skf30 skf31 skf32 skf33 skf34 skf35 skf36 skf38 skf39 skf40 skf41 skf42 skf43 skf44 skf45 skf46 % 7.05/2.22 Problem Properties: % 7.05/2.22 This is a full first-order problem without equality. % 7.05/2.22 % 7.05/2.22 After reduction: Problem Properties: % 7.05/2.22 This is a full first-order problem without equality. % 7.05/2.22 % 7.05/2.22 % 7.05/2.22 Reduced Input Clauses: % 7.05/2.22 102:2:1:[101.0,100.2]:Top: r1(skc37,x0),ren45(x0,skf46(x0)) -> % 7.05/2.22 % 7.05/2.22 Most General Atoms: r1(x8,x9) ren1(x10,x0) p1(x8) ren2(x10,x0) ren3(x9,x0) ren4(x9,x0) ren5(x9,x0) ren6(x9,x0) ren7(x9,x0) ren8(x9,x0) ren9(x9,x0) ren10(x10,x0) ren11(x10,x0) ren12(x9,x0) ren13(x9,x0) ren14(x9,x0) ren15(x9,x0) ren16(x9,x0) ren17(x9,x0) ren18(x10,x0) ren19(x10,x0) ren20(x9,x0) ren21(x9,x0) ren22(x9,x0) ren23(x9,x0) ren24(x9,x0) ren25(x10,x0) ren26(x10,x0) ren27(x9,x0) ren28(x9,x0) ren29(x9,x0) ren30(x9,x0) ren31(x10,x0) ren32(x10,x0) ren33(x9,x0) ren34(x9,x0) ren35(x9,x0) ren36(x10,x0) ren37(x10,x0) ren38(x9,x0) ren39(x9,x0) ren40(x10,x0) ren41(x10,x0) ren42(x9,x0) ren43(x10,x0) ren44(x10,x0) ren45(x10,x0) % 7.05/2.22 % 7.05/2.22 === Starting SPASS-SCL-FOL A Little Less Naive, considering 95 atoms initially, heuristics mode: resolution_2 === % 7.05/2.22 % 7.05/2.22 === Clause set with instances from active satisfied. Growing active. New size: 95 % 7.05/2.22 === Restarting. % 7.05/2.22 === Backtracking. Learning clause 103:3:2:[89.1,1.1]:TopTop: ren43(x0,skf36(x0)) -> p1(x0),ren44(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 104:3:2:[83.1,1.1]:TopTop: ren40(x0,skf34(x0)) -> p1(x0),ren41(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 105:3:2:[75.1,1.1]:TopTop: ren36(x0,skf31(x0)) -> p1(x0),ren37(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 106:3:2:[65.1,1.1]:TopTop: ren31(x0,skf27(x0)) -> p1(x0),ren32(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 107:3:2:[53.1,1.1]:TopTop: ren25(x0,skf22(x0)) -> p1(x0),ren26(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 108:3:2:[39.1,1.1]:TopTop: ren18(x0,skf16(x0)) -> p1(x0),ren19(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 109:3:2:[23.1,1.1]:TopTop: ren10(x0,skf9(x0)) -> p1(x0),ren11(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 110:3:2:[5.1,1.1]:TopTop: ren1(x0,skf1(x0)) -> p1(x0),ren2(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 111:2:2:[85.1,1.1]:TopTop: ren41(x0,skf35(x0)) -> ren42(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 112:2:2:[79.1,1.1]:TopTop: ren38(x0,skf33(x0)) -> ren39(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 113:2:2:[77.1,1.1]:TopTop: ren37(x0,skf32(x0)) -> ren38(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 114:2:2:[71.1,1.1]:TopTop: ren34(x0,skf30(x0)) -> ren35(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 115:2:2:[69.1,1.1]:TopTop: ren33(x0,skf29(x0)) -> ren34(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 116:2:2:[67.1,1.1]:TopTop: ren32(x0,skf28(x0)) -> ren33(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 117:2:2:[61.1,1.1]:TopTop: ren29(x0,skf26(x0)) -> ren30(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 118:2:2:[59.1,1.1]:TopTop: ren28(x0,skf25(x0)) -> ren29(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 119:2:2:[57.1,1.1]:TopTop: ren27(x0,skf24(x0)) -> ren28(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 120:2:2:[55.1,1.1]:TopTop: ren26(x0,skf23(x0)) -> ren27(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 121:2:2:[49.1,1.1]:TopTop: ren23(x0,skf21(x0)) -> ren24(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 122:2:2:[47.1,1.1]:TopTop: ren22(x0,skf20(x0)) -> ren23(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 123:2:2:[45.1,1.1]:TopTop: ren21(x0,skf19(x0)) -> ren22(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 124:2:2:[43.1,1.1]:TopTop: ren20(x0,skf18(x0)) -> ren21(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 125:2:2:[41.1,1.1]:TopTop: ren19(x0,skf17(x0)) -> ren20(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 126:2:2:[35.1,1.1]:TopTop: ren16(x0,skf15(x0)) -> ren17(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 127:2:2:[33.1,1.1]:TopTop: ren15(x0,skf14(x0)) -> ren16(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 128:2:2:[31.1,1.1]:TopTop: ren14(x0,skf13(x0)) -> ren15(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 129:2:2:[29.1,1.1]:TopTop: ren13(x0,skf12(x0)) -> ren14(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 130:2:2:[27.1,1.1]:TopTop: ren12(x0,skf11(x0)) -> ren13(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 131:2:2:[25.1,1.1]:TopTop: ren11(x0,skf10(x0)) -> ren12(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 132:2:2:[19.1,1.1]:TopTop: ren8(x0,skf8(x0)) -> ren9(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 133:2:2:[17.1,1.1]:TopTop: ren7(x0,skf7(x0)) -> ren8(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 134:2:2:[15.1,1.1]:TopTop: ren6(x0,skf6(x0)) -> ren7(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 135:2:2:[13.1,1.1]:TopTop: ren5(x0,skf5(x0)) -> ren6(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 136:2:2:[11.1,1.1]:TopTop: ren4(x0,skf4(x0)) -> ren5(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 137:2:2:[9.1,1.1]:TopTop: ren3(x0,skf3(x0)) -> ren4(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 138:2:2:[7.1,1.1]:TopTop: ren2(x0,skf2(x0)) -> ren3(x1,x0) % 7.05/2.22 === Backtracking. Learning clause 139:1:0:[99.1,1.1]:: ren44(skc37,skf45(skc37)) -> % 7.05/2.22 % 7.05/2.22 Linear Model Building succeeded. % 7.05/2.22 SZS status Satisfiable % 7.05/2.22 % 7.05/2.22 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 7.05/2.22 % 7.05/2.22 SPASS-SCL-FOL Statistics: % 7.05/2.22 Number of learned clauses: 37 % 7.05/2.22 Number of propagations: 119 % 7.05/2.22 Number of decisions: 199 % 7.05/2.22 Number of resolutions: 37 % 7.05/2.22 Number of condensations: 0 % 7.05/2.22 Number of sub resolutions: 1 % 7.05/2.22 Number of input literals (deduplicated): 95 % 7.05/2.22 Number of grows: 1 % 7.05/2.22 Number of considered ground atoms: 95 % 7.05/2.22 % 7.05/2.22 Needed: 0:00:01.68 % 7.05/2.22 %------------------------------------------------------------------------------