%------------------------------------------------------------------------------ % File : SPASS-SCL---0.1 % Problem : PUZ046-1 : TPTP v9.2.1. Released v2.5.0. % Transfm : none % Format : tptp % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % Computer : n001.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Thu May 7 07:31:28 PM UTC 2026 % Result : Satisfiable 0.32s 0.55s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : PUZ046-1 : TPTP v9.2.1. Released v2.5.0. % 0.13/0.14 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.36 % Computer : n001.cluster.edu % 0.18/0.36 % Model : x86_64 x86_64 % 0.18/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.36 % Memory : 8042.1875MB % 0.18/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.36 % CPULimit : 300 % 0.18/0.36 % WCLimit : 300 % 0.18/0.36 % DateTime : Thu May 7 12:58:49 EDT 2026 % 0.18/0.36 % CPUTime : % 0.18/0.36 SPASS-SCL-FOL version: % 0.21/0.42 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode] % 0.32/0.55 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.32/0.55 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.32/0.55 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.32/0.55 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.32/0.55 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.32/0.55 Execution resolution_1 ended with status: satisfiable % 0.32/0.55 Used heuristic: resolution_1 % 0.32/0.55 % 0.32/0.55 Input Clauses: % 0.32/0.55 % 0.32/0.55 Predicates: state % 0.32/0.55 Fol Constants: a % 0.32/0.55 Fol Functions: s1 s e1 s2 s3 s4 v1 e2 v2 v3 v4 h bb % 0.32/0.55 Problem Properties: % 0.32/0.55 This is a full first-order problem without equality. % 0.32/0.55 % 0.32/0.55 After reduction: Problem Properties: % 0.32/0.55 This is a full first-order problem without equality. % 0.32/0.55 % 0.32/0.55 % 0.32/0.55 Reduced Input Clauses: % 0.32/0.55 % 0.32/0.55 Most General Atoms: state(x0,x1,x2,x3,x4,x5,s1(x6,x7),x8,x9,x10,e1(x6,s(x7)),x11) state(x0,x1,x2,x3,x4,x5,s1(x6,s(x7)),x8,x9,x10,e1(x6,x7),x11) state(x0,x1,x2,x3,x4,x5,s1(x6,x7),x8,x9,x10,e1(s(x6),x7),x11) state(x0,x1,x2,x3,x4,x5,s1(s(x6),x7),x8,x9,x10,e1(x6,x7),x11) state(x0,x1,x2,x3,x4,x5,x6,s2(x7,x8),x9,x10,e1(x7,s(x8)),x11) state(x0,x1,x2,x3,x4,x5,x6,s2(x7,s(x8)),x9,x10,e1(x7,x8),x11) state(x0,x1,x2,x3,x4,x5,x6,s2(x7,x8),x9,x10,e1(s(x7),x8),x11) state(x0,x1,x2,x3,x4,x5,x6,s2(s(x7),x8),x9,x10,e1(x7,x8),x11) state(x0,x1,x2,x3,x4,x5,x6,x7,s3(x8,x9),x10,e1(x8,s(x9)),x11) state(x0,x1,x2,x3,x4,x5,x6,x7,s3(x8,s(x9)),x10,e1(x8,x9),x11) state(x0,x1,x2,x3,x4,x5,x6,x7,s3(x8,x9),x10,e1(s(x8),x9),x11) state(x0,x1,x2,x3,x4,x5,x6,x7,s3(s(x8),x9),x10,e1(x8,x9),x11) state(x0,x1,x2,x3,x4,x5,x6,x7,x8,s4(x9,x10),e1(x9,s(x10)),x11) state(x0,x1,x2,x3,x4,x5,x6,x7,x8,s4(x9,s(x10)),e1(x9,x10),x11) state(x0,x1,x2,x3,x4,x5,x6,x7,x8,s4(x9,x10),e1(s(x9),x10),x11) state(x0,x1,x2,x3,x4,x5,x6,x7,x8,s4(s(x9),x10),e1(x9,x10),x11) state(x0,v1(x1,x2),x3,x4,x5,x6,x7,x8,x9,x10,e1(s(s(x1)),x2),x11) state(x0,v1(s(x1),x2),x3,x4,x5,x6,x7,x8,x9,x10,e1(x1,x2),x11) state(x0,x1,v2(x2,x3),x4,x5,x6,x7,x8,x9,x10,e1(s(s(x2)),x3),x11) state(x0,x1,v2(s(x2),x3),x4,x5,x6,x7,x8,x9,x10,e1(x2,x3),x11) state(x0,x1,x2,v3(x3,x4),x5,x6,x7,x8,x9,x10,e1(s(s(x3)),x4),x11) state(x0,x1,x2,v3(s(x3),x4),x5,x6,x7,x8,x9,x10,e1(x3,x4),x11) state(x0,x1,x2,x3,v4(x4,x5),x6,x7,x8,x9,x10,e1(s(s(x4)),x5),x11) state(x0,x1,x2,x3,v4(s(x4),x5),x6,x7,x8,x9,x10,e1(x4,x5),x11) state(x0,x1,x2,x3,x4,h(x5,x6),x7,x8,x9,x10,e1(x5,s(s(x6))),x11) state(x0,x1,x2,x3,x4,h(x5,s(x6)),x7,x8,x9,x10,e1(x5,x6),x11) state(x0,x1,x2,x3,x4,x5,x6,x7,x8,x9,e1(x12,x13),e2(x10,x11)) % 0.32/0.55 % 0.32/0.55 === Starting SPASS-SCL-FOL A Little Less Naive, considering 66 atoms initially, heuristics mode: resolution_1 === % 0.32/0.55 % 0.32/0.55 === Backtracking. Learning clause 42:2:11:[13.2,10.1]:TopTopTopTopTopTopTopTopTopTopTop: state(x0,x1,x2,x3,x4,x5,x6,x7,s3(x8,s(x9)),s4(x8,x9),e1(x8,s(x9)),x10) -> state(x0,x1,x2,x3,x4,x5,x6,x7,s3(x8,x9),s4(x8,s(x9)),e1(x8,s(x9)),x10) % 0.32/0.55 === Backtracking. Learning clause 43:2:11:[13.2,12.1]:TopTopTopTopTopTopTopTopTopTopTop: state(x0,x1,x2,x3,x4,x5,x6,x7,s3(s(x8),x9),s4(x8,x9),e1(x8,s(x9)),x10) -> state(x0,x1,x2,x3,x4,x5,x6,x7,s3(x8,x9),s4(x8,s(x9)),e1(s(x8),x9),x10) % 0.32/0.55 === Backtracking. Learning clause 44:2:11:[13.2,6.1]:TopTopTopTopTopTopTopTopTopTopTop: state(x0,x1,x2,x3,x4,x5,x6,s2(x7,s(x8)),x9,s4(x7,x8),e1(x7,s(x8)),x10) -> state(x0,x1,x2,x3,x4,x5,x6,s2(x7,x8),x9,s4(x7,s(x8)),e1(x7,s(x8)),x10) % 0.32/0.55 === Backtracking. Learning clause 45:2:11:[9.2,6.1]:TopTopTopTopTopTopTopTopTopTopTop: state(x0,x1,x2,x3,x4,x5,x6,s2(x7,s(x8)),s3(x7,x8),x9,e1(x7,s(x8)),x10) -> state(x0,x1,x2,x3,x4,x5,x6,s2(x7,x8),s3(x7,s(x8)),x9,e1(x7,s(x8)),x10) % 0.32/0.55 === Backtracking. Learning clause 46:2:11:[11.2,6.1]:TopTopTopTopTopTopTopTopTopTopTop: state(x0,x1,x2,x3,x4,x5,x6,s2(x7,s(x8)),s3(x7,x8),x9,e1(s(x7),x8),x10) -> state(x0,x1,x2,x3,x4,x5,x6,s2(x7,x8),s3(s(x7),x8),x9,e1(x7,s(x8)),x10) % 0.32/0.55 === Backtracking. Learning clause 47:2:11:[13.2,8.1]:TopTopTopTopTopTopTopTopTopTopTop: state(x0,x1,x2,x3,x4,x5,x6,s2(s(x7),x8),x9,s4(x7,x8),e1(x7,s(x8)),x10) -> state(x0,x1,x2,x3,x4,x5,x6,s2(x7,x8),x9,s4(x7,s(x8)),e1(s(x7),x8),x10) % 0.32/0.55 === Backtracking. Learning clause 48:2:11:[9.2,8.1]:TopTopTopTopTopTopTopTopTopTopTop: state(x0,x1,x2,x3,x4,x5,x6,s2(s(x7),x8),s3(x7,x8),x9,e1(x7,s(x8)),x10) -> state(x0,x1,x2,x3,x4,x5,x6,s2(x7,x8),s3(x7,s(x8)),x9,e1(s(x7),x8),x10) % 0.32/0.55 === Backtracking. Learning clause 49:2:11:[11.2,8.1]:TopTopTopTopTopTopTopTopTopTopTop: state(x0,x1,x2,x3,x4,x5,x6,s2(s(x7),x8),s3(x7,x8),x9,e1(s(x7),x8),x10) -> state(x0,x1,x2,x3,x4,x5,x6,s2(x7,x8),s3(s(x7),x8),x9,e1(s(x7),x8),x10) % 0.32/0.55 === Backtracking. Learning clause 50:2:11:[13.2,2.1]:TopTopTopTopTopTopTopTopTopTopTop: state(x0,x1,x2,x3,x4,x5,s1(x6,s(x7)),x8,x9,s4(x6,x7),e1(x6,s(x7)),x10) -> state(x0,x1,x2,x3,x4,x5,s1(x6,x7),x8,x9,s4(x6,s(x7)),e1(x6,s(x7)),x10) % 0.32/0.55 === Backtracking. Learning clause 51:2:11:[9.2,2.1]:TopTopTopTopTopTopTopTopTopTopTop: state(x0,x1,x2,x3,x4,x5,s1(x6,s(x7)),x8,s3(x6,x7),x9,e1(x6,s(x7)),x10) -> state(x0,x1,x2,x3,x4,x5,s1(x6,x7),x8,s3(x6,s(x7)),x9,e1(x6,s(x7)),x10) % 0.32/0.55 === Backtracking. Learning clause 52:2:11:[11.2,2.1]:TopTopTopTopTopTopTopTopTopTopTop: state(x0,x1,x2,x3,x4,x5,s1(x6,s(x7)),x8,s3(x6,x7),x9,e1(s(x6),x7),x10) -> state(x0,x1,x2,x3,x4,x5,s1(x6,x7),x8,s3(s(x6),x7),x9,e1(x6,s(x7)),x10) % 0.32/0.55 === Backtracking. Learning clause 53:2:11:[5.2,2.1]:TopTopTopTopTopTopTopTopTopTopTop: state(x0,x1,x2,x3,x4,x5,s1(x6,s(x7)),s2(x6,x7),x8,x9,e1(x6,s(x7)),x10) -> state(x0,x1,x2,x3,x4,x5,s1(x6,x7),s2(x6,s(x7)),x8,x9,e1(x6,s(x7)),x10) % 0.32/0.55 === Backtracking. Learning clause 54:2:11:[7.2,2.1]:TopTopTopTopTopTopTopTopTopTopTop: state(x0,x1,x2,x3,x4,x5,s1(x6,s(x7)),s2(x6,x7),x8,x9,e1(s(x6),x7),x10) -> state(x0,x1,x2,x3,x4,x5,s1(x6,x7),s2(s(x6),x7),x8,x9,e1(x6,s(x7)),x10) % 0.32/0.55 === Backtracking. Learning clause 55:2:11:[13.2,4.1]:TopTopTopTopTopTopTopTopTopTopTop: state(x0,x1,x2,x3,x4,x5,s1(s(x6),x7),x8,x9,s4(x6,x7),e1(x6,s(x7)),x10) -> state(x0,x1,x2,x3,x4,x5,s1(x6,x7),x8,x9,s4(x6,s(x7)),e1(s(x6),x7),x10) % 0.32/0.55 === Backtracking. Learning clause 56:2:11:[9.2,4.1]:TopTopTopTopTopTopTopTopTopTopTop: state(x0,x1,x2,x3,x4,x5,s1(s(x6),x7),x8,s3(x6,x7),x9,e1(x6,s(x7)),x10) -> state(x0,x1,x2,x3,x4,x5,s1(x6,x7),x8,s3(x6,s(x7)),x9,e1(s(x6),x7),x10) % 0.32/0.55 === Backtracking. Learning clause 57:2:11:[11.2,4.1]:TopTopTopTopTopTopTopTopTopTopTop: state(x0,x1,x2,x3,x4,x5,s1(s(x6),x7),x8,s3(x6,x7),x9,e1(s(x6),x7),x10) -> state(x0,x1,x2,x3,x4,x5,s1(x6,x7),x8,s3(s(x6),x7),x9,e1(s(x6),x7),x10) % 0.32/0.55 === Backtracking. Learning clause 58:2:11:[5.2,4.1]:TopTopTopTopTopTopTopTopTopTopTop: state(x0,x1,x2,x3,x4,x5,s1(s(x6),x7),s2(x6,x7),x8,x9,e1(x6,s(x7)),x10) -> state(x0,x1,x2,x3,x4,x5,s1(x6,x7),s2(x6,s(x7)),x8,x9,e1(s(x6),x7),x10) % 0.32/0.55 === Backtracking. Learning clause 59:2:11:[7.2,4.1]:TopTopTopTopTopTopTopTopTopTopTop: state(x0,x1,x2,x3,x4,x5,s1(s(x6),x7),s2(x6,x7),x8,x9,e1(s(x6),x7),x10) -> state(x0,x1,x2,x3,x4,x5,s1(x6,x7),s2(s(x6),x7),x8,x9,e1(s(x6),x7),x10) % 0.32/0.55 % 0.32/0.55 Linear Model Building succeeded. % 0.32/0.55 SZS status Satisfiable % 0.32/0.55 % 0.32/0.55 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.32/0.55 % 0.32/0.55 SPASS-SCL-FOL Statistics: % 0.32/0.55 Number of learned clauses: 18 % 0.32/0.55 Number of propagations: 182 % 0.32/0.55 Number of decisions: 109 % 0.32/0.55 Number of resolutions: 18 % 0.32/0.55 Number of condensations: 0 % 0.32/0.55 Number of sub resolutions: 0 % 0.32/0.55 Number of input literals (deduplicated): 41 % 0.32/0.55 Number of grows: 0 % 0.32/0.55 Number of considered ground atoms: 66 % 0.32/0.55 % 0.32/0.55 Needed: 0:00:00.01 % 0.32/0.55 %------------------------------------------------------------------------------