%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : LCL674+1.010 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n028.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:13 PM UTC 2026
% Result : Theorem 2.64s 1.16s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL674+1.010 : TPTP v9.2.1. Released v4.0.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.35 % Computer : n028.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Thu May 7 12:37:31 EDT 2026
% 0.18/0.35 % CPUTime :
% 0.18/0.35 SPASS-SCL-FOL version:
% 0.19/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 2.64/1.16 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/1.16 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/1.16 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/1.16 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/1.16 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/1.16 Execution lmodel_grow ended with status: unsatisfiable
% 2.64/1.16 Used heuristic: lmodel_grow
% 2.64/1.16
% 2.64/1.16 Input Clauses:
% 2.64/1.16
% 2.64/1.16 Predicates: r1 p5 p11 p111 p110 p109 p10 p108 p9 p107 p8 p106 p7 p105 p6 p104 p103 p4 p102 p3 p101 p2 p100 p1 ren1 ren2 ren3 ren4 ren5 ren6 ren7 ren8 ren9 ren10 ren11 ren12 ren13 ren14 ren15 ren16 ren17 ren18 ren19 ren20 ren21 ren22
% 2.64/1.16 Fol Constants: skc21
% 2.64/1.16 Fol Functions: skf1 skf2 skf3 skf4 skf5 skf6 skf7 skf8 skf9 skf10 skf11 skf12 skf13 skf14 skf15 skf16 skf17 skf18 skf19 skf20
% 2.64/1.16 Problem Properties:
% 2.64/1.16 This is a full first-order problem without equality.
% 2.64/1.16
% 2.64/1.16 After reduction: Problem Properties:
% 2.64/1.16 This is a full first-order problem without equality.
% 2.64/1.16
% 2.64/1.16
% 2.64/1.16 Reduced Input Clauses:
% 2.64/1.16
% 2.64/1.16 Most General Atoms: r1(x0,x2) ren1(x0) ren2(x0) ren3(x0) ren4(x0) ren5(x0) ren6(x0) ren7(x0) ren8(x0) ren9(x0) ren10(x0) ren11(x0) p11(x0) ren12(x0) p10(x0) ren13(x0) p9(x0) ren14(x0) p8(x0) ren15(x0) p7(x0) ren16(x0) p6(x0) ren17(x0) p5(x0) ren18(x0) p4(x0) ren19(x0) p3(x0) ren20(x0) p2(x0) ren21(x0) p1(x0) ren22(x0) p109(x0) p110(x0) p108(x0) p107(x0) p106(x0) p105(x0) p104(x0) p103(x0) p102(x0) p101(x0) p100(x0) p111(x0)
% 2.64/1.16
% 2.64/1.16 === Starting SPASS-SCL-FOL A Little Less Naive, considering 130 atoms initially, heuristics mode: lmodel_grow ===
% 2.64/1.16
% 2.64/1.16 === Clause set with instances from active satisfied. Growing active. New size: 167
% 2.64/1.16 === Backtracking. Learning clause 141:3:1:[133.1,138.2]:Top: p104(x0),r1(skc21,x0) -> p103(x0)
% 2.64/1.16 === Backtracking. Learning clause 142:7:3:[90.4,89.5]:TopTopTop: r1(x0,x1),p107(x1),ren14(x0),r1(x0,x2),p8(x2),p107(x2) -> p8(x1)
% 2.64/1.16 === Clause set with instances from active satisfied. Growing active. New size: 218
% 2.64/1.16 === Clause set with instances from active satisfied. Growing active. New size: 265
% 2.64/1.16 === Backtracking. Learning clause 143:3:1:[84.5,4.2,6.2,3.2]:Top: ren11(x0),p11(x0),ren1(x0) ->
% 2.64/1.16 === Clause set with instances from active satisfied. Growing active. New size: 310
% 2.64/1.16 === Backtracking. Learning clause 144:8:3:[94.4,93.5,120.3]:TopTopTop: r1(x0,x1),p105(x1),r1(x0,x2),p6(x2),p105(x2),ren22(x0),p105(x0) -> p6(x1)
% 2.64/1.16 === Clause set with instances from active satisfied. Growing active. New size: 348
% 2.64/1.16 === Backtracking. Learning clause 145:4:2:[138.1,2.3,123.1]:TopTop: r1(skc21,x0),r1(x0,x1),p102(x1) -> ren19(x1)
% 2.64/1.16 === Backtracking. Learning clause 146:1:0:[137.2,52.2,51.2]:: ren7(skc21) ->
% 2.64/1.16 === Backtracking. Learning clause 147:3:1:[102.5,76.2,78.2,75.2]:Top: ren20(x0),p2(x0),ren10(x0) ->
% 2.64/1.16 === Backtracking. Learning clause 148:3:1:[90.5,28.2,30.2,27.2]:Top: ren14(x0),p8(x0),ren4(x0) ->
% 2.64/1.16 === Backtracking. Learning clause 149:6:1:[93.2,47.2,50.2,48.2,110.3,109.2,119.2]:Top: ren16(x0),p104(x0),ren22(x0) -> p6(x0),ren5(x0),ren15(x0)
% 2.64/1.16 === Backtracking. Learning clause 150:6:1:[93.2,47.2,48.2,110.3]:Top: ren16(x0),p105(skf12(x0)),ren22(x0),p104(x0) -> p6(x0),p105(x0)
% 2.64/1.16 === Conflict found: 141:3:1:[133.1,138.2]:Top: p104(x0),r1(skc21,x0) -> p103(x0) {x0 -> skf16(skf18(skc21))}
% 2.64/1.16 === Backtracking. Learning clause 151:6:2:[141.3,97.4]:TopTop: p104(x0),r1(skc21,x0),ren18(x1),r1(x1,x0),p4(x0) -> p4(x1)
% 2.64/1.16 === Backtracking. Learning clause 152:4:1:[110.1,138.2]:Top: p104(x0),r1(skc21,x0) -> ren6(x0),p105(x0)
% 2.64/1.16 === Backtracking. Learning clause 153:9:3:[87.3,24.2,26.2,107.3,87.4]:TopTopTop: ren13(x0),r1(x0,skf6(x1)),ren22(x1),p107(x1),ren13(x2),r1(x2,x1),p9(x1) -> p9(x0),p9(x2)
% 2.64/1.16 === Backtracking. Learning clause 154:6:2:[87.3,24.2,26.2,107.3]:TopTop: ren13(x0),r1(x0,skf6(x1)),ren22(x1),p107(x1) -> p9(x0),p108(x1)
% 2.64/1.16 === Backtracking. Learning clause 155:4:2:[87.4,26.2,24.2]:TopTop: ren13(x0),r1(x0,skf6(x1)),ren3(x1) -> p9(x0)
% 2.64/1.16 === Clause set with instances from active satisfied. Growing active. New size: 392
% 2.64/1.16 === Backtracking. Learning clause 158:3:1:[24.1,156.2,26.1,157.3,23.2,87.2]:Top: ren3(x0),ren13(x0) -> p9(x0)
% 2.64/1.16 === Clause set with instances from active satisfied. Growing active. New size: 458
% 2.64/1.16 === Backtracking. Learning clause 159:3:1:[96.3,54.2,52.2,51.2]:Top: ren17(x0),p5(x0),ren7(x0) ->
% 2.64/1.16 === Backtracking. Learning clause 160:7:4:[97.3,64.2,66.2,2.3,98.4]:TopTopTopTop: ren8(x1),r1(x0,x2),r1(x2,skf16(x1)),ren18(x0),r1(x0,x3),p103(x3) -> p4(x3)
% 2.64/1.16 === Clause set with instances from active satisfied. Growing active. New size: 513
% 2.64/1.16 === Clause set with instances from active satisfied. Growing active. New size: 581
% 2.64/1.16 === Backtracking. Learning clause 161:4:2:[90.2,2.3,28.2,30.2,27.2]:TopTop: ren14(x0),p8(x0),r1(x0,x1),ren4(x1) ->
% 2.64/1.16 === Clause set with instances from active satisfied. Growing active. New size: 644
% 2.64/1.16 === Backtracking. Learning clause 162:7:2:[108.3,161.4,107.2,138.2]:TopTop: p106(x0),ren14(x1),p8(x1),r1(x1,x0),r1(skc21,x0) -> ren3(x0),p108(x0)
% 2.64/1.16 === Clause set with instances from active satisfied. Growing active. New size: 698
% 2.64/1.16 === Clause set with instances from active satisfied. Growing active. New size: 744
% 2.64/1.16 === Backtracking. Learning clause 163:5:2:[88.5,20.2,22.2,19.2,87.5]:TopTop: ren3(x0),ren13(x0),r1(x0,x1),p9(x1),p108(x1) ->
% 2.64/1.16 === Backtracking. Learning clause 165:3:1:[40.1,164.1,91.2,39.2,42.2]:Top: ren15(x0),ren5(x0) -> p7(x0)
% 2.64/1.16 === Backtracking. Learning clause 166:7:3:[99.5,100.4]:TopTopTop: r1(x0,x1),p3(x1),p102(x1),ren19(x0),r1(x0,x2),p102(x2) -> p3(x2)
% 2.64/1.16 === Conflict found: 154:6:2:[87.3,24.2,26.2,107.3]:TopTop: ren13(x0),r1(x0,skf6(x1)),ren22(x1),p107(x1) -> p9(x0),p108(x1) {x0 -> skf8(skc21), x1 -> skf8(skc21)}
% 2.64/1.16 === Backtracking. Learning clause 167:4:1:[154.3,138.2,34.2,31.2,33.2]:Top: ren13(x0),r1(x0,skf6(skf8(skc21))),ren4(skc21) -> p9(x0)
% 2.64/1.16 === Clause set with instances from active satisfied. Growing active. New size: 807
% 2.64/1.16 === Clause set with instances from active satisfied. Growing active. New size: 882
% 2.64/1.16 === Conflict found: 160:7:4:[97.3,64.2,66.2,2.3,98.4]:TopTopTopTop: ren8(x1),r1(x0,x2),r1(x2,skf16(x1)),ren18(x0),r1(x0,x3),p103(x3) -> p4(x3) {x0 -> skc21, x1 -> skf18(skf20(skc21)), x2 -> skf18(skf20(skc21)), x3 -> skf15(skf18(skf20(skc21)))}
% 2.64/1.16 === Backtracking. Learning clause 168:7:5:[160.6,62.2,60.2,2.3]:TopTopTopTopTop: ren8(x0),r1(x1,x2),r1(x2,skf16(x0)),ren18(x1),ren8(x3),r1(x1,x4),r1(x4,skf15(x3)) ->
% 2.64/1.16 === Backtracking. Learning clause 170:3:1:[138.1,169.1,137.1,2.3,52.2,51.2,111.3]:Top: r1(skc21,x0),p103(x0) -> p104(x0)
% 2.64/1.16 === Conflict found: 170:3:1:[138.1,169.1,137.1,2.3,52.2,51.2,111.3]:Top: r1(skc21,x0),p103(x0) -> p104(x0) {x0 -> skf16(skf18(skf20(skc21)))}
% 2.64/1.16
% 2.64/1.16 SZS status Unsatisfiable
% 2.64/1.16
% 2.64/1.16 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/1.16
% 2.64/1.16 SPASS-SCL-FOL Statistics:
% 2.64/1.16 Number of learned clauses: 26
% 2.64/1.16 Number of propagations: 2207
% 2.64/1.16 Number of decisions: 2639
% 2.64/1.16 Number of resolutions: 90
% 2.64/1.16 Number of condensations: 0
% 2.64/1.16 Number of sub resolutions: 4
% 2.64/1.16 Number of input literals (deduplicated): 130
% 2.64/1.16 Number of grows: 14
% 2.64/1.16 Number of considered ground atoms: 882
% 2.64/1.16
% 2.64/1.16 Needed: 0:00:00.57
% 2.64/1.16
%------------------------------------------------------------------------------