%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SWB029+2 : TPTP v9.2.1. Released v5.2.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n027.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:35:48 PM UTC 2026
% Result : Theorem 25.03s 5.53s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWB029+2 : TPTP v9.2.1. Released v5.2.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.34 % Computer : n027.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Thu May 7 13:20:35 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 SPASS-SCL-FOL version:
% 0.20/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 25.03/5.53 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 25.03/5.53 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 25.03/5.53 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 25.03/5.53 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 25.03/5.53 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 25.03/5.53 Execution resolution_2 ended with status: unsatisfiable
% 25.03/5.53 Used heuristic: resolution_2
% 25.03/5.53
% 25.03/5.53 Input Clauses:
% 25.03/5.53
% 25.03/5.53 Predicates: iext icext ic ren1 ren2 ren3 ren4 ren5 ren6
% 25.03/5.53 Fol Constants: uri_rdf_type uri_owl_complementOf uri_rdf_first uri_rdf_rest uri_rdf_nil uri_owl_intersectionOf uri_ex_w uri_ex_B uri_ex_A uri_owl_Class skc2 skc3 skc4 skc5
% 25.03/5.53 Fol Functions: skf1
% 25.03/5.53 Problem Properties:
% 25.03/5.53 This is a full first-order problem without equality.
% 25.03/5.53
% 25.03/5.53 After reduction: Problem Properties:
% 25.03/5.53 This is a full first-order problem without equality.
% 25.03/5.53
% 25.03/5.53
% 25.03/5.53 Reduced Input Clauses:
% 25.03/5.53
% 25.03/5.53 Most General Atoms: iext(uri_rdf_type,x1,x0) icext(x2,x1) ren2(x0,x1) ren1(x0,x2,x1) iext(uri_owl_complementOf,x0,x1) ren3(x2,x1,x3) ic(x2) ren4(x0,x3,x1,x2) iext(uri_owl_intersectionOf,x0,x1) ren5(x0,x2,x3) iext(uri_rdf_rest,x0,x2) iext(uri_rdf_first,x2,x3) ren6(x4,x0,x1,x3)
% 25.03/5.53
% 25.03/5.53 === Starting SPASS-SCL-FOL A Little Less Naive, considering 40 atoms initially, heuristics mode: resolution_2 ===
% 25.03/5.53
% 25.03/5.53 === Backtracking. Learning clause 38:1:1:[3.2,4.2,9.2]:Top: ren2(x0,x0) ->
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 41
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 39:1:0:[2.2,28.1]:: icext(uri_ex_B,uri_ex_w) ->
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 42
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 40:1:0:[1.1,29.1]:: -> icext(uri_owl_Class,uri_ex_A)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 43
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 41:1:0:[1.1,30.1]:: -> icext(uri_owl_Class,uri_ex_B)
% 25.03/5.53 === Backtracking. Learning clause 42:1:2:[4.2,3.2]:TopTop: ren1(x0,x1,x0) ->
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 44
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 43:1:0:[1.1,31.1]:: -> icext(skc2,uri_ex_w)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 108
% 25.03/5.53 === Backtracking. Learning clause 44:2:3:[2.1,12.2]:TopTopTop: ren3(x0,x1,x2) -> iext(uri_rdf_type,x1,x2)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 110
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 45:2:2:[23.2,32.1]:TopTop: ren6(skc2,skc4,x0,x1) -> ren5(skc2,x0,x1)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 112
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 46:4:3:[27.1,33.1]:TopTopTop: iext(uri_rdf_rest,skc4,x0),iext(uri_rdf_first,x0,x1),iext(uri_rdf_rest,x0,uri_rdf_nil) -> ren6(x2,skc4,uri_ex_A,x1)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 115
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 48:3:3:[36.0,47.2,27.2,34.1]:TopTopTop: iext(uri_rdf_first,skc4,x0),iext(uri_rdf_first,skc5,x1) -> ren6(x2,skc4,x0,x1)
% 25.03/5.53 === Conflict found: 46:4:3:[27.1,33.1]:TopTopTop: iext(uri_rdf_rest,skc4,x0),iext(uri_rdf_first,x0,x1),iext(uri_rdf_rest,x0,uri_rdf_nil) -> ren6(x2,skc4,uri_ex_A,x1) {x0 -> skc5, x1 -> uri_rdf_type, x2 -> uri_rdf_type}
% 25.03/5.53 === Backtracking. Learning clause 50:2:2:[36.0,49.1,46.1,34.1]:TopTop: iext(uri_rdf_first,skc5,x0) -> ren6(x1,skc4,uri_ex_A,x0)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 118
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 52:3:3:[36.0,51.2,27.3,35.1]:TopTopTop: iext(uri_rdf_first,x0,x1),iext(uri_rdf_rest,x0,skc5) -> ren6(x2,x0,x1,skc3)
% 25.03/5.53 === Conflict found: 52:3:3:[36.0,51.2,27.3,35.1]:TopTopTop: iext(uri_rdf_first,x0,x1),iext(uri_rdf_rest,x0,skc5) -> ren6(x2,x0,x1,skc3) {x0 -> skc4, x1 -> uri_rdf_type, x2 -> uri_rdf_type}
% 25.03/5.53 === Backtracking. Learning clause 53:2:2:[52.2,34.1]:TopTop: iext(uri_rdf_first,skc4,x0) -> ren6(x1,skc4,x0,skc3)
% 25.03/5.53 === Conflict found: 50:2:2:[36.0,49.1,46.1,34.1]:TopTop: iext(uri_rdf_first,skc5,x0) -> ren6(x1,skc4,uri_ex_A,x0) {x0 -> skc3, x1 -> uri_rdf_type}
% 25.03/5.53 === Backtracking. Learning clause 54:1:1:[50.1,35.1]:Top: -> ren6(x0,skc4,uri_ex_A,skc3)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 182
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 182
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 55:4:4:[27.4,36.1]:TopTopTopTop: iext(uri_rdf_first,x0,x1),iext(uri_rdf_rest,x0,skc5),iext(uri_rdf_first,skc5,x2) -> ren6(x3,x0,x1,x2)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 182
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 56:1:0:[10.1,37.1]:: -> ren2(skc3,uri_ex_A)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 182
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 57:1:1:[10.2,38.1]:Top: iext(uri_owl_complementOf,x0,x0) ->
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 186
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 58:3:2:[15.3,39.1,13.3]:TopTop: ren4(uri_ex_B,uri_ex_w,x0,x1),icext(x0,uri_ex_w),icext(x1,uri_ex_w) ->
% 25.03/5.53 === Backtracking. Learning clause 59:1:1:[11.2,39.1]:Top: ren3(uri_ex_B,uri_ex_w,x0) ->
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 250
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 255
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 60:2:2:[14.2,40.1,11.1]:TopTop: ren4(uri_owl_Class,uri_ex_A,x0,x1) -> icext(x0,uri_ex_A)
% 25.03/5.53 === Backtracking. Learning clause 61:6:9:[24.3,25.1,26.2,25.1]:TopTopTopTopTopTopTopTopTop: ren6(x0,x1,x2,x3),ren5(x0,x4,x5),ren5(x0,x6,x7) -> ren6(x0,x1,x4,x5),ren6(x0,x8,x2,x3),ren6(x0,x8,x6,x7)
% 25.03/5.53 === Backtracking. Learning clause 62:4:7:[23.3,25.2,26.1,26.1,61.2]:TopTopTopTopTopTopTop: ren6(x0,x1,x2,x3) -> ren6(x0,x1,x4,x5),ren6(x0,x6,x2,x3),ren6(x0,x6,x4,x5)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 260
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 63:2:1:[5.1,41.1]:Top: -> icext(x0,uri_ex_B),ren1(uri_owl_Class,uri_ex_B,x0)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 260
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 64:2:1:[5.2,39.1]:Top: icext(x0,uri_ex_w) -> ren1(x0,uri_ex_w,uri_ex_B)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 262
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 65:2:1:[5.1,43.1]:Top: -> icext(x0,uri_ex_w),ren1(skc2,uri_ex_w,x0)
% 25.03/5.53 === Conflict found: 65:2:1:[5.1,43.1]:Top: -> icext(x0,uri_ex_w),ren1(skc2,uri_ex_w,x0) {x0 -> uri_ex_B}
% 25.03/5.53 === Backtracking. Learning clause 66:1:0:[65.1,39.1]:: -> ren1(skc2,uri_ex_w,uri_ex_B)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 326
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 330
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Conflict found: 62:4:7:[23.3,25.2,26.1,26.1,61.2]:TopTopTopTopTopTopTop: ren6(x0,x1,x2,x3) -> ren6(x0,x1,x4,x5),ren6(x0,x6,x2,x3),ren6(x0,x6,x4,x5) {x0 -> skc2, x1 -> skc4, x2 -> uri_ex_A, x3 -> skc3, x4 -> uri_rdf_type, x5 -> uri_rdf_type, x6 -> uri_rdf_type}
% 25.03/5.53 === Backtracking. Learning clause 67:3:4:[62.1,54.1]:TopTopTopTop: -> ren6(x0,skc4,x1,x2),ren6(x0,x3,uri_ex_A,skc3),ren6(x0,x3,x1,x2)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 331
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 68:1:1:[9.1,56.1]:Top: -> ren1(skc3,x0,uri_ex_A)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 331
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 69:2:2:[14.3,59.1]:TopTop: ren4(x0,uri_ex_w,uri_ex_B,x1),icext(x0,uri_ex_w) ->
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 331
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 70:2:2:[10.2,8.1]:TopTop: iext(uri_owl_complementOf,x0,x1) -> ic(x1)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 395
% 25.03/5.53 === Backtracking. Learning clause 71:3:4:[12.2,3.3]:TopTopTopTop: ren3(x0,x1,x2),ren1(x3,x1,x2),icext(x3,x1) ->
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 397
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Conflict found: 71:3:4:[12.2,3.3]:TopTopTopTop: ren3(x0,x1,x2),ren1(x3,x1,x2),icext(x3,x1) -> {x0 -> uri_rdf_type, x1 -> uri_rdf_type, x2 -> uri_ex_A, x3 -> skc3}
% 25.03/5.53 === Backtracking. Learning clause 72:2:2:[71.2,68.1]:TopTop: ren3(x0,x1,uri_ex_A),icext(skc3,x1) ->
% 25.03/5.53 === Backtracking. Learning clause 73:3:4:[21.2,14.1]:TopTopTopTop: ren5(x0,x1,x2),icext(x0,x3) -> ren3(x1,x3,x2)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 397
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 74:1:0:[7.1,56.1]:: -> ic(skc3)
% 25.03/5.53 === Backtracking. Learning clause 75:3:5:[12.1,73.3,72.2,11.2]:TopTopTopTopTop: ren5(x0,x1,skc3),ren3(x2,x3,uri_ex_A),ren3(x0,x3,x4) ->
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 399
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 76:4:2:[22.1,74.1]:TopTop: ic(x0),ic(x1),ren4(skc3,skf1(skc3,x0,x1),x0,x1) -> ren5(skc3,x0,x1)
% 25.03/5.53 === Backtracking. Learning clause 77:3:4:[11.2,3.3]:TopTopTopTop: ren3(x0,x1,x2),ren1(x3,x1,x0),icext(x3,x1) ->
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 399
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 78:3:4:[23.3,18.1]:TopTopTopTop: ren6(x0,x1,x2,x3),iext(uri_owl_intersectionOf,x0,x1) -> ic(x0)
% 25.03/5.53 === Conflict found: 45:2:2:[23.2,32.1]:TopTop: ren6(skc2,skc4,x0,x1) -> ren5(skc2,x0,x1) {x0 -> uri_rdf_type, x1 -> uri_rdf_type}
% 25.03/5.53 === Backtracking. Learning clause 79:2:2:[45.2,18.1]:TopTop: ren6(skc2,skc4,x0,x1) -> ic(skc2)
% 25.03/5.53 === Conflict found: 79:2:2:[45.2,18.1]:TopTop: ren6(skc2,skc4,x0,x1) -> ic(skc2) {x0 -> uri_ex_A, x1 -> skc3}
% 25.03/5.53 === Backtracking. Learning clause 80:1:0:[79.1,54.1]:: -> ic(skc2)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 463
% 25.03/5.53 === Backtracking. Learning clause 81:3:3:[1.2,3.3]:TopTopTop: iext(uri_rdf_type,x0,x1),ren1(x2,x0,x1),icext(x2,x0) ->
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 467
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 82:4:2:[22.2,80.1]:TopTop: ic(x0),ic(x1),ren4(x0,skf1(x0,skc2,x1),skc2,x1) -> ren5(x0,skc2,x1)
% 25.03/5.53 === Conflict found: 76:4:2:[22.1,74.1]:TopTop: ic(x0),ic(x1),ren4(skc3,skf1(skc3,x0,x1),x0,x1) -> ren5(skc3,x0,x1) {x0 -> skc2, x1 -> uri_rdf_type}
% 25.03/5.53 === Backtracking. Learning clause 83:3:1:[76.1,80.1]:Top: ic(x0),ren4(skc3,skf1(skc3,skc2,x0),skc2,x0) -> ren5(skc3,skc2,x0)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 469
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Conflict found: 67:3:4:[62.1,54.1]:TopTopTopTop: -> ren6(x0,skc4,x1,x2),ren6(x0,x3,uri_ex_A,skc3),ren6(x0,x3,x1,x2) {x0 -> skc2, x1 -> uri_ex_B, x2 -> uri_owl_complementOf, x3 -> uri_rdf_type}
% 25.03/5.53 === Backtracking. Learning clause 84:4:4:[67.2,23.1,23.1]:TopTopTopTop: iext(uri_owl_intersectionOf,x0,x1) -> ren6(x0,skc4,x2,x3),ren5(x0,uri_ex_A,skc3),ren5(x0,x2,x3)
% 25.03/5.53 === Backtracking. Learning clause 85:2:1:[23.1,54.1]:Top: iext(uri_owl_intersectionOf,x0,skc4) -> ren5(x0,uri_ex_A,skc3)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 474
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 86:3:2:[25.2,85.2]:TopTop: iext(uri_owl_intersectionOf,x0,x1),iext(uri_owl_intersectionOf,x0,skc4) -> ren6(x0,x1,uri_ex_A,skc3)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 474
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Backtracking. Learning clause 87:3:4:[17.2,44.1]:TopTopTopTop: -> icext(x0,x1),ren4(x0,x1,x2,x3),iext(uri_rdf_type,x1,x3)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 538
% 25.03/5.53 === Backtracking. Learning clause 88:3:3:[2.1,4.2]:TopTopTop: ren1(x0,x1,x2) -> iext(uri_rdf_type,x1,x2),icext(x0,x1)
% 25.03/5.53 === Conflict found: 73:3:4:[21.2,14.1]:TopTopTopTop: ren5(x0,x1,x2),icext(x0,x3) -> ren3(x1,x3,x2) {x0 -> skc2, x1 -> uri_owl_complementOf, x2 -> uri_ex_B, x3 -> uri_ex_w}
% 25.03/5.53 === Backtracking. Learning clause 89:4:5:[73.3,12.1,23.3]:TopTopTopTopTop: icext(x0,x1),ren6(x0,x2,x3,x4),iext(uri_owl_intersectionOf,x0,x2) -> icext(x4,x1)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 538
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Conflict found: 85:2:1:[23.1,54.1]:Top: iext(uri_owl_intersectionOf,x0,skc4) -> ren5(x0,uri_ex_A,skc3) {x0 -> skc2}
% 25.03/5.53 === Backtracking. Learning clause 90:1:0:[85.1,32.1]:: -> ren5(skc2,uri_ex_A,skc3)
% 25.03/5.53 === Clause set with instances from active satisfied. Growing active. New size: 542
% 25.03/5.53 === Restarting.
% 25.03/5.53 === Conflict found: 75:3:5:[12.1,73.3,72.2,11.2]:TopTopTopTopTop: ren5(x0,x1,skc3),ren3(x2,x3,uri_ex_A),ren3(x0,x3,x4) -> {x0 -> skc2, x1 -> uri_ex_A, x2 -> uri_rdf_type, x3 -> uri_rdf_type, x4 -> uri_rdf_type}
% 25.03/5.53 === Backtracking. Learning clause 91:2:3:[75.1,90.1]:TopTopTop: ren3(x0,x1,uri_ex_A),ren3(skc2,x1,x2) ->
% 25.03/5.53 === Backtracking. Learning clause 92:3:5:[14.3,11.1,11.2,13.2,12.2,91.1]:TopTopTopTopTop: ren4(x0,x1,uri_ex_A,x2),ren3(x0,x1,x3),ren3(skc2,x1,x4) ->
% 25.03/5.53 === Conflict found: 73:3:4:[21.2,14.1]:TopTopTopTop: ren5(x0,x1,x2),icext(x0,x3) -> ren3(x1,x3,x2) {x0 -> skc2, x1 -> uri_ex_A, x2 -> skc3, x3 -> uri_rdf_type}
% 25.03/5.53 === Backtracking. Learning clause 93:3:5:[73.3,11.1,11.2,13.2,12.2,91.1]:TopTopTopTopTop: ren5(x0,uri_ex_A,x1),ren3(x0,x2,x3),ren3(skc2,x2,x4) ->
% 25.03/5.53
% 25.03/5.53 SZS status Unsatisfiable
% 25.03/5.53
% 25.03/5.53 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 25.03/5.53
% 25.03/5.53 SPASS-SCL-FOL Statistics:
% 25.03/5.53 Number of learned clauses: 53
% 25.03/5.53 Number of propagations: 7909
% 25.03/5.53 Number of decisions: 3138
% 25.03/5.53 Number of resolutions: 76
% 25.03/5.53 Number of condensations: 3
% 25.03/5.53 Number of sub resolutions: 3
% 25.03/5.53 Number of input literals (deduplicated): 25
% 25.03/5.53 Number of grows: 37
% 25.03/5.53 Number of considered ground atoms: 542
% 25.03/5.53
% 25.03/5.53 Needed: 0:00:04.99
% 25.03/5.53
%------------------------------------------------------------------------------