%------------------------------------------------------------------------------ % File : SPASS-SCL---0.1.1 % Problem : LCL647+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:54 PM UTC 2026 % Result : CounterSatisfiable 20.65s 20.98s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL647+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.09/0.36 % Computer : n016.cluster.edu % 0.09/0.36 % Model : x86_64 x86_64 % 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.36 % Memory : 8046.5625MB % 0.09/0.36 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Sat Sep 5 13:28:59 UTC 2026 % 0.09/0.36 % CPUTime : % 0.09/0.36 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.09/0.37 % 0.09/0.37 % Input Clauses: % 0.09/0.37 % 1:2:2:INP:TopTop: -> r1(x0,x1),ren1(x0,x1) % 0.09/0.37 % 2:2:2:INP:TopTop: p6(x0) -> ren1(x1,x0) % 0.09/0.37 % 3:2:2:INP:TopTop: -> r1(x0,x1),ren2(x0,x1) % 0.09/0.37 % 4:2:2:INP:TopTop: p6(x0) -> ren2(x1,x0) % 0.09/0.37 % 5:2:2:INP:TopTop: -> r1(x0,x1),ren3(x0,x1) % 0.09/0.37 % 6:2:2:INP:TopTop: p4(x0) -> ren3(x1,x0) % 0.09/0.37 % 7:2:2:INP:TopTop: -> r1(x0,x1),ren4(x0,x1) % 0.09/0.37 % 8:2:2:INP:TopTop: p4(x0) -> ren4(x1,x0) % 0.09/0.37 % 9:2:2:INP:TopTop: -> r1(x0,x1),ren5(x0,x1) % 0.09/0.37 % 10:2:2:INP:TopTop: p2(x0) -> ren5(x1,x0) % 0.09/0.37 % 11:2:2:INP:TopTop: -> r1(x0,x1),ren6(x0,x1) % 0.09/0.37 % 12:2:2:INP:TopTop: p2(x0) -> ren6(x1,x0) % 0.09/0.37 % 13:2:2:INP:TopTop: -> r1(x0,x1),ren7(x0,x1) % 0.09/0.37 % 14:2:2:INP:TopTop: p3(x0) -> ren7(x1,x0) % 0.09/0.37 % 15:2:2:INP:TopTop: -> r1(x0,x1),ren8(x0,x1) % 0.09/0.37 % 16:2:2:INP:TopTop: p1(x0) -> ren8(x1,x0) % 0.09/0.37 % 17:2:2:INP:TopTop: -> r1(x0,x1),ren9(x0,x1) % 0.09/0.37 % 18:2:2:INP:TopTop: p3(x0) -> ren9(x1,x0) % 0.09/0.37 % 19:2:2:INP:TopTop: -> r1(x0,x1),ren10(x0,x1) % 0.09/0.37 % 20:2:2:INP:TopTop: p1(x0) -> ren10(x1,x0) % 0.09/0.37 % 21:2:2:INP:TopTop: -> r1(x0,x1),ren11(x0,x1) % 0.09/0.37 % 22:2:2:INP:TopTop: p3(x0) -> ren11(x1,x0) % 0.09/0.37 % 23:2:2:INP:TopTop: -> r1(x0,x1),ren12(x0,x1) % 0.09/0.37 % 24:2:2:INP:TopTop: p1(x0) -> ren12(x1,x0) % 0.09/0.37 % 25:3:2:INP:TopTop: r1(skc1,x0),r1(x0,x1) -> p6(x1) % 0.09/0.37 % 26:3:2:INP:TopTop: r1(skc1,x0),r1(x0,x1) -> p5(x1) % 0.09/0.37 % 27:3:2:INP:TopTop: r1(skc1,x0),r1(x0,x1) -> p4(x1) % 0.09/0.37 % 28:3:2:INP:TopTop: r1(skc1,x0),r1(x0,x1) -> p2(x1) % 0.09/0.37 % 29:3:1:INP:Top: r1(skc1,x0),ren1(x0,skf2(x0)) -> p6(x0) % 0.09/0.37 % 30:3:1:INP:Top: r1(skc1,x0),ren2(x0,skf3(x0)) -> p4(x0) % 0.09/0.37 % 31:3:1:INP:Top: r1(skc1,x0),ren3(x0,skf4(x0)) -> p6(x0) % 0.09/0.37 % 32:3:1:INP:Top: r1(skc1,x0),ren4(x0,skf5(x0)) -> p4(x0) % 0.09/0.37 % 33:3:1:INP:Top: r1(skc1,x0),ren5(x0,skf6(x0)) -> p6(x0) % 0.09/0.37 % 34:3:1:INP:Top: r1(skc1,x0),ren6(x0,skf7(x0)) -> p4(x0) % 0.09/0.37 % 35:3:1:INP:Top: r1(skc1,x0),ren7(x0,skf8(x0)) -> p5(x0) % 0.09/0.37 % 36:3:1:INP:Top: r1(skc1,x0),ren8(x0,skf9(x0)) -> p5(x0) % 0.09/0.37 % 37:3:1:INP:Top: r1(skc1,x0),ren9(x0,skf10(x0)) -> p3(x0) % 0.09/0.37 % 38:3:1:INP:Top: r1(skc1,x0),ren10(x0,skf11(x0)) -> p3(x0) % 0.09/0.37 % 39:3:1:INP:Top: r1(skc1,x0),ren11(x0,skf12(x0)) -> p1(x0) % 0.09/0.37 % 40:3:1:INP:Top: r1(skc1,x0),ren12(x0,skf13(x0)) -> p1(x0) % 0.09/0.37 % 41:1:0:INP:: -> r1(skc1,skc14) % 0.09/0.37 % 42:1:0:INP:: p5(skc14) -> % 0.09/0.37 % 43:1:0:INP:: -> r1(skc1,skc15) % 0.09/0.37 % 44:1:0:INP:: p3(skc15) -> % 0.09/0.37 % 45:1:0:INP:: -> r1(skc1,skc16) % 0.09/0.37 % 46:1:0:INP:: p2(skc16) -> % 0.09/0.37 % 47:1:0:INP:: -> r1(skc1,skc17) % 0.09/0.37 % 48:1:0:INP:: p1(skc17) -> % 0.09/0.37 % 0.09/0.37 % Predicates: r1 p6 p5 p4 p2 p3 p1 ren1 ren2 ren3 ren4 ren5 ren6 ren7 ren8 ren9 ren10 ren11 ren12 % 0.09/0.37 % Fol Constants: skc1 skc14 skc15 skc16 skc17 % 0.09/0.37 % Fol Functions: skf2 skf3 skf4 skf5 skf6 skf7 skf8 skf9 skf10 skf11 skf12 skf13 % 0.09/0.37 % Problem Properties: % 0.09/0.37 % This is a full first-order problem without equality. The Problem is non-linear. % 0.09/0.37 % 0.09/0.37 % 0.09/0.37 % Reduced Input Axiom Clauses: % 0.09/0.37 % 1:2:2:INP:TopTop: -> r1(x0,x1),ren1(x0,x1) % 0.09/0.37 % 2:2:2:INP:TopTop: p6(x0) -> ren1(x1,x0) % 0.09/0.37 % 3:2:2:INP:TopTop: -> r1(x0,x1),ren2(x0,x1) % 0.09/0.37 % 4:2:2:INP:TopTop: p6(x0) -> ren2(x1,x0) % 0.09/0.37 % 5:2:2:INP:TopTop: -> r1(x0,x1),ren3(x0,x1) % 0.09/0.37 % 6:2:2:INP:TopTop: p4(x0) -> ren3(x1,x0) % 0.09/0.37 % 7:2:2:INP:TopTop: -> r1(x0,x1),ren4(x0,x1) % 0.09/0.37 % 8:2:2:INP:TopTop: p4(x0) -> ren4(x1,x0) % 0.09/0.37 % 9:2:2:INP:TopTop: -> r1(x0,x1),ren5(x0,x1) % 0.09/0.37 % 10:2:2:INP:TopTop: p2(x0) -> ren5(x1,x0) % 0.09/0.37 % 11:2:2:INP:TopTop: -> r1(x0,x1),ren6(x0,x1) % 0.09/0.37 % 12:2:2:INP:TopTop: p2(x0) -> ren6(x1,x0) % 0.09/0.37 % 13:2:2:INP:TopTop: -> r1(x0,x1),ren7(x0,x1) % 0.09/0.37 % 14:2:2:INP:TopTop: p3(x0) -> ren7(x1,x0) % 0.09/0.37 % 15:2:2:INP:TopTop: -> r1(x0,x1),ren8(x0,x1) % 0.09/0.37 % 16:2:2:INP:TopTop: p1(x0) -> ren8(x1,x0) % 0.09/0.37 % 17:2:2:INP:TopTop: -> r1(x0,x1),ren9(x0,x1) % 0.09/0.37 % 18:2:2:INP:TopTop: p3(x0) -> ren9(x1,x0) % 0.09/0.37 % 19:2:2:INP:TopTop: -> r1(x0,x1),ren10(x0,x1) % 0.09/0.37 % 20:2:2:INP:TopTop: p1(x0) -> ren10(x1,x0) % 0.09/0.37 % 21:2:2:INP:TopTop: -> r1(x0,x1),ren11(x0,x1) % 0.09/0.37 % 22:2:2:INP:TopTop: p3(x0) -> ren11(x1,x0) % 0.09/0.37 % 23:2:2:INP:TopTop: -> r1(x0,x1),ren12(x0,x1) % 0.09/0.37 % 24:2:2:INP:TopTop: p1(x0) -> ren12(x1,x0) % 0.09/0.37 % 0.09/0.37 % Reduced Input Conjecture Clauses: % 0.09/0.37 % 25:3:2:INP:TopTop: r1(skc1,x0),r1(x0,x1) -> p6(x1) % 0.09/0.37 % 26:3:2:INP:TopTop: r1(skc1,x0),r1(x0,x1) -> p5(x1) % 0.09/0.37 % 27:3:2:INP:TopTop: r1(skc1,x0),r1(x0,x1) -> p4(x1) % 0.09/0.37 % 28:3:2:INP:TopTop: r1(skc1,x0),r1(x0,x1) -> p2(x1) % 0.09/0.37 % 29:3:1:INP:Top: r1(skc1,x0),ren1(x0,skf2(x0)) -> p6(x0) % 0.09/0.37 % 30:3:1:INP:Top: r1(skc1,x0),ren2(x0,skf3(x0)) -> p4(x0) % 0.09/0.37 % 31:3:1:INP:Top: r1(skc1,x0),ren3(x0,skf4(x0)) -> p6(x0) % 20.65/20.98 % 32:3:1:INP:Top: r1(skc1,x0),ren4(x0,skf5(x0)) -> p4(x0) % 20.65/20.98 % 33:3:1:INP:Top: r1(skc1,x0),ren5(x0,skf6(x0)) -> p6(x0) % 20.65/20.98 % 34:3:1:INP:Top: r1(skc1,x0),ren6(x0,skf7(x0)) -> p4(x0) % 20.65/20.98 % 35:3:1:INP:Top: r1(skc1,x0),ren7(x0,skf8(x0)) -> p5(x0) % 20.65/20.98 % 36:3:1:INP:Top: r1(skc1,x0),ren8(x0,skf9(x0)) -> p5(x0) % 20.65/20.98 % 37:3:1:INP:Top: r1(skc1,x0),ren9(x0,skf10(x0)) -> p3(x0) % 20.65/20.98 % 38:3:1:INP:Top: r1(skc1,x0),ren10(x0,skf11(x0)) -> p3(x0) % 20.65/20.98 % 39:3:1:INP:Top: r1(skc1,x0),ren11(x0,skf12(x0)) -> p1(x0) % 20.65/20.98 % 40:3:1:INP:Top: r1(skc1,x0),ren12(x0,skf13(x0)) -> p1(x0) % 20.65/20.98 % 41:1:0:INP:: -> r1(skc1,skc14) % 20.65/20.98 % 42:1:0:INP:: p5(skc14) -> % 20.65/20.98 % 43:1:0:INP:: -> r1(skc1,skc15) % 20.65/20.98 % 44:1:0:INP:: p3(skc15) -> % 20.65/20.98 % 45:1:0:INP:: -> r1(skc1,skc16) % 20.65/20.98 % 46:1:0:INP:: p2(skc16) -> % 20.65/20.98 % 47:1:0:INP:: -> r1(skc1,skc17) % 20.65/20.98 % 48:1:0:INP:: p1(skc17) -> % 20.65/20.98 % 20.65/20.98 % 20.65/20.98 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 104 atoms initially. Used heuristic: lmodel_grow === % 20.65/20.98 % 20.65/20.98 % 20.65/20.98 % 20.65/20.98 % Linear Model Building succeeded. % 20.65/20.98 % SZS status CounterSatisfiable % 20.65/20.98 % 20.65/20.98 % 20.65/20.98 % SZS status CounterSatisfiable % 20.65/20.98 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 20.65/20.98 % 20.65/20.98 % SPASS-SCL-FOL Statistics: % 20.65/20.98 % Number of learned clauses: 76 % 20.65/20.98 % Number of propagations: 63605 % 20.65/20.98 % Number of decisions: 19996 % 20.65/20.98 % Number of resolutions: 97 % 20.65/20.98 % Number of condensations: 8 % 20.65/20.98 % Number of sub resolutions: 14 % 20.65/20.98 % 20.65/20.98 % Solver is done. Empty clause found % 20.65/20.98 % 20.65/20.98 % Needed: 0:0:20.60 % 20.65/20.98 % 20.65/20.98 % ### % 20.65/20.98 % ### Pagesize: 8192 % 20.65/20.98 % ### Marksize: 0 % 20.65/20.98 % ### Memory demanded: 200175 KBytes % 20.65/20.98 % ### Memory freed: 200175 KBytes % 20.65/20.98 % ### Memory remaining: 0 Bytes % 20.65/20.98 % ### Pages allocated: 8872 Pages % 20.65/20.98 % ### %------------------------------------------------------------------------------