%------------------------------------------------------------------------------ % File : SPASS-SCL---0.1.1 % Problem : LCL655+1.001 : TPTP v9.3.1. Released v4.0.0. % Transfm : none % Format : tptp % Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % Computer : n028.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:58 PM UTC 2026 % Result : CounterSatisfiable 9.25s 9.57s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL655+1.001 : TPTP v9.3.1. Released v4.0.0. % 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 0.07/0.34 % Computer : n028.cluster.edu % 0.07/0.34 % Model : x86_64 x86_64 % 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.34 % Memory : 8046.5625MB % 0.07/0.34 % OS : Linux 6.8.0-71-generic % 0.07/0.34 % CPULimit : 300 % 0.07/0.34 % WCLimit : 300 % 0.07/0.34 % DateTime : Fri Sep 4 22:00:28 UTC 2026 % 0.07/0.35 % CPUTime : % 0.07/0.35 Running /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 9.25/9.57 % 9.25/9.57 % Input Clauses: % 9.25/9.57 % 1:1:1:INP:Top: -> r1(x0,x0) % 9.25/9.57 % 2:2:2:INP:TopTop: -> r1(x0,x1),ren1(x0,x1) % 9.25/9.57 % 3:2:2:INP:TopTop: p1(x0) -> ren1(x1,x0) % 9.25/9.57 % 4:2:2:INP:TopTop: -> r1(x0,x1),ren2(x0,x1) % 9.25/9.57 % 5:2:2:INP:TopTop: p1(x0) -> ren2(x1,x0) % 9.25/9.57 % 6:3:3:INP:TopTopTop: r1(x0,x1) -> p1(x1),ren2(x2,x0) % 9.25/9.57 % 7:2:2:INP:TopTop: -> r1(x0,x1),ren3(x0,x1) % 9.25/9.57 % 8:2:2:INP:TopTop: p1(x0) -> ren3(x1,x0) % 9.25/9.57 % 9:2:2:INP:TopTop: -> r1(x0,skf1(x0)),ren3(x1,x0) % 9.25/9.57 % 10:2:2:INP:TopTop: -> p1(skf1(x0)),ren3(x1,x0) % 9.25/9.57 % 11:2:2:INP:TopTop: -> r1(x0,x1),ren4(x0,x1) % 9.25/9.57 % 12:2:2:INP:TopTop: p1(x0) -> ren4(x1,x0) % 9.25/9.57 % 13:2:2:INP:TopTop: -> r1(x0,x1),ren5(x0,x1) % 9.25/9.57 % 14:2:2:INP:TopTop: -> p1(x0),ren5(x1,x0) % 9.25/9.57 % 15:2:2:INP:TopTop: -> r1(x0,x1),ren6(x0,x1) % 9.25/9.57 % 16:3:3:INP:TopTopTop: r1(x0,x1),p1(x1) -> ren6(x2,x0) % 9.25/9.57 % 17:2:2:INP:TopTop: -> r1(x0,x1),ren7(x0,x1) % 9.25/9.57 % 18:2:2:INP:TopTop: p1(x0) -> ren7(x1,x0) % 9.25/9.57 % 19:6:3:INP:TopTopTop: r1(skc2,x0),r1(x0,x1),r1(x1,x2),ren1(x2,skf3(x2)),ren2(x0,skf4(x0)) -> p1(x2) % 9.25/9.57 % 20:7:4:INP:TopTopTopTop: r1(skc2,x0),r1(x0,x1),r1(x1,x2),r1(x2,x3),p1(x3),ren3(x0,skf5(x0)) -> p1(x2) % 9.25/9.57 % 21:3:1:INP:Top: r1(skc2,x0),ren4(x0,skf6(x0)) -> p1(x0) % 9.25/9.57 % 22:5:3:INP:TopTopTop: r1(skc2,x0),r1(x0,x1),r1(x1,x2),ren5(x2,skf7(x2)),ren6(x0,skf8(x0)) -> % 9.25/9.57 % 23:5:3:INP:TopTopTop: r1(skc2,x0),r1(x0,x1),r1(x1,x2),ren7(x0,skf9(x0)) -> p1(x2) % 9.25/9.57 % 24:1:0:INP:: -> r1(skc2,skc10) % 9.25/9.57 % 25:1:0:INP:: -> r1(skc10,skc11) % 9.25/9.57 % 26:2:1:INP:Top: r1(skc11,x0) -> p1(x0) % 9.25/9.57 % 27:1:0:INP:: -> r1(skc10,skc12) % 9.25/9.57 % 28:1:0:INP:: p1(skc12) -> % 9.25/9.57 % 9.25/9.57 % Predicates: r1 p1 ren1 ren2 ren3 ren4 ren5 ren6 ren7 % 9.25/9.57 % Fol Constants: skc2 skc10 skc11 skc12 % 9.25/9.57 % Fol Functions: skf1 skf3 skf4 skf5 skf6 skf7 skf8 skf9 % 9.25/9.57 % Problem Properties: % 9.25/9.57 % This is a full first-order problem without equality. The Problem is non-linear. % 9.25/9.57 % 9.25/9.57 % 9.25/9.57 % Reduced Input Axiom Clauses: % 9.25/9.57 % 1:1:1:INP:Top: -> r1(x0,x0) % 9.25/9.57 % 2:2:2:INP:TopTop: -> r1(x0,x1),ren1(x0,x1) % 9.25/9.57 % 3:2:2:INP:TopTop: p1(x0) -> ren1(x1,x0) % 9.25/9.57 % 4:2:2:INP:TopTop: -> r1(x0,x1),ren2(x0,x1) % 9.25/9.57 % 5:2:2:INP:TopTop: p1(x0) -> ren2(x1,x0) % 9.25/9.57 % 6:3:3:INP:TopTopTop: r1(x0,x1) -> p1(x1),ren2(x2,x0) % 9.25/9.57 % 7:2:2:INP:TopTop: -> r1(x0,x1),ren3(x0,x1) % 9.25/9.57 % 8:2:2:INP:TopTop: p1(x0) -> ren3(x1,x0) % 9.25/9.57 % 9:2:2:INP:TopTop: -> r1(x0,skf1(x0)),ren3(x1,x0) % 9.25/9.57 % 10:2:2:INP:TopTop: -> p1(skf1(x0)),ren3(x1,x0) % 9.25/9.57 % 11:2:2:INP:TopTop: -> r1(x0,x1),ren4(x0,x1) % 9.25/9.57 % 12:2:2:INP:TopTop: p1(x0) -> ren4(x1,x0) % 9.25/9.57 % 13:2:2:INP:TopTop: -> r1(x0,x1),ren5(x0,x1) % 9.25/9.57 % 14:2:2:INP:TopTop: -> p1(x0),ren5(x1,x0) % 9.25/9.57 % 15:2:2:INP:TopTop: -> r1(x0,x1),ren6(x0,x1) % 9.25/9.57 % 16:3:3:INP:TopTopTop: r1(x0,x1),p1(x1) -> ren6(x2,x0) % 9.25/9.57 % 17:2:2:INP:TopTop: -> r1(x0,x1),ren7(x0,x1) % 9.25/9.57 % 18:2:2:INP:TopTop: p1(x0) -> ren7(x1,x0) % 9.25/9.57 % 9.25/9.57 % Reduced Input Conjecture Clauses: % 9.25/9.57 % 19:6:3:INP:TopTopTop: r1(skc2,x0),r1(x0,x1),r1(x1,x2),ren1(x2,skf3(x2)),ren2(x0,skf4(x0)) -> p1(x2) % 9.25/9.57 % 20:7:4:INP:TopTopTopTop: r1(skc2,x0),r1(x0,x1),r1(x1,x2),r1(x2,x3),p1(x3),ren3(x0,skf5(x0)) -> p1(x2) % 9.25/9.57 % 21:3:1:INP:Top: r1(skc2,x0),ren4(x0,skf6(x0)) -> p1(x0) % 9.25/9.57 % 22:5:3:INP:TopTopTop: r1(skc2,x0),r1(x0,x1),r1(x1,x2),ren5(x2,skf7(x2)),ren6(x0,skf8(x0)) -> % 9.25/9.57 % 23:5:3:INP:TopTopTop: r1(skc2,x0),r1(x0,x1),r1(x1,x2),ren7(x0,skf9(x0)) -> p1(x2) % 9.25/9.57 % 24:1:0:INP:: -> r1(skc2,skc10) % 9.25/9.57 % 25:1:0:INP:: -> r1(skc10,skc11) % 9.25/9.57 % 26:2:1:INP:Top: r1(skc11,x0) -> p1(x0) % 9.25/9.57 % 27:1:0:INP:: -> r1(skc10,skc12) % 9.25/9.57 % 28:1:0:INP:: p1(skc12) -> % 9.25/9.57 % 9.25/9.57 % 9.25/9.57 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 56 atoms initially. Used heuristic: lmodel_grow === % 9.25/9.57 % 9.25/9.57 % 9.25/9.57 % 9.25/9.57 % Linear Model Building succeeded. % 9.25/9.57 % SZS status CounterSatisfiable % 9.25/9.57 % 9.25/9.57 % 9.25/9.57 % SZS status CounterSatisfiable % 9.25/9.57 % Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 9.25/9.57 % 9.25/9.57 % SPASS-SCL-FOL Statistics: % 9.25/9.57 % Number of learned clauses: 32 % 9.25/9.57 % Number of propagations: 22111 % 9.25/9.57 % Number of decisions: 8428 % 9.25/9.57 % Number of resolutions: 38 % 9.25/9.57 % Number of condensations: 2 % 9.25/9.57 % Number of sub resolutions: 3 % 9.25/9.57 % 9.25/9.57 % Solver is done. Empty clause found % 9.25/9.57 % 9.25/9.57 % Needed: 0:00:09.21 % 9.25/9.57 % 9.25/9.57 % ### % 9.25/9.57 % ### Pagesize: 8192 % 9.25/9.57 % ### Marksize: 0 % 9.25/9.57 % ### Memory demanded: 53839 KBytes % 9.25/9.57 % ### Memory freed: 53839 KBytes % 9.25/9.57 % ### Memory remaining: 0 Bytes % 9.25/9.57 % ### Pages allocated: 3726 Pages % 9.25/9.57 % ### %------------------------------------------------------------------------------