%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : MSC015-1.015 : TPTP v9.2.1. Released v3.5.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n021.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:56 PM UTC 2026
% Result : Unsatisfiable 8.73s 2.22s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MSC015-1.015 : TPTP v9.2.1. Released v3.5.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.34 % Computer : n021.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Thu May 7 12:43:43 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.34 SPASS-SCL-FOL version:
% 0.19/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 8.73/2.22 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.73/2.22 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.73/2.22 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.73/2.22 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.73/2.22 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.73/2.22 Execution lmodel_grow ended with status: unsatisfiable
% 8.73/2.22 Used heuristic: lmodel_grow
% 8.73/2.22
% 8.73/2.22 Input Clauses:
% 8.73/2.22
% 8.73/2.22 Predicates: p
% 8.73/2.22 Fol Constants: s0 s1
% 8.73/2.22 Fol Functions:
% 8.73/2.22 Problem Properties:
% 8.73/2.22 This is a Bernays Schoenfinkel problem.
% 8.73/2.22
% 8.73/2.22 After reduction: Problem Properties:
% 8.73/2.22 This is a Bernays Schoenfinkel problem.
% 8.73/2.22
% 8.73/2.22
% 8.73/2.22 Reduced Input Clauses:
% 8.73/2.22
% 8.73/2.22 Most General Atoms: p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12,x13,s0) p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12,x13,s1)
% 8.73/2.22
% 8.73/2.22 === Starting SPASS-SCL-FOL A Little Less Naive, considering 59 atoms initially, heuristics mode: lmodel_grow ===
% 8.73/2.22
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 78
% 8.73/2.22 === Backtracking. Learning clause 18:2:13:[2.1,3.2]:TopTopTopTopTopTopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12,s0,s1) -> p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12,s1,s1)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 96
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 114
% 8.73/2.22 === Backtracking. Learning clause 19:2:13:[2.2,18.1]:TopTopTopTopTopTopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12,s1,s1)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 132
% 8.73/2.22 === Backtracking. Learning clause 20:2:12:[4.2,19.1,19.2]:TopTopTopTopTopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,s1,s1,s1)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 146
% 8.73/2.22 === Backtracking. Learning clause 21:2:11:[5.2,20.1,20.2]:TopTopTopTopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,s1,s1,s1,s1)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 158
% 8.73/2.22 === Backtracking. Learning clause 22:2:10:[6.1,21.2,21.1]:TopTopTopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,s1,s1,s1,s1,s1)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 166
% 8.73/2.22 === Backtracking. Learning clause 23:2:7:[7.2,22.1,22.2,9.1]:TopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,s0,s1,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,s1,s0,s0,s0,s0,s0,s0,s0)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 177
% 8.73/2.22 === Backtracking. Learning clause 24:2:6:[7.2,22.1,22.2,10.2]:TopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,s0,s1,s1,s1,s1,s1,s1,s1,s1) -> p(x0,x1,x2,x3,x4,x5,s1,s0,s0,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 186
% 8.73/2.22 === Backtracking. Learning clause 25:2:6:[8.1,24.2,23.1]:TopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,s0,s1,s1,s1,s1,s1,s1,s1,s1) -> p(x0,x1,x2,x3,x4,x5,s1,s1,s0,s0,s0,s0,s0,s0,s0)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 196
% 8.73/2.22 === Backtracking. Learning clause 26:2:6:[7.2,22.1,22.2,25.2]:TopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,s0,s1,s1,s1,s1,s1,s1,s1,s1) -> p(x0,x1,x2,x3,x4,x5,s1,s1,s0,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 208
% 8.73/2.22 === Backtracking. Learning clause 27:2:7:[7.1,22.2,22.1,9.2]:TopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,s0,s1,s1,s1,s1,s1,s1,s1) -> p(x0,x1,x2,x3,x4,x5,x6,s1,s0,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 218
% 8.73/2.22 === Backtracking. Learning clause 28:2:9:[7.2,22.1,22.2]:TopTopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,x8,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,x7,x8,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 226
% 8.73/2.22 === Backtracking. Learning clause 29:2:5:[8.2,28.1,28.2,11.1]:TopTopTopTopTop: p(x0,x1,x2,x3,x4,s0,s1,s1,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,s1,s0,s0,s0,s0,s0,s0,s0,s0,s0)
% 8.73/2.22 === Conflict found: 28:2:9:[7.2,22.1,22.2]:TopTopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,x8,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,x7,x8,s1,s1,s1,s1,s1,s1) {x0 -> s0, x1 -> s1, x2 -> s0, x3 -> s0, x4 -> s1, x5 -> s0, x6 -> s1, x7 -> s0, x8 -> s1}
% 8.73/2.22 === Backtracking. Learning clause 30:2:8:[28.1,8.2]:TopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,s0,s1,s1,s1,s1,s1,s1) -> p(x0,x1,x2,x3,x4,x5,x6,x7,s1,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 237
% 8.73/2.22 === Conflict found: 28:2:9:[7.2,22.1,22.2]:TopTopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,x8,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,x7,x8,s1,s1,s1,s1,s1,s1) {x0 -> s1, x1 -> s1, x2 -> s1, x3 -> s1, x4 -> s1, x5 -> s0, x6 -> s0, x7 -> s0, x8 -> s0}
% 8.73/2.22 === Backtracking. Learning clause 31:2:8:[28.2,30.1]:TopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,x7,s1,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 248
% 8.73/2.22 === Conflict found: 30:2:8:[28.1,8.2]:TopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,s0,s1,s1,s1,s1,s1,s1) -> p(x0,x1,x2,x3,x4,x5,x6,x7,s1,s1,s1,s1,s1,s1,s1) {x0 -> s1, x1 -> s1, x2 -> s1, x3 -> s1, x4 -> s0, x5 -> s0, x6 -> s1, x7 -> s1}
% 8.73/2.22 === Backtracking. Learning clause 32:2:6:[30.1,26.2]:TopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,s0,s1,s1,s1,s1,s1,s1,s1,s1) -> p(x0,x1,x2,x3,x4,x5,s1,s1,s1,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 255
% 8.73/2.22 === Conflict found: 30:2:8:[28.1,8.2]:TopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,s0,s1,s1,s1,s1,s1,s1) -> p(x0,x1,x2,x3,x4,x5,x6,x7,s1,s1,s1,s1,s1,s1,s1) {x0 -> s1, x1 -> s1, x2 -> s1, x3 -> s0, x4 -> s1, x5 -> s0, x6 -> s1, x7 -> s0}
% 8.73/2.22 === Backtracking. Learning clause 33:2:7:[30.2,9.1,28.2]:TopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,s1,s0,s0,s0,s0,s0,s0,s0)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 265
% 8.73/2.22 === Conflict found: 31:2:8:[28.2,30.1]:TopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,x7,s1,s1,s1,s1,s1,s1,s1) {x0 -> s1, x1 -> s1, x2 -> s1, x3 -> s0, x4 -> s0, x5 -> s0, x6 -> s0, x7 -> s1}
% 8.73/2.22 === Backtracking. Learning clause 34:2:5:[31.1,33.2,32.1,11.1,33.1,31.1,24.1]:TopTopTopTopTop: p(x0,x1,x2,x3,x4,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,s1,s1,s0,s0,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Conflict found: 27:2:7:[7.1,22.2,22.1,9.2]:TopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,s0,s1,s1,s1,s1,s1,s1,s1) -> p(x0,x1,x2,x3,x4,x5,x6,s1,s0,s1,s1,s1,s1,s1,s1) {x0 -> s0, x1 -> s0, x2 -> s0, x3 -> s0, x4 -> s0, x5 -> s1, x6 -> s0}
% 8.73/2.22 === Backtracking. Learning clause 35:2:6:[27.2,30.1,31.2,32.1]:TopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,s1,s1,s1,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Conflict found: 35:2:6:[27.2,30.1,31.2,32.1]:TopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,s1,s1,s1,s1,s1,s1,s1,s1,s1) {x0 -> s1, x1 -> s1, x2 -> s1, x3 -> s1, x4 -> s0, x5 -> s1}
% 8.73/2.22 === Backtracking. Learning clause 36:1:0:[35.2,12.1,11.2,35.1,11.1,35.1,17.1,35.2,13.2,32.2,31.2]:: p(s1,s1,s1,s0,s1,s1,s0,s1,s0,s0,s0,s0,s0,s0,s0) ->
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 275
% 8.73/2.22 === Conflict found: 30:2:8:[28.1,8.2]:TopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,s0,s1,s1,s1,s1,s1,s1) -> p(x0,x1,x2,x3,x4,x5,x6,x7,s1,s1,s1,s1,s1,s1,s1) {x0 -> s0, x1 -> s1, x2 -> s0, x3 -> s0, x4 -> s0, x5 -> s1, x6 -> s1, x7 -> s0}
% 8.73/2.22 === Backtracking. Learning clause 37:2:7:[30.2,27.1]:TopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,s0,s0,s1,s1,s1,s1,s1,s1) -> p(x0,x1,x2,x3,x4,x5,x6,s1,s0,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Backtracking. Learning clause 38:2:4:[11.1,35.2,35.1,12.1]:TopTopTopTop: p(x0,x1,x2,x3,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,s1,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0)
% 8.73/2.22 === Backtracking. Learning clause 39:2:5:[11.2,35.1,32.2]:TopTopTopTopTop: p(x0,x1,x2,x3,x4,s0,s0,s1,s1,s1,s1,s1,s1,s1,s1) -> p(x0,x1,x2,x3,x4,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Conflict found: 22:2:10:[6.1,21.2,21.1]:TopTopTopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,s1,s1,s1,s1,s1) {x0 -> s1, x1 -> s1, x2 -> s1, x3 -> s1, x4 -> s1, x5 -> s1, x6 -> s1, x7 -> s1, x8 -> s0, x9 -> s1}
% 8.73/2.22 === Backtracking. Learning clause 40:2:8:[22.2,30.1]:TopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,s0,s1,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,x7,s1,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Conflict found: 37:2:7:[30.2,27.1]:TopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,s0,s0,s1,s1,s1,s1,s1,s1) -> p(x0,x1,x2,x3,x4,x5,x6,s1,s0,s1,s1,s1,s1,s1,s1) {x0 -> s1, x1 -> s1, x2 -> s1, x3 -> s0, x4 -> s0, x5 -> s1, x6 -> s1}
% 8.73/2.22 === Backtracking. Learning clause 41:2:7:[37.2,30.1,28.2]:TopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,s1,s1,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Backtracking. Learning clause 42:2:5:[9.2,29.1]:TopTopTopTopTop: p(x0,x1,x2,x3,x4,s0,s1,s0,s1,s1,s1,s1,s1,s1,s1) -> p(x0,x1,x2,x3,x4,s1,s0,s0,s0,s0,s0,s0,s0,s0,s0)
% 8.73/2.22 === Backtracking. Learning clause 43:2:12:[4.1,19.2]:TopTopTopTopTopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,s1,s0,s0)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 280
% 8.73/2.22 === Backtracking. Learning clause 44:2:8:[8.1,28.2]:TopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,x7,s1,s0,s0,s0,s0,s0,s0)
% 8.73/2.22 === Conflict found: 40:2:8:[22.2,30.1]:TopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,s0,s1,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,x7,s1,s1,s1,s1,s1,s1,s1) {x0 -> s1, x1 -> s1, x2 -> s1, x3 -> s1, x4 -> s1, x5 -> s0, x6 -> s0, x7 -> s1}
% 8.73/2.22 === Backtracking. Learning clause 45:2:5:[40.2,39.1,7.2,22.2,9.2]:TopTopTopTopTop: p(x0,x1,x2,x3,x4,s0,s0,s0,s1,s1,s1,s1,s1,s1,s1) -> p(x0,x1,x2,x3,x4,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Backtracking. Learning clause 46:2:1:[11.2,35.1,35.2,38.2,15.1,38.1,33.1]:Top: p(x0,s0,s1,s1,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,s1,s0,s0,s1,s0,s0,s1,s0,s0,s0,s0,s0,s0,s0)
% 8.73/2.22 === Backtracking. Learning clause 47:2:10:[6.1,21.2]:TopTopTopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,s1,s0,s0,s0,s0)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 290
% 8.73/2.22 === Conflict found: 41:2:7:[37.2,30.1,28.2]:TopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,s1,s1,s1,s1,s1,s1,s1,s1) {x0 -> s1, x1 -> s1, x2 -> s0, x3 -> s1, x4 -> s1, x5 -> s0, x6 -> s0}
% 8.73/2.22 === Backtracking. Learning clause 48:2:5:[41.2,39.1]:TopTopTopTopTop: p(x0,x1,x2,x3,x4,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Conflict found: 33:2:7:[30.2,9.1,28.2]:TopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,s1,s0,s0,s0,s0,s0,s0,s0) {x0 -> s0, x1 -> s0, x2 -> s0, x3 -> s0, x4 -> s0, x5 -> s1, x6 -> s0}
% 8.73/2.22 === Backtracking. Learning clause 49:2:5:[33.2,47.1,29.2,25.2,41.2]:TopTopTopTopTop: p(x0,x1,x2,x3,x4,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,s1,s0,s1,s0,s0,s1,s0,s0,s0,s0)
% 8.73/2.22 === Backtracking. Learning clause 50:2:11:[5.1,20.2]:TopTopTopTopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,s1,s0,s0,s0)
% 8.73/2.22 === Backtracking. Learning clause 51:2:4:[12.1,32.2,41.1]:TopTopTopTop: p(x0,x1,x2,x3,s0,s1,s0,s1,s1,s1,s1,s1,s1,s1,s1) -> p(x0,x1,x2,x3,s1,s0,s0,s1,s1,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 302
% 8.73/2.22 === Conflict found: 25:2:6:[8.1,24.2,23.1]:TopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,s0,s1,s1,s1,s1,s1,s1,s1,s1) -> p(x0,x1,x2,x3,x4,x5,s1,s1,s0,s0,s0,s0,s0,s0,s0) {x0 -> s0, x1 -> s1, x2 -> s0, x3 -> s0, x4 -> s0, x5 -> s0}
% 8.73/2.22 === Backtracking. Learning clause 52:2:6:[25.1,41.2]:TopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,s1,s1,s0,s0,s0,s0,s0,s0,s0)
% 8.73/2.22 === Conflict found: 48:2:5:[41.2,39.1]:TopTopTopTopTop: p(x0,x1,x2,x3,x4,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1) {x0 -> s0, x1 -> s0, x2 -> s1, x3 -> s0, x4 -> s1}
% 8.73/2.22 === Backtracking. Learning clause 53:2:1:[48.1,38.2,13.1,38.1,48.1,15.1,34.1,30.1]:Top: p(x0,s0,s1,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,s1,s0,s0,s0,s1,s1,s0,s1,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Conflict found: 35:2:6:[27.2,30.1,31.2,32.1]:TopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,s1,s1,s1,s1,s1,s1,s1,s1,s1) {x0 -> s1, x1 -> s1, x2 -> s0, x3 -> s1, x4 -> s1, x5 -> s1}
% 8.73/2.22 === Backtracking. Learning clause 54:2:2:[35.1,29.2,14.1,38.1]:TopTop: p(x0,x1,s0,s1,s1,s0,s1,s1,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,s1,s0,s1,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0)
% 8.73/2.22 === Conflict found: 48:2:5:[41.2,39.1]:TopTopTopTopTop: p(x0,x1,x2,x3,x4,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1) {x0 -> s0, x1 -> s0, x2 -> s0, x3 -> s0, x4 -> s1}
% 8.73/2.22 === Backtracking. Learning clause 55:1:0:[48.1,38.2,13.1,38.1,1.1,48.1,14.1,38.1,48.1,13.1,38.1,48.1]:: -> p(s0,s0,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Backtracking. Learning clause 56:2:6:[10.1,41.2]:TopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,s1,s0,s0,s0,s0,s0,s0,s0,s0)
% 8.73/2.22 === Conflict found: 22:2:10:[6.1,21.2,21.1]:TopTopTopTopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,s1,s1,s1,s1,s1) {x0 -> s0, x1 -> s1, x2 -> s0, x3 -> s0, x4 -> s1, x5 -> s0, x6 -> s1, x7 -> s0, x8 -> s0, x9 -> s0}
% 8.73/2.22 === Backtracking. Learning clause 57:2:6:[22.1,56.2]:TopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,s1,s0,s0,s0,s1,s1,s1,s1,s1)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 306
% 8.73/2.22 === Conflict found: 48:2:5:[41.2,39.1]:TopTopTopTopTop: p(x0,x1,x2,x3,x4,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1) {x0 -> s0, x1 -> s1, x2 -> s0, x3 -> s1, x4 -> s1}
% 8.73/2.22 === Backtracking. Learning clause 58:2:4:[48.1,38.2]:TopTopTopTop: p(x0,x1,x2,x3,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Backtracking. Learning clause 59:2:5:[11.1,35.2]:TopTopTopTopTop: p(x0,x1,x2,x3,x4,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,s1,s0,s0,s0,s0,s0,s0,s0,s0,s0)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 308
% 8.73/2.22 === Backtracking. Learning clause 60:2:0:[13.2,58.1,58.2,16.1]:: p(s0,s1,s1,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(s1,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0)
% 8.73/2.22 === Conflict found: 23:2:7:[7.2,22.1,22.2,9.1]:TopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,s0,s1,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,s1,s0,s0,s0,s0,s0,s0,s0) {x0 -> s1, x1 -> s1, x2 -> s1, x3 -> s1, x4 -> s1, x5 -> s1, x6 -> s0}
% 8.73/2.22 === Backtracking. Learning clause 61:2:7:[23.2,31.1]:TopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,s0,s1,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,s1,s1,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 312
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 323
% 8.73/2.22 === Conflict found: 48:2:5:[41.2,39.1]:TopTopTopTopTop: p(x0,x1,x2,x3,x4,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1) {x0 -> s1, x1 -> s0, x2 -> s1, x3 -> s0, x4 -> s1}
% 8.73/2.22 === Backtracking. Learning clause 62:2:2:[48.2,13.1,54.2]:TopTop: p(x0,x1,s0,s1,s1,s0,s1,s1,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,s1,s1,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0)
% 8.73/2.22 === Backtracking. Learning clause 63:2:3:[13.1,39.2,58.1]:TopTopTop: p(x0,x1,x2,s0,s1,s0,s0,s1,s1,s1,s1,s1,s1,s1,s1) -> p(x0,x1,x2,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Clause set with instances from active satisfied. Growing active. New size: 332
% 8.73/2.22 === Conflict found: 61:2:7:[23.2,31.1]:TopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,s0,s1,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,x6,s1,s1,s1,s1,s1,s1,s1,s1) {x0 -> s1, x1 -> s0, x2 -> s0, x3 -> s1, x4 -> s0, x5 -> s1, x6 -> s1}
% 8.73/2.22 === Backtracking. Learning clause 64:2:7:[61.1,8.2]:TopTopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,x6,s0,s0,s1,s1,s1,s1,s1,s1) -> p(x0,x1,x2,x3,x4,x5,x6,s1,s1,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Conflict found: 24:2:6:[7.2,22.1,22.2,10.2]:TopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,s0,s1,s1,s1,s1,s1,s1,s1,s1) -> p(x0,x1,x2,x3,x4,x5,s1,s0,s0,s1,s1,s1,s1,s1,s1) {x0 -> s0, x1 -> s0, x2 -> s0, x3 -> s0, x4 -> s1, x5 -> s0}
% 8.73/2.22 === Backtracking. Learning clause 65:2:6:[24.1,41.2]:TopTopTopTopTopTop: p(x0,x1,x2,x3,x4,x5,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,x4,x5,s1,s0,s0,s1,s1,s1,s1,s1,s1)
% 8.73/2.22 === Conflict found: 58:2:4:[48.1,38.2]:TopTopTopTop: p(x0,x1,x2,x3,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0) -> p(x0,x1,x2,x3,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1,s1) {x0 -> s1, x1 -> s0, x2 -> s0, x3 -> s1}
% 8.73/2.22
% 8.73/2.22 SZS status Unsatisfiable
% 8.73/2.22
% 8.73/2.22 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.73/2.22
% 8.73/2.22 SPASS-SCL-FOL Statistics:
% 8.73/2.22 Number of learned clauses: 48
% 8.73/2.22 Number of propagations: 7544
% 8.73/2.22 Number of decisions: 1033
% 8.73/2.22 Number of resolutions: 140
% 8.73/2.22 Number of condensations: 0
% 8.73/2.22 Number of sub resolutions: 0
% 8.73/2.22 Number of input literals (deduplicated): 32
% 8.73/2.22 Number of grows: 26
% 8.73/2.22 Number of considered ground atoms: 332
% 8.73/2.22
% 8.73/2.22 Needed: 0:00:01.68
% 8.73/2.22
%------------------------------------------------------------------------------