%------------------------------------------------------------------------------ % File : SPASS-SCL---0.1.1 % Problem : LCL237-1 : TPTP v9.3.1. Bugfixed v2.3.0. % Transfm : none % Format : tptp % Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % Computer : n020.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:12 PM UTC 2026 % Result : Timeout 299.78s 300.03s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL237-1 : TPTP v9.3.1. Bugfixed v2.3.0. % 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 0.09/0.36 % Computer : n020.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 03:24:27 UTC 2026 % 0.09/0.36 % CPUTime : % 0.09/0.36 Running /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 299.78/300.03 % 299.78/300.03 % Input Clauses: % 299.78/300.03 % 1:1:1:INP:Top: -> axiom(or(not(or(x0,x0)),x0)) % 299.78/300.03 % 2:1:2:INP:TopTop: -> axiom(or(not(x0),or(x1,x0))) % 299.78/300.03 % 3:1:2:INP:TopTop: -> axiom(or(not(or(x0,x1)),or(x1,x0))) % 299.78/300.03 % 4:1:3:INP:TopTopTop: -> axiom(or(not(or(x0,or(x1,x2))),or(x1,or(x0,x2)))) % 299.78/300.03 % 5:1:3:INP:TopTopTop: -> axiom(or(not(or(not(x0),x1)),or(not(or(x2,x0)),or(x2,x1)))) % 299.78/300.03 % 6:2:1:INP:Top: axiom(x0) -> theorem(x0) % 299.78/300.03 % 7:3:2:INP:TopTop: axiom(or(not(x0),x1)),theorem(x0) -> theorem(x1) % 299.78/300.03 % 8:3:3:INP:TopTopTop: axiom(or(not(x0),x1)),theorem(or(not(x1),x2)) -> theorem(or(not(x0),x2)) % 299.78/300.03 % 9:1:0:INP:: theorem(or(not(q),or(not(p),not(or(not(p),not(q)))))) -> % 299.78/300.03 % 299.78/300.03 % Predicates: axiom theorem % 299.78/300.03 % Fol Constants: q p % 299.78/300.03 % Fol Functions: or not % 299.78/300.03 % Problem Properties: % 299.78/300.03 % This is a full first-order problem without equality. The Problem is non-linear. % 299.78/300.03 % 299.78/300.03 % 299.78/300.03 % Reduced Input Axiom Clauses: % 299.78/300.03 % 1:1:1:INP:Top: -> axiom(or(not(or(x0,x0)),x0)) % 299.78/300.03 % 2:1:2:INP:TopTop: -> axiom(or(not(x0),or(x1,x0))) % 299.78/300.03 % 3:1:2:INP:TopTop: -> axiom(or(not(or(x0,x1)),or(x1,x0))) % 299.78/300.03 % 4:1:3:INP:TopTopTop: -> axiom(or(not(or(x0,or(x1,x2))),or(x1,or(x0,x2)))) % 299.78/300.03 % 5:1:3:INP:TopTopTop: -> axiom(or(not(or(not(x0),x1)),or(not(or(x2,x0)),or(x2,x1)))) % 299.78/300.03 % 6:2:1:INP:Top: axiom(x0) -> theorem(x0) % 299.78/300.03 % 7:3:2:INP:TopTop: axiom(or(not(x0),x1)),theorem(x0) -> theorem(x1) % 299.78/300.03 % 8:3:3:INP:TopTopTop: axiom(or(not(x0),x1)),theorem(or(not(x1),x2)) -> theorem(or(not(x0),x2)) % 299.78/300.03 % 299.78/300.03 % Reduced Input Conjecture Clauses: % 299.78/300.03 % 9:1:0:INP:: theorem(or(not(q),or(not(p),not(or(not(p),not(q)))))) -> % 299.78/300.03 % 299.78/300.03 % 299.78/300.03 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 14 atoms initially. Used heuristic: lmodel_grow === % 299.78/300.03 % 299.78/300.03 % 299.78/300.03 % 299.78/300.03 % SZS status Timeout % 299.78/300.03 % 299.78/300.03 % SPASS-SCL-FOL 0.1.1 % 299.78/300.03 % SPASS beiseite: Ran out of time or SPASS was killed. % 299.78/300.03 % Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 299.78/300.03 % 299.78/300.03 % SPASS-SCL-FOL Statistics: % 299.78/300.03 % Number of learned clauses: 48 % 299.78/300.03 % Number of propagations: 21392 % 299.78/300.03 % Number of decisions: 5342 % 299.78/300.03 % Number of resolutions: 55 % 299.78/300.03 % Number of condensations: 0 % 299.78/300.03 % Number of sub resolutions: 0 % 299.78/300.03 % 299.78/300.03 % SCL allocated 148848 KBytes. % 299.78/300.03 % SCL spent 0:4:59.66 on the problem. %------------------------------------------------------------------------------