%------------------------------------------------------------------------------ % File : SPASS-SCL---0.1.1 % Problem : LCL639+1.001 : TPTP v9.3.1. Released v4.0.0. % Transfm : none % Format : tptp % Command : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % Computer : n016.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Sep 7 01:09:50 PM UTC 2026 % Result : CounterSatisfiable 18.27s 18.50s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL639+1.001 : TPTP v9.3.1. Released v4.0.0. % 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.36 % Computer : n016.cluster.edu % 0.10/0.36 % Model : x86_64 x86_64 % 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.36 % Memory : 8046.5625MB % 0.10/0.36 % OS : Linux 6.8.0-71-generic % 0.10/0.36 % CPULimit : 300 % 0.10/0.36 % WCLimit : 300 % 0.10/0.36 % DateTime : Sat Sep 5 02:46:14 UTC 2026 % 0.10/0.36 % CPUTime : % 0.10/0.36 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % 18.27/18.50 % 18.27/18.50 % Input Clauses: % 18.27/18.50 % 1:2:2:INP:TopTop: -> r1(x0,x1),ren1(x0,x1) % 18.27/18.50 % 2:2:2:INP:TopTop: p1(x0) -> ren1(x1,x0) % 18.27/18.50 % 3:2:2:INP:TopTop: -> r1(x0,x1),ren2(x0,x1) % 18.27/18.50 % 4:2:2:INP:TopTop: p1(x0) -> ren2(x1,x0) % 18.27/18.50 % 5:3:3:INP:TopTopTop: r1(x0,x1) -> p1(x1),ren2(x2,x0) % 18.27/18.50 % 6:2:2:INP:TopTop: -> r1(x0,x1),ren3(x0,x1) % 18.27/18.50 % 7:2:2:INP:TopTop: p1(x0) -> ren3(x1,x0) % 18.27/18.50 % 8:2:2:INP:TopTop: -> r1(x0,skf1(x0)),ren3(x1,x0) % 18.27/18.50 % 9:2:2:INP:TopTop: -> p1(skf1(x0)),ren3(x1,x0) % 18.27/18.50 % 10:2:2:INP:TopTop: -> r1(x0,x1),ren4(x0,x1) % 18.27/18.50 % 11:2:2:INP:TopTop: -> p1(x0),ren4(x1,x0) % 18.27/18.50 % 12:2:2:INP:TopTop: -> r1(x0,x1),ren5(x0,x1) % 18.27/18.50 % 13:2:2:INP:TopTop: p1(x0) -> ren5(x1,x0) % 18.27/18.50 % 14:2:2:INP:TopTop: -> r1(x0,x1),ren6(x0,x1) % 18.27/18.50 % 15:2:2:INP:TopTop: -> p1(x0),ren6(x1,x0) % 18.27/18.50 % 16:2:2:INP:TopTop: -> r1(x0,x1),ren7(x0,x1) % 18.27/18.50 % 17:3:3:INP:TopTopTop: r1(x0,x1),p1(x1) -> ren7(x2,x0) % 18.27/18.50 % 18:2:2:INP:TopTop: -> r1(x0,x1),ren8(x0,x1) % 18.27/18.50 % 19:2:2:INP:TopTop: p1(x0) -> ren8(x1,x0) % 18.27/18.50 % 20:6:3:INP:TopTopTop: r1(skc2,x0),r1(x0,x1),r1(x1,x2),ren1(x2,skf3(x2)),ren2(x0,skf4(x0)) -> p1(x2) % 18.27/18.50 % 21:7:4:INP:TopTopTopTop: r1(skc2,x0),r1(x0,x1),r1(x1,x2),r1(x2,x3),p1(x3),ren3(x0,skf5(x0)) -> p1(x2) % 18.27/18.50 % 22:3:1:INP:Top: r1(skc2,x0),ren4(x0,skf6(x0)),ren5(x0,skf7(x0)) -> % 18.27/18.50 % 23:5:3:INP:TopTopTop: r1(skc2,x0),r1(x0,x1),r1(x1,x2),ren6(x2,skf8(x2)),ren7(x0,skf9(x0)) -> % 18.27/18.50 % 24:5:3:INP:TopTopTop: r1(skc2,x0),r1(x0,x1),r1(x1,x2),ren8(x0,skf10(x0)) -> p1(x2) % 18.27/18.50 % 25:2:1:INP:Top: r1(skc2,x0) -> r1(x0,skf11(x0)) % 18.27/18.50 % 26:1:0:INP:: -> r1(skc2,skc12) % 18.27/18.50 % 27:1:0:INP:: -> r1(skc12,skc13) % 18.27/18.50 % 28:2:1:INP:Top: r1(skc13,x0) -> p1(x0) % 18.27/18.50 % 29:1:0:INP:: -> r1(skc12,skc14) % 18.27/18.50 % 30:1:0:INP:: p1(skc14) -> % 18.27/18.50 % 18.27/18.50 % Predicates: r1 p1 ren1 ren2 ren3 ren4 ren5 ren6 ren7 ren8 % 18.27/18.50 % Fol Constants: skc2 skc12 skc13 skc14 % 18.27/18.50 % Fol Functions: skf1 skf3 skf4 skf5 skf6 skf7 skf8 skf9 skf10 skf11 % 18.27/18.50 % Problem Properties: % 18.27/18.50 % This is a full first-order problem without equality. The Problem is non-linear. % 18.27/18.50 % 18.27/18.50 % 18.27/18.50 % Reduced Input Axiom Clauses: % 18.27/18.50 % 1:2:2:INP:TopTop: -> r1(x0,x1),ren1(x0,x1) % 18.27/18.50 % 2:2:2:INP:TopTop: p1(x0) -> ren1(x1,x0) % 18.27/18.50 % 3:2:2:INP:TopTop: -> r1(x0,x1),ren2(x0,x1) % 18.27/18.50 % 4:2:2:INP:TopTop: p1(x0) -> ren2(x1,x0) % 18.27/18.50 % 5:3:3:INP:TopTopTop: r1(x0,x1) -> p1(x1),ren2(x2,x0) % 18.27/18.50 % 6:2:2:INP:TopTop: -> r1(x0,x1),ren3(x0,x1) % 18.27/18.50 % 7:2:2:INP:TopTop: p1(x0) -> ren3(x1,x0) % 18.27/18.50 % 8:2:2:INP:TopTop: -> r1(x0,skf1(x0)),ren3(x1,x0) % 18.27/18.50 % 9:2:2:INP:TopTop: -> p1(skf1(x0)),ren3(x1,x0) % 18.27/18.50 % 10:2:2:INP:TopTop: -> r1(x0,x1),ren4(x0,x1) % 18.27/18.50 % 11:2:2:INP:TopTop: -> p1(x0),ren4(x1,x0) % 18.27/18.50 % 12:2:2:INP:TopTop: -> r1(x0,x1),ren5(x0,x1) % 18.27/18.50 % 13:2:2:INP:TopTop: p1(x0) -> ren5(x1,x0) % 18.27/18.50 % 14:2:2:INP:TopTop: -> r1(x0,x1),ren6(x0,x1) % 18.27/18.50 % 15:2:2:INP:TopTop: -> p1(x0),ren6(x1,x0) % 18.27/18.50 % 16:2:2:INP:TopTop: -> r1(x0,x1),ren7(x0,x1) % 18.27/18.50 % 17:3:3:INP:TopTopTop: r1(x0,x1),p1(x1) -> ren7(x2,x0) % 18.27/18.50 % 18:2:2:INP:TopTop: -> r1(x0,x1),ren8(x0,x1) % 18.27/18.50 % 19:2:2:INP:TopTop: p1(x0) -> ren8(x1,x0) % 18.27/18.50 % 18.27/18.50 % Reduced Input Conjecture Clauses: % 18.27/18.50 % 20:6:3:INP:TopTopTop: r1(skc2,x0),r1(x0,x1),r1(x1,x2),ren1(x2,skf3(x2)),ren2(x0,skf4(x0)) -> p1(x2) % 18.27/18.50 % 21:7:4:INP:TopTopTopTop: r1(skc2,x0),r1(x0,x1),r1(x1,x2),r1(x2,x3),p1(x3),ren3(x0,skf5(x0)) -> p1(x2) % 18.27/18.50 % 22:3:1:INP:Top: r1(skc2,x0),ren4(x0,skf6(x0)),ren5(x0,skf7(x0)) -> % 18.27/18.50 % 23:5:3:INP:TopTopTop: r1(skc2,x0),r1(x0,x1),r1(x1,x2),ren6(x2,skf8(x2)),ren7(x0,skf9(x0)) -> % 18.27/18.50 % 24:5:3:INP:TopTopTop: r1(skc2,x0),r1(x0,x1),r1(x1,x2),ren8(x0,skf10(x0)) -> p1(x2) % 18.27/18.50 % 25:2:1:INP:Top: r1(skc2,x0) -> r1(x0,skf11(x0)) % 18.27/18.50 % 26:1:0:INP:: -> r1(skc2,skc12) % 18.27/18.50 % 27:1:0:INP:: -> r1(skc12,skc13) % 18.27/18.50 % 28:2:1:INP:Top: r1(skc13,x0) -> p1(x0) % 18.27/18.50 % 29:1:0:INP:: -> r1(skc12,skc14) % 18.27/18.50 % 30:1:0:INP:: p1(skc14) -> % 18.27/18.50 % 18.27/18.50 % 18.27/18.50 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 74 atoms initially. Used heuristic: lmodel_grow === % 18.27/18.50 % 18.27/18.50 % 18.27/18.50 % 18.27/18.50 % Linear Model Building succeeded. % 18.27/18.50 % SZS status CounterSatisfiable % 18.27/18.50 % 18.27/18.50 % 18.27/18.50 % SZS status CounterSatisfiable % 18.27/18.50 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 18.27/18.50 % 18.27/18.50 % SPASS-SCL-FOL Statistics: % 18.27/18.50 % Number of learned clauses: 34 % 18.27/18.50 % Number of propagations: 38626 % 18.27/18.50 % Number of decisions: 12786 % 18.27/18.50 % Number of resolutions: 39 % 18.27/18.50 % Number of condensations: 5 % 18.27/18.50 % Number of sub resolutions: 2 % 18.27/18.50 % 18.27/18.50 % Solver is done. Empty clause found % 18.27/18.50 % 18.27/18.50 % Needed: 0:0:18.13 % 18.27/18.50 % 18.27/18.50 % ### % 18.27/18.50 % ### Pagesize: 8192 % 18.27/18.50 % ### Marksize: 0 % 18.27/18.51 % ### Memory demanded: 107914 KBytes % 18.27/18.51 % ### Memory freed: 107914 KBytes % 18.27/18.51 % ### Memory remaining: 0 Bytes % 18.27/18.51 % ### Pages allocated: 6343 Pages % 18.27/18.51 % ### %------------------------------------------------------------------------------