%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN638-1 : TPTP v9.2.1. Released v2.5.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n010.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:06 PM UTC 2026
% Result : Unsatisfiable 8.25s 2.51s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN638-1 : TPTP v9.2.1. Released v2.5.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.33 % Computer : n010.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Thu May 7 13:46:07 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]
% 8.25/2.51 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.25/2.51 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.25/2.51 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.25/2.51 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.25/2.51 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.25/2.51 Execution resolution_3 ended with status: unsatisfiable
% 8.25/2.51 Used heuristic: resolution_3
% 8.25/2.51
% 8.25/2.51 Input Clauses:
% 8.25/2.51
% 8.25/2.51 Predicates: p18 p7 p6 p4 p3 p2 p20 p21 p22 p24 p23
% 8.25/2.51 Fol Constants: c25 c28 c30 c26 c29 c27
% 8.25/2.51 Fol Functions: f12 f10 f13 f15 f14 f19 f16 f11 f5 f8 f9 f17
% 8.25/2.51 Problem Properties:
% 8.25/2.51 This is a full first-order problem without equality.
% 8.25/2.51
% 8.25/2.51 After reduction: Problem Properties:
% 8.25/2.51 This is a full first-order problem without equality.
% 8.25/2.51
% 8.25/2.51
% 8.25/2.51 Reduced Input Clauses:
% 8.25/2.51
% 8.25/2.51 Most General Atoms: p3(x1,x2) p18(x1,x3) p24(x2,x3) p6(x2,x3) p20(x1,x3) p21(x1,x3) p4(x2,x3) p22(x1,x3) p23(x1,x3) p7(x2,x3) p2(x4,x5)
% 8.25/2.51
% 8.25/2.51 === Starting SPASS-SCL-FOL A Little Less Naive, considering 64 atoms initially, heuristics mode: resolution_3 ===
% 8.25/2.51
% 8.25/2.51 === Backtracking. Learning clause 42:3:2:[26.3,7.1]:TopTop: p6(f12(c25),x0),p6(c28,x1) -> p20(x0,x1)
% 8.25/2.51 === Backtracking. Learning clause 43:2:2:[19.2,1.1]:TopTop: p18(x0,x1) -> p18(x1,x0)
% 8.25/2.51 === Backtracking. Learning clause 44:2:1:[21.3,8.1]:Top: p6(x0,f10(c25)),p6(x0,f13(c30)) ->
% 8.25/2.51 === Backtracking. Learning clause 45:2:2:[21.2,3.1]:TopTop: p6(x0,x1) -> p6(x1,x0)
% 8.25/2.51 === Backtracking. Learning clause 46:2:2:[22.2,4.1]:TopTop: p4(x0,x1) -> p4(x1,x0)
% 8.25/2.51 === Backtracking. Learning clause 47:3:2:[27.3,9.1]:TopTop: p6(f13(f14(f15(c30))),x0),p6(f10(c25),x1) -> p21(x0,x1)
% 8.25/2.51 === Clause set with instances from active satisfied. Growing active. New size: 132
% 8.25/2.51 === Restarting.
% 8.25/2.51 === Backtracking. Learning clause 48:2:2:[20.2,2.1]:TopTop: p7(x0,x1) -> p7(x1,x0)
% 8.25/2.51 === Backtracking. Learning clause 49:2:2:[24.2,6.1]:TopTop: p2(x0,x1) -> p2(x1,x0)
% 8.25/2.51 === Backtracking. Learning clause 50:4:3:[28.3,18.1,22.3]:TopTopTop: p4(f5(c25,c26,c29),x0),p4(x1,f5(c25,c26,c27)),p4(x1,x2) -> p22(x0,x2)
% 8.25/2.51 === Backtracking. Learning clause 51:5:3:[25.4,34.2]:TopTopTop: p24(x0,x1),p4(x0,x2),p18(x1,f19(f8(f11(c25),f9(f10(c25),c28)))),p23(x2,c29) -> p23(x2,c27)
% 8.25/2.51 === Backtracking. Learning clause 52:2:1:[22.3,33.1]:Top: p4(x0,f5(c25,c26,c27)),p4(x0,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c27)) ->
% 8.25/2.51 === Backtracking. Learning clause 53:3:0:[38.4,33.1]:: p3(c26,c26),p4(c27,c27),p2(c25,f8(f11(c25),f9(f10(c25),c28))) ->
% 8.25/2.51 === Backtracking. Learning clause 54:3:3:[29.1,39.1]:TopTopTop: p4(x0,x1),p23(f5(f8(f11(c25),f9(f10(c25),c28)),x2,c27),x0) -> p23(f5(f8(f11(c25),f9(f10(c25),c28)),x2,c29),x1)
% 8.25/2.51 === Backtracking. Learning clause 55:3:3:[29.2,39.1]:TopTopTop: p4(x0,x1),p23(x0,f5(f8(f11(c25),f9(f10(c25),c28)),x2,c27)) -> p23(x1,f5(f8(f11(c25),f9(f10(c25),c28)),x2,c29))
% 8.25/2.51 === Backtracking. Learning clause 56:3:3:[25.2,39.1]:TopTopTop: p24(f5(f8(f11(c25),f9(f10(c25),c28)),x0,c27),x1),p18(x1,x2) -> p24(f5(f8(f11(c25),f9(f10(c25),c28)),x0,c29),x2)
% 8.25/2.51 === Backtracking. Learning clause 57:2:2:[22.2,39.1]:TopTop: p4(f5(f8(f11(c25),f9(f10(c25),c28)),x0,c27),x1) -> p4(x1,f5(f8(f11(c25),f9(f10(c25),c28)),x0,c29))
% 8.25/2.51 === Backtracking. Learning clause 58:3:3:[28.1,39.1]:TopTopTop: p4(x0,x1),p22(f5(f8(f11(c25),f9(f10(c25),c28)),x2,c27),x0) -> p22(f5(f8(f11(c25),f9(f10(c25),c28)),x2,c29),x1)
% 8.25/2.51 === Backtracking. Learning clause 59:3:3:[28.2,39.1]:TopTopTop: p4(x0,x1),p22(x0,f5(f8(f11(c25),f9(f10(c25),c28)),x2,c27)) -> p22(x1,f5(f8(f11(c25),f9(f10(c25),c28)),x2,c29))
% 8.25/2.51 === Backtracking. Learning clause 60:3:2:[28.3,40.1]:TopTop: p4(f16(f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c27))),x0),p4(f16(f17(c27,f5(c25,c26,c27))),x1) -> p22(x0,x1)
% 8.25/2.51 === Clause set with instances from active satisfied. Growing active. New size: 181
% 8.25/2.51 === Restarting.
% 8.25/2.51 === Conflict found: 45:2:2:[21.2,3.1]:TopTop: p6(x0,x1) -> p6(x1,x0) {x0 -> c25, x1 -> f13(f14(f15(c30)))}
% 8.25/2.51 === Backtracking. Learning clause 61:3:2:[45.2,47.1]:TopTop: p6(x0,f13(f14(f15(c30)))),p6(f10(c25),x1) -> p21(x0,x1)
% 8.25/2.51 === Conflict found: 50:4:3:[28.3,18.1,22.3]:TopTopTop: p4(f5(c25,c26,c29),x0),p4(x1,f5(c25,c26,c27)),p4(x1,x2) -> p22(x0,x2) {x0 -> c25, x1 -> c25, x2 -> c25}
% 8.25/2.51 === Backtracking. Learning clause 62:4:3:[50.1,46.2]:TopTopTop: p4(x0,f5(c25,c26,c27)),p4(x0,x1),p4(x2,f5(c25,c26,c29)) -> p22(x2,x1)
% 8.25/2.51 === Backtracking. Learning clause 63:2:1:[27.1,3.1,9.1]:Top: p6(f10(c25),x0) -> p21(f13(f14(f15(c30))),x0)
% 8.25/2.51 === Backtracking. Learning clause 64:5:7:[22.2,38.4,46.2]:TopTopTopTopTopTopTop: p3(x0,x1),p4(x2,x3),p2(x4,x5),p4(x6,f5(x4,x0,x2)) -> p4(x6,f5(x5,x1,x3))
% 8.25/2.51 === Conflict found: 46:2:2:[22.2,4.1]:TopTop: p4(x0,x1) -> p4(x1,x0) {x0 -> c25, x1 -> f5(f8(f11(c25),f9(f10(c25),c28)),c25,c27)}
% 8.25/2.51 === Backtracking. Learning clause 65:2:2:[46.2,57.1]:TopTop: p4(x0,f5(f8(f11(c25),f9(f10(c25),c28)),x1,c27)) -> p4(x0,f5(f8(f11(c25),f9(f10(c25),c28)),x1,c29))
% 8.25/2.51 === Conflict found: 46:2:2:[22.2,4.1]:TopTop: p4(x0,x1) -> p4(x1,x0) {x0 -> c25, x1 -> f16(f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c27)))}
% 8.25/2.51 === Backtracking. Learning clause 66:3:2:[46.2,60.1]:TopTop: p4(x0,f16(f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c27)))),p4(f16(f17(c27,f5(c25,c26,c27))),x1) -> p22(x0,x1)
% 8.25/2.51 === Backtracking. Learning clause 67:3:3:[29.1,4.1]:TopTopTop: p4(x0,x1),p23(x2,x0) -> p23(x2,x1)
% 8.25/2.51 === Backtracking. Learning clause 68:3:3:[29.2,4.1]:TopTopTop: p4(x0,x1),p23(x0,x2) -> p23(x1,x2)
% 8.25/2.51 === Conflict found: 46:2:2:[22.2,4.1]:TopTop: p4(x0,x1) -> p4(x1,x0) {x0 -> f5(f8(f11(c25),f9(f10(c25),c28)),c25,c27), x1 -> f5(f8(f11(c25),f9(f10(c25),c28)),c25,c29)}
% 8.25/2.51 === Backtracking. Learning clause 69:1:1:[46.1,39.1]:Top: -> p4(f5(f8(f11(c25),f9(f10(c25),c28)),x0,c29),f5(f8(f11(c25),f9(f10(c25),c28)),x0,c27))
% 8.25/2.51 === Backtracking. Learning clause 70:2:1:[28.1,4.1,40.1]:Top: p4(f16(f17(c27,f5(c25,c26,c27))),x0) -> p22(f16(f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c27))),x0)
% 8.25/2.51 === Clause set with instances from active satisfied. Growing active. New size: 202
% 8.25/2.51 === Restarting.
% 8.25/2.51 === Backtracking. Learning clause 71:6:8:[28.1,38.4]:TopTopTopTopTopTopTopTop: p4(x0,x1),p22(f5(x2,x3,x4),x0),p3(x3,x5),p4(x4,x6),p2(x2,x7) -> p22(f5(x7,x5,x6),x1)
% 8.25/2.51 === Conflict found: 64:5:7:[22.2,38.4,46.2]:TopTopTopTopTopTopTop: p3(x0,x1),p4(x2,x3),p2(x4,x5),p4(x6,f5(x4,x0,x2)) -> p4(x6,f5(x5,x1,x3)) {x0 -> c25, x1 -> c25, x2 -> f5(f8(f11(c25),f9(f10(c25),c28)),c25,c27), x3 -> f5(f8(f11(c25),f9(f10(c25),c28)),c25,c29), x4 -> c25, x5 -> c25, x6 -> c25}
% 8.25/2.51 === Backtracking. Learning clause 72:4:6:[64.2,39.1]:TopTopTopTopTopTop: p3(x0,x1),p2(x2,x3),p4(x4,f5(x2,x0,f5(f8(f11(c25),f9(f10(c25),c28)),x5,c27))) -> p4(x4,f5(x3,x1,f5(f8(f11(c25),f9(f10(c25),c28)),x5,c29)))
% 8.25/2.51 === Backtracking. Learning clause 73:2:2:[22.1,69.1,46.1]:TopTop: p4(f5(f8(f11(c25),f9(f10(c25),c28)),x0,c29),x1) -> p4(x1,f5(f8(f11(c25),f9(f10(c25),c28)),x0,c27))
% 8.25/2.51 === Backtracking. Learning clause 74:3:2:[28.4,41.1]:TopTop: p4(x0,f16(f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c29)))),p4(x1,f16(f17(c27,f5(c25,c26,c27)))),p22(x0,x1) ->
% 8.25/2.51 === Clause set with instances from active satisfied. Growing active. New size: 216
% 8.25/2.51 === Restarting.
% 8.25/2.51 === Backtracking. Learning clause 75:3:2:[12.2,74.1]:TopTop: p4(x0,f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c29))),p4(x1,f16(f17(c27,f5(c25,c26,c27)))),p22(f16(x0),x1) ->
% 8.25/2.51 === Conflict found: 71:6:8:[28.1,38.4]:TopTopTopTopTopTopTopTop: p4(x0,x1),p22(f5(x2,x3,x4),x0),p3(x3,x5),p4(x4,x6),p2(x2,x7) -> p22(f5(x7,x5,x6),x1) {x0 -> c25, x1 -> c25, x2 -> c25, x3 -> c25, x4 -> f5(f8(f11(c25),f9(f10(c25),c28)),c25,c27), x5 -> c25, x6 -> f5(f8(f11(c25),f9(f10(c25),c28)),c25,c29), x7 -> c25}
% 8.25/2.51 === Backtracking. Learning clause 76:5:7:[71.4,39.1]:TopTopTopTopTopTopTop: p4(x0,x1),p22(f5(x2,x3,f5(f8(f11(c25),f9(f10(c25),c28)),x4,c27)),x0),p3(x3,x5),p2(x2,x6) -> p22(f5(x6,x5,f5(f8(f11(c25),f9(f10(c25),c28)),x4,c29)),x1)
% 8.25/2.51 === Backtracking. Learning clause 77:2:1:[28.1,4.1,41.1]:Top: p4(x0,f16(f17(c27,f5(c25,c26,c27)))),p22(f16(f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c29))),x0) ->
% 8.25/2.51 === Clause set with instances from active satisfied. Growing active. New size: 226
% 8.25/2.51 === Restarting.
% 8.25/2.51 === Backtracking. Learning clause 78:4:3:[32.3,75.1]:TopTopTop: p4(x0,c27),p4(x1,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c29)),p4(x2,f16(f17(c27,f5(c25,c26,c27)))),p22(f16(f17(x0,x1)),x2) ->
% 8.25/2.51 === Clause set with instances from active satisfied. Growing active. New size: 233
% 8.25/2.51 === Restarting.
% 8.25/2.51 === Conflict found: 78:4:3:[32.3,75.1]:TopTopTop: p4(x0,c27),p4(x1,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c29)),p4(x2,f16(f17(c27,f5(c25,c26,c27)))),p22(f16(f17(x0,x1)),x2) -> {x0 -> c25, x1 -> f5(f8(f11(c25),f9(f10(c25),c28)),c26,c29), x2 -> c25}
% 8.25/2.51 === Backtracking. Learning clause 79:3:2:[78.2,4.1]:TopTop: p4(x0,c27),p4(x1,f16(f17(c27,f5(c25,c26,c27)))),p22(f16(f17(x0,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c29))),x1) ->
% 8.25/2.51 === Conflict found: 78:4:3:[32.3,75.1]:TopTopTop: p4(x0,c27),p4(x1,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c29)),p4(x2,f16(f17(c27,f5(c25,c26,c27)))),p22(f16(f17(x0,x1)),x2) -> {x0 -> c25, x1 -> f5(f8(f11(c25),f9(f10(c25),c28)),c26,c27), x2 -> c25}
% 8.25/2.51 === Backtracking. Learning clause 80:3:2:[78.2,39.1]:TopTop: p4(x0,c27),p4(x1,f16(f17(c27,f5(c25,c26,c27)))),p22(f16(f17(x0,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c27))),x1) ->
% 8.25/2.51 === Conflict found: 70:2:1:[28.1,4.1,40.1]:Top: p4(f16(f17(c27,f5(c25,c26,c27))),x0) -> p22(f16(f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c27))),x0) {x0 -> c25}
% 8.25/2.51 === Backtracking. Learning clause 81:4:2:[70.2,80.3,22.3]:TopTop: p4(c27,c27),p4(x0,f16(f17(c27,f5(c25,c26,c27)))),p4(x1,f16(f17(c27,f5(c25,c26,c27)))),p4(x1,x0) ->
% 8.25/2.51 === Conflict found: 81:4:2:[70.2,80.3,22.3]:TopTop: p4(c27,c27),p4(x0,f16(f17(c27,f5(c25,c26,c27)))),p4(x1,f16(f17(c27,f5(c25,c26,c27)))),p4(x1,x0) -> {x0 -> f16(f17(c27,f5(c25,c26,c27))), x1 -> f16(f17(c27,f5(c25,c26,c27)))}
% 8.25/2.51
% 8.25/2.51 SZS status Unsatisfiable
% 8.25/2.51
% 8.25/2.51 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.25/2.51
% 8.25/2.51 SPASS-SCL-FOL Statistics:
% 8.25/2.51 Number of learned clauses: 40
% 8.25/2.51 Number of propagations: 2023
% 8.25/2.51 Number of decisions: 1495
% 8.25/2.51 Number of resolutions: 49
% 8.25/2.51 Number of condensations: 0
% 8.25/2.51 Number of sub resolutions: 0
% 8.25/2.51 Number of input literals (deduplicated): 42
% 8.25/2.51 Number of grows: 6
% 8.25/2.51 Number of considered ground atoms: 233
% 8.25/2.51
% 8.25/2.51 Needed: 0:00:01.96
% 8.25/2.51
%------------------------------------------------------------------------------