0.00/0.02 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.03 % Command : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 180 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.08/0.36 % Computer : n018.cluster.edu 0.08/0.36 % Model : x86_64 x86_64 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.08/0.36 % Memory : 8046.5625MB 0.08/0.36 % OS : Linux 6.8.0-71-generic 0.08/0.37 % CPULimit : 1440 0.08/0.37 % WCLimit : 180 0.08/0.37 % DateTime : Mon Jul 27 09:34:38 UTC 2026 0.08/0.37 % CPUTime : 0.08/0.37 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 180 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.08/0.37 0.08/0.37 % Input Clauses: 0.08/0.37 % 1:2:3:INP:TopTopTop: ren1(x0,x1,x2) -> g_true_only(x0,x1) 0.08/0.37 % 2:3:3:INP:TopTopTop: ren1(x0,x1,x2) -> g_true_only(x0,x2),g_both(x0,x2) 0.08/0.37 % 3:2:3:INP:TopTopTop: ren2(x0,x1,x2) -> g_both(x0,x1) 0.08/0.37 % 4:3:3:INP:TopTopTop: ren2(x0,x1,x2) -> g_true_only(x0,x2),g_false_only(x0,x2) 0.08/0.37 % 5:2:3:INP:TopTopTop: ren3(x0,x1,x2) -> g_false_only(x0,x1) 0.08/0.37 % 6:3:3:INP:TopTopTop: ren3(x0,x1,x2) -> g_both(x0,x2),g_false_only(x0,x2) 0.08/0.37 % 7:2:3:INP:TopTopTop: ren4(x0,x1,x2) -> g_true_only(x0,x1) 0.08/0.37 % 8:2:3:INP:TopTopTop: ren4(x0,x1,x2) -> g_false_only(x0,x2) 0.08/0.37 % 9:2:3:INP:TopTopTop: ren5(x0,x1,x2) -> g_true_only(x0,x1) 0.08/0.37 % 10:2:3:INP:TopTopTop: ren5(x0,x1,x2) -> g_false_only(x0,x2) 0.08/0.37 % 11:3:3:INP:TopTopTop: ren6(x0,x1,x2) -> g_false_only(x0,x1),g_both(x0,x1) 0.08/0.37 % 12:2:3:INP:TopTopTop: ren6(x0,x1,x2) -> g_false_only(x0,x2) 0.08/0.37 % 13:2:3:INP:TopTopTop: ren7(x0,x1,x2) -> g_both(x0,x1) 0.08/0.37 % 14:3:3:INP:TopTopTop: ren7(x0,x1,x2) -> g_false_only(x0,x2),g_true_only(x0,x2) 0.08/0.37 % 15:2:3:INP:TopTopTop: ren8(x0,x1,x2) -> g_true_only(x0,x1) 0.08/0.37 % 16:3:3:INP:TopTopTop: ren8(x0,x1,x2) -> g_true_only(x0,x2),g_both(x0,x2) 0.08/0.37 % 17:2:2:INP:TopTop: ren9(x0,x1) -> g_false_only(x0,x0) 0.08/0.37 % 18:2:2:INP:TopTop: ren9(x0,x1) -> g_false_only(x0,x1) 0.08/0.37 % 19:2:2:INP:TopTop: ren10(x0,x1) -> g_true_only(x0,x1) 0.08/0.37 % 20:2:2:INP:TopTop: ren10(x0,x1) -> g_true_only(x0,x0) 0.08/0.37 % 21:3:2:INP:TopTop: ren11(x0,x1) -> g_false_only(x0,x0),g_both(x0,x0) 0.08/0.37 % 22:2:2:INP:TopTop: ren11(x0,x1) -> g_true_only(x0,x1) 0.08/0.37 % 23:2:2:INP:TopTop: ren12(x0,x1) -> g_false_only(x0,x1) 0.08/0.37 % 24:3:2:INP:TopTop: ren12(x0,x1) -> g_true_only(x0,x0),g_both(x0,x0) 0.08/0.37 % 25:3:2:INP:TopTop: ren13(x0,x1) -> g_true_only(x0,x0),g_false_only(x0,x0) 0.08/0.37 % 26:2:2:INP:TopTop: ren13(x0,x1) -> g_both(x0,x1) 0.08/0.37 % 27:2:2:INP:TopTop: g_both(x0,x1) -> ren14(x0,x1) 0.08/0.37 % 28:2:2:INP:TopTop: g_false_only(x0,x1) -> ren14(x0,x1) 0.08/0.37 % 29:2:2:INP:TopTop: g_false_only(x0,x1) -> ren15(x0,x1) 0.08/0.37 % 30:2:2:INP:TopTop: g_true_only(x0,x1) -> ren15(x0,x1) 0.08/0.37 % 31:2:2:INP:TopTop: g_both(x0,x1) -> ren16(x0,x1) 0.08/0.37 % 32:2:2:INP:TopTop: g_true_only(x0,x1) -> ren16(x0,x1) 0.08/0.37 % 33:2:1:INP:Top: g_both(x0,x0) -> ren17(x0) 0.08/0.37 % 34:2:1:INP:Top: g_true_only(x0,x0) -> ren17(x0) 0.08/0.37 % 35:2:1:INP:Top: g_false_only(x0,x0) -> ren18(x0) 0.08/0.37 % 36:2:1:INP:Top: g_true_only(x0,x0) -> ren18(x0) 0.08/0.37 % 37:2:1:INP:Top: g_false_only(x0,x0) -> ren19(x0) 0.08/0.37 % 38:2:1:INP:Top: g_both(x0,x0) -> ren19(x0) 0.08/0.37 % 39:17:8:INP:TopTopTopTopTopTopTopTop: g_both(x0,x1),g_both(x0,x2),g_both(x3,x4),g_both(x3,x3) -> ren1(skf1(x1,x2),x2,x1),ren2(skf2(x1,x2),x2,x1),ren3(skf3(x1,x2),x2,x1),ren4(x5,x1,skf4(x1)),ren5(x5,skf4(x1),x1),ren6(skf6(x6),skc5,x6),ren7(skf7(x6),x6,skc5),ren8(skf8(x6),x6,skc5),ren9(x7,skc9),ren10(x7,skc9),ren11(skf10(x4),x4),ren12(skf11(x4),x4),ren13(skf12(x4),x4) 0.08/0.37 % 40:2:2:INP:TopTop: ren14(x0,x1),g_false_only(x0,skf13(x1)) -> 0.08/0.37 % 41:2:2:INP:TopTop: g_both(x0,skf13(x1)),ren15(x0,x1) -> 0.08/0.37 % 42:2:2:INP:TopTop: ren16(x0,x1),g_true_only(x0,skf13(x1)) -> 0.08/0.37 % 43:2:1:INP:Top: g_false_only(x0,skc14),ren17(x0) -> 0.08/0.37 % 44:2:1:INP:Top: ren18(x0),g_both(x0,skc14) -> 0.08/0.37 % 45:2:1:INP:Top: g_true_only(x0,skc14),ren19(x0) -> 0.08/0.37 % 46:3:2:INP:TopTop: g_false(x0,x1) -> g_true(x0,x1),g_false_only(x0,x1) 0.08/0.37 % 47:2:2:INP:TopTop: g_false_only(x0,x1) -> g_false(x0,x1) 0.08/0.37 % 48:2:2:INP:TopTop: g_false_only(x0,x1),g_true(x0,x1) -> 0.08/0.37 % 49:3:2:INP:TopTop: -> g_false_only(x0,x1),g_both(x0,x1),g_true_only(x0,x1) 0.08/0.37 % 50:2:2:INP:TopTop: g_both(x0,x1) -> g_true(x0,x1) 0.08/0.37 % 51:2:2:INP:TopTop: g_both(x0,x1) -> g_false(x0,x1) 0.08/0.37 % 52:3:2:INP:TopTop: g_true(x0,x1),g_false(x0,x1) -> g_both(x0,x1) 0.08/0.37 % 53:2:2:INP:TopTop: g_true_only(x0,x1),g_false(x0,x1) -> 0.08/0.37 % 54:2:2:INP:TopTop: g_true_only(x0,x1) -> g_true(x0,x1) 0.08/0.37 % 55:3:2:INP:TopTop: g_true(x0,x1) -> g_false(x0,x1),g_true_only(x0,x1) 0.08/0.37 0.08/0.37 % Predicates: g_true_only g_both g_false_only g_false g_true ren1 ren2 ren3 ren4 ren5 ren6 ren7 ren8 ren9 ren10 ren11 ren12 ren13 ren14 ren15 ren16 ren17 ren18 ren19 0.08/0.37 % Fol Constants: skc5 skc9 skc14 0.08/0.37 % Fol Functions: skf1 skf2 skf3 skf4 skf6 skf7 skf8 skf10 skf11 skf12 skf13 0.08/0.37 % Problem Properties: 0.08/0.37 % This is a full first-order problem without equality. The Problem is non-linear. 0.08/0.37 0.08/0.37 0.08/0.37 % Reduced Input Axiom Clauses: 0.08/0.37 % 1:2:3:INP:TopTopTop: ren1(x0,x1,x2) -> g_true_only(x0,x1) 179.73/180.03 % 2:3:3:INP:TopTopTop: ren1(x0,x1,x2) -> g_true_only(x0,x2),g_both(x0,x2) 179.73/180.03 % 3:2:3:INP:TopTopTop: ren2(x0,x1,x2) -> g_both(x0,x1) 179.73/180.03 % 4:3:3:INP:TopTopTop: ren2(x0,x1,x2) -> g_true_only(x0,x2),g_false_only(x0,x2) 179.73/180.03 % 5:2:3:INP:TopTopTop: ren3(x0,x1,x2) -> g_false_only(x0,x1) 179.73/180.03 % 6:3:3:INP:TopTopTop: ren3(x0,x1,x2) -> g_both(x0,x2),g_false_only(x0,x2) 179.73/180.03 % 7:2:3:INP:TopTopTop: ren4(x0,x1,x2) -> g_true_only(x0,x1) 179.73/180.03 % 8:2:3:INP:TopTopTop: ren4(x0,x1,x2) -> g_false_only(x0,x2) 179.73/180.03 % 9:2:3:INP:TopTopTop: ren5(x0,x1,x2) -> g_true_only(x0,x1) 179.73/180.03 % 10:2:3:INP:TopTopTop: ren5(x0,x1,x2) -> g_false_only(x0,x2) 179.73/180.03 % 11:3:3:INP:TopTopTop: ren6(x0,x1,x2) -> g_false_only(x0,x1),g_both(x0,x1) 179.73/180.03 % 12:2:3:INP:TopTopTop: ren6(x0,x1,x2) -> g_false_only(x0,x2) 179.73/180.03 % 13:2:3:INP:TopTopTop: ren7(x0,x1,x2) -> g_both(x0,x1) 179.73/180.03 % 14:3:3:INP:TopTopTop: ren7(x0,x1,x2) -> g_false_only(x0,x2),g_true_only(x0,x2) 179.73/180.03 % 15:2:3:INP:TopTopTop: ren8(x0,x1,x2) -> g_true_only(x0,x1) 179.73/180.03 % 16:3:3:INP:TopTopTop: ren8(x0,x1,x2) -> g_true_only(x0,x2),g_both(x0,x2) 179.73/180.03 % 17:2:2:INP:TopTop: ren9(x0,x1) -> g_false_only(x0,x0) 179.73/180.03 % 18:2:2:INP:TopTop: ren9(x0,x1) -> g_false_only(x0,x1) 179.73/180.03 % 19:2:2:INP:TopTop: ren10(x0,x1) -> g_true_only(x0,x1) 179.73/180.03 % 20:2:2:INP:TopTop: ren10(x0,x1) -> g_true_only(x0,x0) 179.73/180.03 % 21:3:2:INP:TopTop: ren11(x0,x1) -> g_false_only(x0,x0),g_both(x0,x0) 179.73/180.03 % 22:2:2:INP:TopTop: ren11(x0,x1) -> g_true_only(x0,x1) 179.73/180.03 % 23:2:2:INP:TopTop: ren12(x0,x1) -> g_false_only(x0,x1) 179.73/180.03 % 24:3:2:INP:TopTop: ren12(x0,x1) -> g_true_only(x0,x0),g_both(x0,x0) 179.73/180.03 % 25:3:2:INP:TopTop: ren13(x0,x1) -> g_true_only(x0,x0),g_false_only(x0,x0) 179.73/180.03 % 26:2:2:INP:TopTop: ren13(x0,x1) -> g_both(x0,x1) 179.73/180.03 % 27:2:2:INP:TopTop: g_both(x0,x1) -> ren14(x0,x1) 179.73/180.03 % 28:2:2:INP:TopTop: g_false_only(x0,x1) -> ren14(x0,x1) 179.73/180.03 % 29:2:2:INP:TopTop: g_false_only(x0,x1) -> ren15(x0,x1) 179.73/180.03 % 30:2:2:INP:TopTop: g_true_only(x0,x1) -> ren15(x0,x1) 179.73/180.03 % 31:2:2:INP:TopTop: g_both(x0,x1) -> ren16(x0,x1) 179.73/180.03 % 32:2:2:INP:TopTop: g_true_only(x0,x1) -> ren16(x0,x1) 179.73/180.03 % 33:2:1:INP:Top: g_both(x0,x0) -> ren17(x0) 179.73/180.03 % 34:2:1:INP:Top: g_true_only(x0,x0) -> ren17(x0) 179.73/180.03 % 35:2:1:INP:Top: g_false_only(x0,x0) -> ren18(x0) 179.73/180.03 % 36:2:1:INP:Top: g_true_only(x0,x0) -> ren18(x0) 179.73/180.03 % 37:2:1:INP:Top: g_false_only(x0,x0) -> ren19(x0) 179.73/180.03 % 38:2:1:INP:Top: g_both(x0,x0) -> ren19(x0) 179.73/180.03 % 46:3:2:INP:TopTop: g_false(x0,x1) -> g_true(x0,x1),g_false_only(x0,x1) 179.73/180.03 % 47:2:2:INP:TopTop: g_false_only(x0,x1) -> g_false(x0,x1) 179.73/180.03 % 48:2:2:INP:TopTop: g_false_only(x0,x1),g_true(x0,x1) -> 179.73/180.03 % 49:3:2:INP:TopTop: -> g_false_only(x0,x1),g_both(x0,x1),g_true_only(x0,x1) 179.73/180.03 % 50:2:2:INP:TopTop: g_both(x0,x1) -> g_true(x0,x1) 179.73/180.03 % 51:2:2:INP:TopTop: g_both(x0,x1) -> g_false(x0,x1) 179.73/180.03 % 52:3:2:INP:TopTop: g_true(x0,x1),g_false(x0,x1) -> g_both(x0,x1) 179.73/180.03 % 53:2:2:INP:TopTop: g_true_only(x0,x1),g_false(x0,x1) -> 179.73/180.03 % 54:2:2:INP:TopTop: g_true_only(x0,x1) -> g_true(x0,x1) 179.73/180.03 % 55:3:2:INP:TopTop: g_true(x0,x1) -> g_false(x0,x1),g_true_only(x0,x1) 179.73/180.03 179.73/180.03 % Reduced Input Conjecture Clauses: 179.73/180.03 % 39:17:8:INP:TopTopTopTopTopTopTopTop: g_both(x0,x1),g_both(x0,x2),g_both(x3,x4),g_both(x3,x3) -> ren1(skf1(x1,x2),x2,x1),ren2(skf2(x1,x2),x2,x1),ren3(skf3(x1,x2),x2,x1),ren4(x5,x1,skf4(x1)),ren5(x5,skf4(x1),x1),ren6(skf6(x6),skc5,x6),ren7(skf7(x6),x6,skc5),ren8(skf8(x6),x6,skc5),ren9(x7,skc9),ren10(x7,skc9),ren11(skf10(x4),x4),ren12(skf11(x4),x4),ren13(skf12(x4),x4) 179.73/180.03 % 40:2:2:INP:TopTop: ren14(x0,x1),g_false_only(x0,skf13(x1)) -> 179.73/180.03 % 41:2:2:INP:TopTop: g_both(x0,skf13(x1)),ren15(x0,x1) -> 179.73/180.03 % 42:2:2:INP:TopTop: ren16(x0,x1),g_true_only(x0,skf13(x1)) -> 179.73/180.03 % 43:2:1:INP:Top: g_false_only(x0,skc14),ren17(x0) -> 179.73/180.03 % 44:2:1:INP:Top: ren18(x0),g_both(x0,skc14) -> 179.73/180.03 % 45:2:1:INP:Top: g_true_only(x0,skc14),ren19(x0) -> 179.73/180.03 179.73/180.03 179.73/180.03 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 75 atoms initially. Used heuristic: lmodel_grow === 179.73/180.03 179.73/180.03 179.73/180.03 179.73/180.03 % SZS status Timeout 179.73/180.03 179.73/180.03 % SPASS-SCL-FOL 0.1.1 179.73/180.03 % SPASS beiseite: Ran out of time or SPASS was killed. 179.73/180.03 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 179.73/180.03 179.73/180.03 % SPASS-SCL-FOL Statistics: 179.73/180.03 % Number of learned clauses: 123 179.73/180.03 % Number of propagations: 112754 179.73/180.03 % Number of decisions: 40955 179.73/180.03 % Number of resolutions: 168 179.73/180.03 % Number of condensations: 0 179.73/180.03 % Number of sub resolutions: 17 179.73/180.03 179.73/180.03 % SCL allocated 603944 KBytes. 179.73/180.03 % SCL spent 0:2:59.65 on the problem. 179.73/180.05 EOF