%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN550+1 : TPTP v9.2.1. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n001.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:40:00 PM UTC 2026
% Result : Theorem 1.87s 0.91s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN550+1 : TPTP v9.2.1. Released v2.2.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.34 % Computer : n001.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Thu May 7 13:46:34 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 SPASS-SCL-FOL version:
% 0.20/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 1.87/0.91 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.87/0.91 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.87/0.91 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.87/0.91 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.87/0.91 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.87/0.91 Execution resolution_3 ended with status: unsatisfiable
% 1.87/0.91 Used heuristic: resolution_3
% 1.87/0.91
% 1.87/0.91 Input Clauses:
% 1.87/0.91
% 1.87/0.91 Predicates: reachable p ren1 ren2 ren3 ren4
% 1.87/0.91 Fol Constants: initial_world skc5 skc6
% 1.87/0.91 Fol Functions: skf1 skf2 skf3 skf4
% 1.87/0.91 Problem Properties:
% 1.87/0.91 This is a full first-order problem without equality.
% 1.87/0.91
% 1.87/0.91 After reduction: Problem Properties:
% 1.87/0.91 This is a full first-order problem without equality.
% 1.87/0.91
% 1.87/0.91
% 1.87/0.91 Reduced Input Clauses:
% 1.87/0.91
% 1.87/0.91 Most General Atoms: reachable(x0,x2) p(x0) ren1(x1,x0) ren3(x0,x1) ren2(x1,x2) ren4(x2,x0)
% 1.87/0.91
% 1.87/0.91 === Starting SPASS-SCL-FOL A Little Less Naive, considering 21 atoms initially, heuristics mode: resolution_3 ===
% 1.87/0.91
% 1.87/0.91 === Backtracking. Learning clause 20:4:3:[11.2,8.2,10.1,6.1]:TopTopTop: reachable(x0,x1),p(skf1(x1)),reachable(x1,x2) -> p(x2)
% 1.87/0.91 === Backtracking. Learning clause 21:3:2:[7.2,11.2]:TopTop: reachable(x0,x1) -> reachable(x1,skf1(x1)),ren3(x0,x1)
% 1.87/0.91 === Backtracking. Learning clause 22:3:3:[10.1,12.3]:TopTopTop: ren4(x0,x1),reachable(x0,x1) -> ren2(skf2(x1),x2)
% 1.87/0.91 === Backtracking. Learning clause 23:3:2:[9.1,12.3]:TopTop: ren4(x0,x1),reachable(x0,x1) -> reachable(x1,skf2(x1))
% 1.87/0.91 === Backtracking. Learning clause 24:4:2:[15.4,13.2]:TopTop: reachable(initial_world,x0),ren1(x0,skf3(x0)),reachable(initial_world,x1) -> reachable(x1,skf4(x1))
% 1.87/0.91 === Clause set with instances from active satisfied. Growing active. New size: 28
% 1.87/0.91 === Restarting.
% 1.87/0.91 === Conflict found: 24:4:2:[15.4,13.2]:TopTop: reachable(initial_world,x0),ren1(x0,skf3(x0)),reachable(initial_world,x1) -> reachable(x1,skf4(x1)) {x0 -> initial_world, x1 -> initial_world}
% 1.87/0.91 === Backtracking. Learning clause 25:4:2:[24.2,5.2]:TopTop: reachable(initial_world,x0),reachable(initial_world,x1),p(skf3(x0)) -> reachable(x1,skf4(x1))
% 1.87/0.91 === Backtracking. Learning clause 26:4:3:[6.1,22.3]:TopTopTop: reachable(skf2(x0),x1),ren4(x2,x0),reachable(x2,x0) -> p(x1)
% 1.87/0.91 === Backtracking. Learning clause 28:3:1:[16.1,27.1,15.4,17.2,5.2]:Top: reachable(initial_world,x0),p(skf3(x0)) -> reachable(initial_world,skc5)
% 1.87/0.91 === Conflict found: 24:4:2:[15.4,13.2]:TopTop: reachable(initial_world,x0),ren1(x0,skf3(x0)),reachable(initial_world,x1) -> reachable(x1,skf4(x1)) {x0 -> initial_world, x1 -> initial_world}
% 1.87/0.91 === Backtracking. Learning clause 29:4:2:[24.2,4.2]:TopTop: reachable(initial_world,x0),reachable(initial_world,x1) -> reachable(x1,skf4(x1)),reachable(x0,skf3(x0))
% 1.87/0.91 === Backtracking. Learning clause 31:3:1:[16.1,30.1,15.4,17.2,4.2]:Top: reachable(initial_world,x0) -> reachable(initial_world,skc5),reachable(x0,skf3(x0))
% 1.87/0.91 === Clause set with instances from active satisfied. Growing active. New size: 39
% 1.87/0.91 === Restarting.
% 1.87/0.91 === Conflict found: 26:4:3:[6.1,22.3]:TopTopTop: reachable(skf2(x0),x1),ren4(x2,x0),reachable(x2,x0) -> p(x1) {x0 -> initial_world, x1 -> skf2(initial_world), x2 -> initial_world}
% 1.87/0.91 === Backtracking. Learning clause 32:3:2:[26.1,1.1]:TopTop: ren4(x0,x1),reachable(x0,x1) -> p(skf2(x1))
% 1.87/0.91 === Clause set with instances from active satisfied. Growing active. New size: 40
% 1.87/0.91 === Restarting.
% 1.87/0.91 === Conflict found: 32:3:2:[26.1,1.1]:TopTop: ren4(x0,x1),reachable(x0,x1) -> p(skf2(x1)) {x0 -> skc6, x1 -> initial_world}
% 1.87/0.91 === Backtracking. Learning clause 33:3:1:[32.1,17.2]:Top: reachable(skc6,x0) -> p(skf2(x0)),reachable(initial_world,skc5)
% 1.87/0.91 === Conflict found: 26:4:3:[6.1,22.3]:TopTopTop: reachable(skf2(x0),x1),ren4(x2,x0),reachable(x2,x0) -> p(x1) {x0 -> initial_world, x1 -> skf3(skf2(initial_world)), x2 -> skc6}
% 1.87/0.91 === Backtracking. Learning clause 34:4:1:[26.1,31.3,28.2,23.3,17.2]:Top: reachable(skc6,initial_world),ren4(x0,initial_world),reachable(x0,initial_world) -> reachable(initial_world,skc5)
% 1.87/0.91 === Conflict found: 34:4:1:[26.1,31.3,28.2,23.3,17.2]:Top: reachable(skc6,initial_world),ren4(x0,initial_world),reachable(x0,initial_world) -> reachable(initial_world,skc5) {x0 -> skc6}
% 1.87/0.91 === Backtracking. Learning clause 35:2:0:[34.2,17.2]:: reachable(skc6,initial_world) -> reachable(initial_world,skc5)
% 1.87/0.91 === Clause set with instances from active satisfied. Growing active. New size: 100
% 1.87/0.91 === Clause set with instances from active satisfied. Growing active. New size: 164
% 1.87/0.91 === Clause set with instances from active satisfied. Growing active. New size: 228
% 1.87/0.91 === Clause set with instances from active satisfied. Growing active. New size: 292
% 1.87/0.91 === Backtracking. Learning clause 36:4:3:[2.2,21.2]:TopTopTop: reachable(x0,x1),reachable(x2,x1) -> reachable(x0,skf1(x1)),ren3(x2,x1)
% 1.87/0.91 === Backtracking. Learning clause 38:3:1:[16.1,37.2,15.4,17.2]:Top: reachable(initial_world,x0),ren1(x0,skf3(x0)) -> reachable(initial_world,skc5)
% 1.87/0.91 === Conflict found: 26:4:3:[6.1,22.3]:TopTopTop: reachable(skf2(x0),x1),ren4(x2,x0),reachable(x2,x0) -> p(x1) {x0 -> initial_world, x1 -> skf3(skf2(initial_world)), x2 -> initial_world}
% 1.87/0.91 === Backtracking. Learning clause 39:3:1:[26.1,31.3,28.2,23.3]:Top: ren4(x0,initial_world),reachable(x0,initial_world) -> reachable(initial_world,skc5)
% 1.87/0.91 === Clause set with instances from active satisfied. Growing active. New size: 356
% 1.87/0.91 === Clause set with instances from active satisfied. Growing active. New size: 420
% 1.87/0.91 === Conflict found: 26:4:3:[6.1,22.3]:TopTopTop: reachable(skf2(x0),x1),ren4(x2,x0),reachable(x2,x0) -> p(x1) {x0 -> skc6, x1 -> skf3(skf2(skc6)), x2 -> skc5}
% 1.87/0.91 === Backtracking. Learning clause 40:4:2:[26.4,28.2,31.3,7.1]:TopTop: ren4(x0,x1),reachable(initial_world,skf2(x1)) -> reachable(initial_world,skc5),ren2(x0,x1)
% 1.87/0.91 === Conflict found: 26:4:3:[6.1,22.3]:TopTopTop: reachable(skf2(x0),x1),ren4(x2,x0),reachable(x2,x0) -> p(x1) {x0 -> skc6, x1 -> skf3(skf2(skc6)), x2 -> skc6}
% 1.87/0.91 === Backtracking. Learning clause 41:1:0:[26.4,28.2,31.3,2.3,23.3,1.1,16.2,17.2]:: -> reachable(initial_world,skc5)
% 1.87/0.91 === Backtracking. Learning clause 42:2:2:[12.2,1.1,14.1]:TopTop: ren4(x0,x0) -> ren4(x1,x0)
% 1.87/0.91 === Backtracking. Learning clause 43:2:2:[6.2,4.1,5.1]:TopTop: ren2(x0,x1) -> ren1(x0,x1)
% 1.87/0.91 === Backtracking. Learning clause 44:6:6:[8.1,3.3,11.2,36.3,14.1,26.2,8.1]:TopTopTopTopTopTop: ren1(x0,skf1(x1)),reachable(x0,x1),reachable(x2,x1),reachable(skf2(x2),x3),reachable(x4,x2) -> ren2(x5,x3)
% 1.87/0.91 === Backtracking. Learning clause 45:4:4:[3.3,8.1,36.3,11.2,14.1]:TopTopTopTop: ren1(x0,skf1(x1)),reachable(x0,x1),reachable(x2,x1) -> ren4(x3,x2)
% 1.87/0.91 === Conflict found: 21:3:2:[7.2,11.2]:TopTop: reachable(x0,x1) -> reachable(x1,skf1(x1)),ren3(x0,x1) {x0 -> skc5, x1 -> skc5}
% 1.87/0.91 === Backtracking. Learning clause 46:2:1:[21.1,1.1]:Top: -> reachable(x0,skf1(x0)),ren3(x0,x0)
% 1.87/0.91 === Conflict found: 45:4:4:[3.3,8.1,36.3,11.2,14.1]:TopTopTopTop: ren1(x0,skf1(x1)),reachable(x0,x1),reachable(x2,x1) -> ren4(x3,x2) {x0 -> skc5, x1 -> skc5, x2 -> skc5, x3 -> initial_world}
% 1.87/0.91 === Backtracking. Learning clause 47:3:3:[45.1,19.1,12.1,14.1,1.1]:TopTopTop: reachable(x0,skc5) -> ren4(skc6,x1),ren4(x2,skc5)
% 1.87/0.91 === Backtracking. Learning clause 48:5:4:[18.2,15.3,45.1,47.2]:TopTopTopTop: reachable(initial_world,x0),ren1(x0,skf3(x0)),reachable(skc5,x1),reachable(x2,skc5) -> ren4(x3,skc5)
% 1.87/0.91 === Backtracking. Learning clause 49:4:4:[8.1,20.4]:TopTopTopTop: reachable(x0,x1),p(skf1(x1)),reachable(x1,x2) -> ren2(x3,x2)
% 1.87/0.91 === Clause set with instances from active satisfied. Growing active. New size: 484
% 1.87/0.91 === Backtracking. Learning clause 50:3:3:[5.2,45.1]:TopTopTop: p(skf1(x0)),reachable(x1,x0) -> ren4(x2,x1)
% 1.87/0.91 === Conflict found: 45:4:4:[3.3,8.1,36.3,11.2,14.1]:TopTopTopTop: ren1(x0,skf1(x1)),reachable(x0,x1),reachable(x2,x1) -> ren4(x3,x2) {x0 -> skc5, x1 -> skf4(skc5), x2 -> skf4(skc5), x3 -> skf4(skc5)}
% 1.87/0.91 === Backtracking. Learning clause 52:3:1:[38.2,51.0,45.3,1.1,42.1,24.4,15.4,18.1,15.3]:Top: reachable(initial_world,x0),ren1(x0,skf3(x0)),ren4(skc6,skf4(skc6)) ->
% 1.87/0.91 === Conflict found: 45:4:4:[3.3,8.1,36.3,11.2,14.1]:TopTopTopTop: ren1(x0,skf1(x1)),reachable(x0,x1),reachable(x2,x1) -> ren4(x3,x2) {x0 -> skc5, x1 -> skc5, x2 -> skc5, x3 -> skc5}
% 1.87/0.91 === Backtracking. Learning clause 53:2:2:[45.2,1.1,19.1]:TopTop: -> ren4(x0,skc5),ren4(skc6,x1)
% 1.87/0.91 === Conflict found: 26:4:3:[6.1,22.3]:TopTopTop: reachable(skf2(x0),x1),ren4(x2,x0),reachable(x2,x0) -> p(x1) {x0 -> skc6, x1 -> skf3(skf2(skc6)), x2 -> skc6}
% 1.87/0.91 === Backtracking. Learning clause 54:1:1:[26.4,5.1,4.1,48.2,2.3,23.3,1.1,53.2,12.1,41.1,14.1,18.2,45.1,1.1]:Top: -> ren4(x0,skc5)
% 1.87/0.91 === Backtracking. Learning clause 56:5:3:[41.0,55.0,19.1,15.2,26.2]:TopTopTop: reachable(initial_world,x0),ren4(x0,skf4(x0)),reachable(skf2(x1),x2),reachable(skc6,x1) -> p(x2)
% 1.87/0.91 === Conflict found: 52:3:1:[38.2,51.0,45.3,1.1,42.1,24.4,15.4,18.1,15.3]:Top: reachable(initial_world,x0),ren1(x0,skf3(x0)),ren4(skc6,skf4(skc6)) -> {x0 -> skf2(skc6)}
% 1.87/0.91 === Backtracking. Learning clause 57:5:2:[52.2,5.2,2.3,23.3]:TopTop: ren4(skc6,skf4(skc6)),p(skf3(skf2(x0))),reachable(initial_world,x0),ren4(x1,x0),reachable(x1,x0) ->
% 1.87/0.91 === Backtracking. Learning clause 58:7:3:[4.1,56.3,52.2,2.3,23.3,57.2]:TopTopTop: reachable(initial_world,x0),ren4(x0,skf4(x0)),reachable(skc6,x1),ren4(skc6,skf4(skc6)),reachable(initial_world,x1),ren4(x2,x1),reachable(x2,x1) ->
% 1.87/0.91 === Backtracking. Learning clause 60:5:2:[41.0,59.0,19.1,15.2,58.6]:TopTop: reachable(initial_world,x0),ren4(x0,skf4(x0)),ren4(skc6,skf4(skc6)),reachable(initial_world,x1),reachable(skc6,x1) ->
% 1.87/0.91 === Conflict found: 45:4:4:[3.3,8.1,36.3,11.2,14.1]:TopTopTopTop: ren1(x0,skf1(x1)),reachable(x0,x1),reachable(x2,x1) -> ren4(x3,x2) {x0 -> skc5, x1 -> skf4(skc5), x2 -> skf4(skc5), x3 -> skf4(skc5)}
% 1.87/0.91 === Backtracking. Learning clause 61:1:0:[45.3,1.1,42.1,24.4,15.4,19.1,41.1,19.1,60.2,1.1]:: reachable(initial_world,skc6) ->
% 1.87/0.91 === Conflict found: 52:3:1:[38.2,51.0,45.3,1.1,42.1,24.4,15.4,18.1,15.3]:Top: reachable(initial_world,x0),ren1(x0,skf3(x0)),ren4(skc6,skf4(skc6)) -> {x0 -> skc5}
% 1.87/0.91 === Backtracking. Learning clause 62:2:0:[52.1,41.1]:: ren1(skc5,skf3(skc5)),ren4(skc6,skf4(skc6)) ->
% 1.87/0.91 === Conflict found: 45:4:4:[3.3,8.1,36.3,11.2,14.1]:TopTopTopTop: ren1(x0,skf1(x1)),reachable(x0,x1),reachable(x2,x1) -> ren4(x3,x2) {x0 -> skc5, x1 -> skf4(skc5), x2 -> skf4(skc5), x3 -> skc5}
% 1.87/0.91
% 1.87/0.91 SZS status Unsatisfiable
% 1.87/0.91
% 1.87/0.91 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.87/0.91
% 1.87/0.91 SPASS-SCL-FOL Statistics:
% 1.87/0.91 Number of learned clauses: 37
% 1.87/0.91 Number of propagations: 2162
% 1.87/0.91 Number of decisions: 447
% 1.87/0.91 Number of resolutions: 110
% 1.87/0.91 Number of condensations: 8
% 1.87/0.91 Number of sub resolutions: 6
% 1.87/0.91 Number of input literals (deduplicated): 16
% 1.87/0.91 Number of grows: 10
% 1.87/0.91 Number of considered ground atoms: 484
% 1.87/0.91
% 1.87/0.91 Needed: 0:00:00.36
% 1.87/0.91
%------------------------------------------------------------------------------