%------------------------------------------------------------------------------ % File : SPASS-SCL---0.1.1 % Problem : LCL675+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 : n002.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:10:08 PM UTC 2026 % Result : CounterSatisfiable 0.10s 0.40s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL675+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 : n002.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 21:30:06 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 % 0.10/0.40 % 0.10/0.40 % Input Clauses: % 0.10/0.40 % 1:1:1:INP:Top: -> r1(x0,x0) % 0.10/0.40 % 2:3:3:INP:TopTopTop: r1(x0,x1),r1(x1,x2) -> r1(x0,x2) % 0.10/0.40 % 3:2:1:INP:Top: ren1(x0) -> r1(x0,skf1(x0)) % 0.10/0.40 % 4:2:1:INP:Top: ren1(x0),p2(skf1(x0)) -> % 0.10/0.40 % 5:2:1:INP:Top: ren1(x0),p102(skf1(x0)) -> % 0.10/0.40 % 6:2:1:INP:Top: ren1(x0) -> p101(skf1(x0)) % 0.10/0.40 % 7:2:1:INP:Top: ren1(x0) -> r1(x0,skf2(x0)) % 0.10/0.40 % 8:2:1:INP:Top: ren1(x0) -> p2(skf2(x0)) % 0.10/0.40 % 9:2:1:INP:Top: ren1(x0),p102(skf2(x0)) -> % 0.10/0.40 % 10:2:1:INP:Top: ren1(x0) -> p101(skf2(x0)) % 0.10/0.40 % 11:5:2:INP:TopTop: ren2(x0),r1(x0,x1),p2(x1),p101(x1) -> p2(x0) % 0.10/0.40 % 12:5:2:INP:TopTop: ren2(x0),r1(x0,x1),p101(x1),p2(x0) -> p2(x1) % 0.10/0.40 % 13:5:2:INP:TopTop: ren3(x0),r1(x0,x1),p1(x1),p100(x1) -> p1(x0) % 0.10/0.40 % 14:5:2:INP:TopTop: ren3(x0),r1(x0,x1),p100(x1),p1(x0) -> p1(x1) % 0.10/0.40 % 15:4:1:INP:Top: ren4(x0),p100(x0) -> ren1(x0),p101(x0) % 0.10/0.40 % 16:3:1:INP:Top: ren4(x0),p101(x0) -> ren2(x0) % 0.10/0.40 % 17:3:1:INP:Top: ren4(x0),p100(x0) -> ren3(x0) % 0.10/0.40 % 18:3:1:INP:Top: ren4(x0),p102(x0) -> p101(x0) % 0.10/0.40 % 19:3:1:INP:Top: ren4(x0),p101(x0) -> p100(x0) % 0.10/0.40 % 20:2:1:INP:Top: r1(skc3,x0) -> ren4(x0) % 0.10/0.40 % 21:1:0:INP:: p101(skc3) -> % 0.10/0.40 % 22:1:0:INP:: -> p100(skc3) % 0.10/0.40 % 0.10/0.40 % Predicates: r1 p2 p102 p101 p100 p1 ren1 ren2 ren3 ren4 % 0.10/0.40 % Fol Constants: skc3 % 0.10/0.40 % Fol Functions: skf1 skf2 % 0.10/0.40 % Problem Properties: % 0.10/0.40 % This is a full first-order problem without equality. The Problem is non-linear. % 0.10/0.40 % 0.10/0.40 % 0.10/0.40 % Reduced Input Axiom Clauses: % 0.10/0.40 % 1:1:1:INP:Top: -> r1(x0,x0) % 0.10/0.40 % 2:3:3:INP:TopTopTop: r1(x0,x1),r1(x1,x2) -> r1(x0,x2) % 0.10/0.40 % 3:2:1:INP:Top: ren1(x0) -> r1(x0,skf1(x0)) % 0.10/0.40 % 4:2:1:INP:Top: ren1(x0),p2(skf1(x0)) -> % 0.10/0.40 % 5:2:1:INP:Top: ren1(x0),p102(skf1(x0)) -> % 0.10/0.40 % 6:2:1:INP:Top: ren1(x0) -> p101(skf1(x0)) % 0.10/0.40 % 7:2:1:INP:Top: ren1(x0) -> r1(x0,skf2(x0)) % 0.10/0.40 % 8:2:1:INP:Top: ren1(x0) -> p2(skf2(x0)) % 0.10/0.40 % 9:2:1:INP:Top: ren1(x0),p102(skf2(x0)) -> % 0.10/0.40 % 10:2:1:INP:Top: ren1(x0) -> p101(skf2(x0)) % 0.10/0.40 % 11:5:2:INP:TopTop: ren2(x0),r1(x0,x1),p2(x1),p101(x1) -> p2(x0) % 0.10/0.40 % 12:5:2:INP:TopTop: ren2(x0),r1(x0,x1),p101(x1),p2(x0) -> p2(x1) % 0.10/0.40 % 13:5:2:INP:TopTop: ren3(x0),r1(x0,x1),p1(x1),p100(x1) -> p1(x0) % 0.10/0.40 % 14:5:2:INP:TopTop: ren3(x0),r1(x0,x1),p100(x1),p1(x0) -> p1(x1) % 0.10/0.40 % 15:4:1:INP:Top: ren4(x0),p100(x0) -> ren1(x0),p101(x0) % 0.10/0.40 % 16:3:1:INP:Top: ren4(x0),p101(x0) -> ren2(x0) % 0.10/0.40 % 17:3:1:INP:Top: ren4(x0),p100(x0) -> ren3(x0) % 0.10/0.40 % 18:3:1:INP:Top: ren4(x0),p102(x0) -> p101(x0) % 0.10/0.40 % 19:3:1:INP:Top: ren4(x0),p101(x0) -> p100(x0) % 0.10/0.40 % 0.10/0.40 % Reduced Input Conjecture Clauses: % 0.10/0.40 % 20:2:1:INP:Top: r1(skc3,x0) -> ren4(x0) % 0.10/0.40 % 21:1:0:INP:: p101(skc3) -> % 0.10/0.40 % 22:1:0:INP:: -> p100(skc3) % 0.10/0.40 % 0.10/0.40 % 0.10/0.40 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 28 atoms initially. Used heuristic: lmodel_grow === % 0.10/0.40 % 0.10/0.40 % 0.10/0.40 % 0.10/0.40 % Linear Model Building succeeded. % 0.10/0.40 % SZS status CounterSatisfiable % 0.10/0.40 % 0.10/0.40 % 0.10/0.40 % SZS status CounterSatisfiable % 0.10/0.40 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.10/0.40 % 0.10/0.40 % SPASS-SCL-FOL Statistics: % 0.10/0.40 % Number of learned clauses: 10 % 0.10/0.40 % Number of propagations: 273 % 0.10/0.40 % Number of decisions: 204 % 0.10/0.40 % Number of resolutions: 10 % 0.10/0.40 % Number of condensations: 0 % 0.10/0.40 % Number of sub resolutions: 1 % 0.10/0.40 % 0.10/0.40 % Solver is done. Empty clause found % 0.10/0.40 % 0.10/0.40 % Needed: 0:00:00.03 % 0.10/0.40 % 0.10/0.40 % ### % 0.10/0.40 % ### Pagesize: 8192 % 0.10/0.40 % ### Marksize: 0 % 0.10/0.40 % ### Memory demanded: 1106 KBytes % 0.10/0.40 % ### Memory freed: 1106 KBytes % 0.10/0.40 % ### Memory remaining: 0 Bytes % 0.10/0.40 % ### Pages allocated: 217 Pages % 0.10/0.40 % ### %------------------------------------------------------------------------------