%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN663-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 : n007.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:40:08 PM UTC 2026
% Result : Unsatisfiable 9.28s 2.31s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN663-1 : TPTP v9.2.1. Released v2.5.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.31 % Computer : n007.cluster.edu
% 0.15/0.31 % Model : x86_64 x86_64
% 0.15/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.31 % Memory : 8042.1875MB
% 0.15/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.31 % CPULimit : 300
% 0.15/0.31 % WCLimit : 300
% 0.15/0.32 % DateTime : Thu May 7 13:46:09 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.32 SPASS-SCL-FOL version:
% 0.20/0.41 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 9.28/2.30 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.28/2.30 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.28/2.30 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.28/2.30 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.28/2.30 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.28/2.30 Execution resolution_3 ended with status: unsatisfiable
% 9.28/2.30 Used heuristic: resolution_3
% 9.28/2.30
% 9.28/2.30 Input Clauses:
% 9.28/2.30
% 9.28/2.30 Predicates: p22 p10 p7 p6 p3 p2 p19 p18 p14 p12 p25 p26 p23 p27 p24
% 9.28/2.30 Fol Constants: c28 c36 c33 c32 c31 c29 c30 c37 c34 c35
% 9.28/2.30 Fol Functions: f9 f8 f20 f5 f4 f17 f16 f11 f21 f13 f15
% 9.28/2.30 Problem Properties:
% 9.28/2.30 This is a full first-order problem without equality.
% 9.28/2.30
% 9.28/2.30 After reduction: Problem Properties:
% 9.28/2.30 This is a full first-order problem without equality.
% 9.28/2.30
% 9.28/2.30
% 9.28/2.30 Reduced Input Clauses:
% 9.28/2.30
% 9.28/2.30 Most General Atoms: p22(x1) p6(x1,x2) p19(x1,x2) p14(x1,x2) p2(x2,x3) p27(x3,x1) p12(x2,x3) p24(x1,x3) p25(x3,x1) p10(x2,x3) p26(x1,x3) p7(x2,x3) p3(x2,x3) p18(x4,x5) p23(x5,x3,x1)
% 9.28/2.30
% 9.28/2.30 === Starting SPASS-SCL-FOL A Little Less Naive, considering 51 atoms initially, heuristics mode: resolution_3 ===
% 9.28/2.30
% 9.28/2.30 === Backtracking. Learning clause 55:3:2:[37.2,11.1]:TopTop: p2(c33,x0),p2(c36,x1) -> p25(x1,x0)
% 9.28/2.30 === Backtracking. Learning clause 56:2:1:[27.2,15.1]:Top: p7(f8(c29),x0) -> p7(x0,c30)
% 9.28/2.30 === Backtracking. Learning clause 57:2:1:[30.2,14.1]:Top: p2(c32,x0) -> p2(x0,f9(c31))
% 9.28/2.30 === Backtracking. Learning clause 58:2:2:[27.2,3.1]:TopTop: p7(x0,x1) -> p7(x1,x0)
% 9.28/2.31 === Backtracking. Learning clause 59:2:2:[29.2,5.1]:TopTop: p3(x0,x1) -> p3(x1,x0)
% 9.28/2.31 === Backtracking. Learning clause 60:2:2:[30.2,6.1]:TopTop: p2(x0,x1) -> p2(x1,x0)
% 9.28/2.31 === Clause set with instances from active satisfied. Growing active. New size: 118
% 9.28/2.31 === Restarting.
% 9.28/2.31 === Backtracking. Learning clause 61:3:2:[38.2,16.1]:TopTop: p19(f20(c28,c37),x0),p10(c34,x1) -> p26(x0,x1)
% 9.28/2.31 === Backtracking. Learning clause 62:3:2:[38.2,17.1]:TopTop: p19(f20(c28,c35),x0),p10(c34,x1) -> p26(x0,x1)
% 9.28/2.31 === Backtracking. Learning clause 63:2:2:[31.2,7.1]:TopTop: p19(x0,x1) -> p19(x1,x0)
% 9.28/2.31 === Backtracking. Learning clause 64:2:2:[33.2,9.1]:TopTop: p14(x0,x1) -> p14(x1,x0)
% 9.28/2.31 === Backtracking. Learning clause 65:2:2:[34.2,10.1]:TopTop: p12(x0,x1) -> p12(x1,x0)
% 9.28/2.31 === Backtracking. Learning clause 66:2:2:[48.3,19.1]:TopTop: p2(x0,f16(x0,x1)),p2(x1,f9(f17(c31))) ->
% 9.28/2.31 === Backtracking. Learning clause 67:3:2:[37.3,40.1]:TopTop: p2(x0,x1),p25(f11(f4(c32),c34),x0) -> p25(f16(f11(f4(c36),c34),f9(f17(c31))),x1)
% 9.28/2.31 === Backtracking. Learning clause 68:3:2:[37.1,40.1]:TopTop: p25(x0,f11(f4(c32),c34)),p2(x0,x1) -> p25(x1,f16(f11(f4(c36),c34),f9(f17(c31))))
% 9.28/2.31 === Backtracking. Learning clause 69:2:1:[30.1,40.1,60.1]:Top: p2(f11(f4(c32),c34),x0) -> p2(x0,f16(f11(f4(c36),c34),f9(f17(c31))))
% 9.28/2.31 === Backtracking. Learning clause 70:3:2:[37.3,39.1]:TopTop: p2(x0,x1),p25(f11(f4(c32),c34),x0) -> p25(f16(f11(f4(c33),c34),f9(f17(c31))),x1)
% 9.28/2.31 === Backtracking. Learning clause 71:3:2:[37.1,39.1]:TopTop: p25(x0,f11(f4(c32),c34)),p2(x0,x1) -> p25(x1,f16(f11(f4(c33),c34),f9(f17(c31))))
% 9.28/2.31 === Backtracking. Learning clause 72:2:1:[30.1,39.1,60.1]:Top: p2(f11(f4(c32),c34),x0) -> p2(x0,f16(f11(f4(c33),c34),f9(f17(c31))))
% 9.28/2.31 === Backtracking. Learning clause 73:3:2:[35.2,41.1]:TopTop: p2(f11(f4(f21(c36,f9(f17(c31)))),c37),x0),p2(f11(f4(c36),c37),x1) -> p27(x1,x0)
% 9.28/2.31 === Backtracking. Learning clause 74:3:2:[35.2,42.1]:TopTop: p2(f11(f4(f21(c33,f9(f17(c31)))),c35),x0),p2(f11(f4(c33),c35),x1) -> p27(x1,x0)
% 9.28/2.31 === Clause set with instances from active satisfied. Growing active. New size: 193
% 9.28/2.31 === Restarting.
% 9.28/2.31 === Conflict found: 58:2:2:[27.2,3.1]:TopTop: p7(x0,x1) -> p7(x1,x0) {x0 -> c28, x1 -> f8(c29)}
% 9.28/2.31 === Backtracking. Learning clause 75:2:1:[58.2,56.1]:Top: p7(x0,f8(c29)) -> p7(x0,c30)
% 9.28/2.31 === Conflict found: 58:2:2:[27.2,3.1]:TopTop: p7(x0,x1) -> p7(x1,x0) {x0 -> f8(c29), x1 -> c30}
% 9.28/2.31 === Backtracking. Learning clause 76:1:0:[58.1,15.1]:: -> p7(c30,f8(c29))
% 9.28/2.31 === Backtracking. Learning clause 77:2:1:[27.1,21.2,15.1]:Top: p6(c29,x0) -> p7(f8(x0),c30)
% 9.28/2.31 === Conflict found: 63:2:2:[31.2,7.1]:TopTop: p19(x0,x1) -> p19(x1,x0) {x0 -> c28, x1 -> f20(c28,c37)}
% 9.28/2.31 === Backtracking. Learning clause 78:3:2:[63.2,61.1]:TopTop: p19(x0,f20(c28,c37)),p10(c34,x1) -> p26(x0,x1)
% 9.28/2.31 === Conflict found: 63:2:2:[31.2,7.1]:TopTop: p19(x0,x1) -> p19(x1,x0) {x0 -> c28, x1 -> f20(c28,c35)}
% 9.28/2.31 === Backtracking. Learning clause 79:3:2:[63.2,62.1]:TopTop: p19(x0,f20(c28,c35)),p10(c34,x1) -> p26(x0,x1)
% 9.28/2.31 === Conflict found: 66:2:2:[48.3,19.1]:TopTop: p2(x0,f16(x0,x1)),p2(x1,f9(f17(c31))) -> {x0 -> c28, x1 -> f9(c28)}
% 9.28/2.31 === Backtracking. Learning clause 80:2:2:[66.2,24.2]:TopTop: p2(x0,f16(x0,f9(x1))),p2(x1,f17(c31)) ->
% 9.28/2.31 === Backtracking. Learning clause 81:2:1:[38.1,7.1,16.1]:Top: p10(c34,x0) -> p26(f20(c28,c37),x0)
% 9.28/2.31 === Backtracking. Learning clause 82:2:1:[38.1,7.1,17.1]:Top: p10(c34,x0) -> p26(f20(c28,c35),x0)
% 9.28/2.31 === Backtracking. Learning clause 83:4:2:[30.1,49.3,60.1]:TopTop: p2(f11(f4(x0),c34),x1),p25(x0,c33),p25(c32,x0) -> p2(x1,f11(f4(c32),c34))
% 9.28/2.31 === Conflict found: 60:2:2:[30.2,6.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> c28, x1 -> f11(f4(f21(c36,f9(f17(c31)))),c37)}
% 9.28/2.31 === Backtracking. Learning clause 84:3:2:[60.2,73.1]:TopTop: p2(x0,f11(f4(f21(c36,f9(f17(c31)))),c37)),p2(f11(f4(c36),c37),x1) -> p27(x1,x0)
% 9.28/2.31 === Conflict found: 60:2:2:[30.2,6.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> c28, x1 -> f11(f4(f21(c33,f9(f17(c31)))),c35)}
% 9.28/2.31 === Backtracking. Learning clause 85:3:2:[60.2,74.1]:TopTop: p2(x0,f11(f4(f21(c33,f9(f17(c31)))),c35)),p2(f11(f4(c33),c35),x1) -> p27(x1,x0)
% 9.28/2.31 === Backtracking. Learning clause 86:3:2:[30.1,69.2,60.1]:TopTop: p2(x0,x1),p2(f11(f4(c32),c34),x0) -> p2(x1,f16(f11(f4(c36),c34),f9(f17(c31))))
% 9.28/2.31 === Backtracking. Learning clause 87:3:2:[30.1,72.2,60.1]:TopTop: p2(x0,x1),p2(f11(f4(c32),c34),x0) -> p2(x1,f16(f11(f4(c33),c34),f9(f17(c31))))
% 9.28/2.31 === Conflict found: 69:2:1:[30.1,40.1,60.1]:Top: p2(f11(f4(c32),c34),x0) -> p2(x0,f16(f11(f4(c36),c34),f9(f17(c31)))) {x0 -> f11(f4(c36),c34)}
% 9.28/2.31 === Backtracking. Learning clause 88:1:0:[69.2,19.1]:: p2(f11(f4(c32),c34),f11(f4(c36),c34)) ->
% 9.28/2.31 === Conflict found: 72:2:1:[30.1,39.1,60.1]:Top: p2(f11(f4(c32),c34),x0) -> p2(x0,f16(f11(f4(c33),c34),f9(f17(c31)))) {x0 -> f11(f4(c33),c34)}
% 9.28/2.31 === Backtracking. Learning clause 89:1:0:[72.2,19.1]:: p2(f11(f4(c32),c34),f11(f4(c33),c34)) ->
% 9.28/2.31 === Backtracking. Learning clause 90:6:5:[35.1,40.1,35.2,60.2,86.3]:TopTopTopTopTop: p27(x0,f11(f4(c32),c34)),p2(x0,x1),p2(x1,x2),p2(x3,x4),p2(f11(f4(c32),c34),x3) -> p27(x2,x4)
% 9.28/2.31 === Backtracking. Learning clause 91:3:2:[35.1,40.1]:TopTop: p27(x0,f11(f4(c32),c34)),p2(x0,x1) -> p27(x1,f16(f11(f4(c36),c34),f9(f17(c31))))
% 9.28/2.31 === Backtracking. Learning clause 92:3:2:[35.3,40.1]:TopTop: p2(x0,x1),p27(f11(f4(c32),c34),x0) -> p27(f16(f11(f4(c36),c34),f9(f17(c31))),x1)
% 9.28/2.31 === Backtracking. Learning clause 93:3:2:[35.1,39.1]:TopTop: p27(x0,f11(f4(c32),c34)),p2(x0,x1) -> p27(x1,f16(f11(f4(c33),c34),f9(f17(c31))))
% 9.28/2.31 === Backtracking. Learning clause 94:3:2:[35.3,39.1]:TopTop: p2(x0,x1),p27(f11(f4(c32),c34),x0) -> p27(f16(f11(f4(c33),c34),f9(f17(c31))),x1)
% 9.28/2.31 === Backtracking. Learning clause 95:2:1:[35.1,6.1,41.1]:Top: p2(f11(f4(c36),c37),x0) -> p27(x0,f11(f4(f21(c36,f9(f17(c31)))),c37))
% 9.28/2.31 === Backtracking. Learning clause 96:2:1:[35.1,6.1,42.1]:Top: p2(f11(f4(c33),c35),x0) -> p27(x0,f11(f4(f21(c33,f9(f17(c31)))),c35))
% 9.28/2.31 === Clause set with instances from active satisfied. Growing active. New size: 242
% 9.28/2.31 === Restarting.
% 9.28/2.31 === Conflict found: 58:2:2:[27.2,3.1]:TopTop: p7(x0,x1) -> p7(x1,x0) {x0 -> f8(c28), x1 -> c30}
% 9.28/2.31 === Backtracking. Learning clause 97:2:1:[58.1,77.2]:Top: p6(c29,x0) -> p7(c30,f8(x0))
% 9.28/2.31 === Conflict found: 83:4:2:[30.1,49.3,60.1]:TopTop: p2(f11(f4(x0),c34),x1),p25(x0,c33),p25(c32,x0) -> p2(x1,f11(f4(c32),c34)) {x0 -> c28, x1 -> c28}
% 9.28/2.31 === Backtracking. Learning clause 98:4:2:[83.1,60.2]:TopTop: p25(x0,c33),p25(c32,x0),p2(x1,f11(f4(x0),c34)) -> p2(x1,f11(f4(c32),c34))
% 9.28/2.31 === Conflict found: 60:2:2:[30.2,6.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> f11(f4(c32),c34), x1 -> f11(c28,c28)}
% 9.28/2.31 === Backtracking. Learning clause 99:9:6:[60.1,47.3,35.1,90.1,60.2,98.4]:TopTopTopTopTopTop: p10(c34,x0),p3(f4(c32),x1),p27(x2,f11(x1,x0)),p2(x2,x3),p2(x3,x4),p25(x5,c33),p25(c32,x5),p2(x3,f11(f4(x5),c34)) -> p27(x3,x4)
% 9.28/2.31 === Conflict found: 60:2:2:[30.2,6.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> f11(f4(c32),c34), x1 -> f11(c28,c28)}
% 9.28/2.31 === Backtracking. Learning clause 100:3:4:[60.1,47.3]:TopTopTopTop: p10(x0,x1),p3(x2,x3) -> p2(f11(x3,x1),f11(x2,x0))
% 9.28/2.31 === Backtracking. Learning clause 101:2:0:[47.3,88.1]:: p10(c34,c34),p3(f4(c32),f4(c36)) ->
% 9.28/2.31 === Conflict found: 60:2:2:[30.2,6.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> f11(f4(c36),c34), x1 -> f11(f4(c32),c34)}
% 9.28/2.31
% 9.28/2.31 SZS status Unsatisfiable
% 9.28/2.31
% 9.28/2.31 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.28/2.31
% 9.28/2.31 SPASS-SCL-FOL Statistics:
% 9.28/2.31 Number of learned clauses: 47
% 9.28/2.31 Number of propagations: 1870
% 9.28/2.31 Number of decisions: 1424
% 9.28/2.31 Number of resolutions: 68
% 9.28/2.31 Number of condensations: 0
% 9.28/2.31 Number of sub resolutions: 0
% 9.28/2.31 Number of input literals (deduplicated): 57
% 9.28/2.31 Number of grows: 3
% 9.28/2.31 Number of considered ground atoms: 242
% 9.28/2.31
% 9.28/2.31 Needed: 0:00:01.80
% 9.28/2.31
%------------------------------------------------------------------------------