%------------------------------------------------------------------------------ % File : SPASS-SCL---0.1 % Problem : LCL681+1.005 : TPTP v9.2.1. Released v4.0.0. % Transfm : none % Format : tptp % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p % Computer : n009.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:28:15 PM UTC 2026 % Result : CounterSatisfiable 0.40s 0.60s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : LCL681+1.005 : TPTP v9.2.1. Released v4.0.0. % 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 0.16/0.34 % Computer : n009.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Thu May 7 12:36:26 EDT 2026 % 0.16/0.34 % CPUTime : % 0.16/0.34 SPASS-SCL-FOL version: % 0.20/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode] % 0.40/0.60 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 0.40/0.60 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 0.40/0.60 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 0.40/0.60 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 0.40/0.60 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p % 0.40/0.60 Execution resolution_1 ended with status: satisfiable % 0.40/0.60 Used heuristic: resolution_1 % 0.40/0.60 % 0.40/0.60 Input Clauses: % 0.40/0.60 % 0.40/0.60 Predicates: r1 p2 p1 ren1 ren2 ren3 ren4 ren5 ren6 ren7 ren8 ren9 ren10 ren11 ren12 ren13 ren14 ren15 ren16 ren17 ren18 ren19 ren20 ren21 ren22 ren23 ren24 ren25 ren26 ren27 ren28 ren29 ren30 ren31 ren32 ren33 ren34 ren35 ren36 ren37 % 0.40/0.60 Fol Constants: skc9 % 0.40/0.60 Fol Functions: skf1 skf2 skf3 skf4 skf5 skf6 skf7 skf8 skf10 skf11 % 0.40/0.60 Problem Properties: % 0.40/0.60 This is a full first-order problem without equality. % 0.40/0.60 % 0.40/0.60 After reduction: Problem Properties: % 0.40/0.60 This is a full first-order problem without equality. % 0.40/0.60 % 0.40/0.60 % 0.40/0.60 Reduced Input Clauses: % 0.40/0.60 95:2:1:[94.0,93.2]:Top: r1(skc9,x0),ren37(x0,skf11(x0)) -> % 0.40/0.60 % 0.40/0.60 Most General Atoms: r1(x0,x2) p2(x0) p1(x1) ren1(x1) ren2(x1) ren3(x1) ren4(x2,x0) ren5(x1) ren6(x1) ren7(x2,x0) ren8(x1) ren9(x1) ren10(x2,x0) ren11(x1) ren12(x1) ren13(x2,x0) ren15(x0) ren14(x1) ren16(x1) ren17(x1) ren18(x1) ren19(x2,x0) ren20(x1) ren21(x1) ren22(x2,x0) ren23(x1) ren24(x1) ren25(x2,x0) ren26(x0) ren27(x1) ren28(x1) ren29(x1) ren30(x2,x0) ren31(x1) ren32(x1) ren33(x2,x0) ren34(x1) ren35(x1) ren36(x1) ren37(x2,x0) % 0.40/0.60 % 0.40/0.60 === Starting SPASS-SCL-FOL A Little Less Naive, considering 50 atoms initially, heuristics mode: resolution_1 === % 0.40/0.60 % 0.40/0.60 === Backtracking. Learning clause 96:5:3:[10.2,13.3]:TopTopTop: p2(skf1(x0)),r1(x1,x2),r1(x2,x0) -> p1(x2),ren5(x1) % 0.40/0.60 === Backtracking. Learning clause 97:5:3:[9.2,13.3]:TopTopTop: r1(x0,x1),r1(x1,x2) -> r1(x2,skf1(x2)),p1(x1),ren5(x0) % 0.40/0.60 === Backtracking. Learning clause 98:3:2:[17.2,20.2]:TopTop: p2(skf2(x0)),r1(x1,x0) -> ren8(x1) % 0.40/0.60 === Backtracking. Learning clause 99:3:2:[16.2,20.2]:TopTop: r1(x0,x1) -> r1(x1,skf2(x1)),ren8(x0) % 0.40/0.60 === Backtracking. Learning clause 100:3:2:[24.2,27.2]:TopTop: p2(skf3(x0)),r1(x1,x0) -> ren11(x1) % 0.40/0.60 === Backtracking. Learning clause 101:3:2:[23.2,27.2]:TopTop: r1(x0,x1) -> r1(x1,skf3(x1)),ren11(x0) % 0.40/0.60 === Backtracking. Learning clause 102:3:2:[31.2,34.2]:TopTop: p2(skf4(x0)),r1(x1,x0) -> ren14(x1) % 0.40/0.60 === Backtracking. Learning clause 103:3:2:[30.2,34.2]:TopTop: r1(x0,x1) -> r1(x1,skf4(x1)),ren14(x0) % 0.40/0.60 === Backtracking. Learning clause 104:5:3:[44.2,47.3]:TopTopTop: p2(skf5(x0)),r1(x1,x2),r1(x2,x0) -> p1(x2),ren20(x1) % 0.40/0.60 === Backtracking. Learning clause 105:5:3:[43.2,47.3]:TopTopTop: r1(x0,x1),r1(x1,x2) -> r1(x2,skf5(x2)),p1(x1),ren20(x0) % 0.40/0.60 === Backtracking. Learning clause 106:3:2:[51.2,54.2]:TopTop: p2(skf6(x0)),r1(x1,x0) -> ren23(x1) % 0.40/0.60 === Backtracking. Learning clause 107:3:2:[50.2,54.2]:TopTop: r1(x0,x1) -> r1(x1,skf6(x1)),ren23(x0) % 0.40/0.60 === Backtracking. Learning clause 108:3:2:[58.2,61.2]:TopTop: p2(skf7(x0)),r1(x1,x0) -> ren26(x1) % 0.40/0.60 === Backtracking. Learning clause 109:3:2:[57.2,61.2]:TopTop: r1(x0,x1) -> r1(x1,skf7(x1)),ren26(x0) % 0.40/0.60 % 0.40/0.60 Linear Model Building succeeded. % 0.40/0.60 SZS status Satisfiable % 0.40/0.60 % 0.40/0.60 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 0.40/0.60 % 0.40/0.60 SPASS-SCL-FOL Statistics: % 0.40/0.60 Number of learned clauses: 14 % 0.40/0.60 Number of propagations: 170 % 0.40/0.60 Number of decisions: 230 % 0.40/0.60 Number of resolutions: 14 % 0.40/0.60 Number of condensations: 0 % 0.40/0.60 Number of sub resolutions: 1 % 0.40/0.60 Number of input literals (deduplicated): 54 % 0.40/0.60 Number of grows: 0 % 0.40/0.60 Number of considered ground atoms: 50 % 0.40/0.60 % 0.40/0.60 Needed: 0:00:00.04 % 0.40/0.60 %------------------------------------------------------------------------------