%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN672-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 : n012.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 0.86s 0.60s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SYN672-1 : TPTP v9.2.1. Released v2.5.0.
% 0.00/0.08 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.27 % Computer : n012.cluster.edu
% 0.09/0.27 % Model : x86_64 x86_64
% 0.09/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.27 % Memory : 8042.1875MB
% 0.09/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.27 % CPULimit : 300
% 0.09/0.27 % WCLimit : 300
% 0.09/0.27 % DateTime : Thu May 7 13:47:01 EDT 2026
% 0.09/0.28 % CPUTime :
% 0.09/0.28 SPASS-SCL-FOL version:
% 0.09/0.33 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.86/0.60 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.86/0.60 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.86/0.60 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.86/0.60 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.86/0.60 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.86/0.60 Execution resolution_3 ended with status: unsatisfiable
% 0.86/0.60 Used heuristic: resolution_3
% 0.86/0.60
% 0.86/0.60 Input Clauses:
% 0.86/0.60
% 0.86/0.60 Predicates: p11 p9 p8 p6 p5 p3 p28 p26 p24 p22 p21 p2 p19 p18 p16 p15 p13 p31 p30
% 0.86/0.60 Fol Constants: c40 c38 c39 c36 c37 c34 c32 c33 c35 c41 c42
% 0.86/0.60 Fol Functions: f14 f20 f17 f7 f4 f12 f10 f23 f27 f25 f29
% 0.86/0.60 Problem Properties:
% 0.86/0.60 This is a full first-order problem without equality.
% 0.86/0.60
% 0.86/0.60 After reduction: Problem Properties:
% 0.86/0.60 This is a full first-order problem without equality.
% 0.86/0.60
% 0.86/0.60
% 0.86/0.60 Reduced Input Clauses:
% 0.86/0.60
% 0.86/0.60 Most General Atoms: p11(x1,x2) p9(x1,x2) p5(x1,x2) p21(x1,x2) p2(x1,x2) p19(x1,x2) p15(x1,x2) p13(x1,x2) p16(x2,x3) p31(x1,x3) p30(x2,x3) p3(x2,x3) p8(x2,x3) p22(x2,x3) p6(x2,x3) p26(x2,x3) p24(x2,x3) p28(x2,x3) p18(x2,x3)
% 0.86/0.60
% 0.86/0.60 === Starting SPASS-SCL-FOL A Little Less Naive, considering 51 atoms initially, heuristics mode: resolution_3 ===
% 0.86/0.60
% 0.86/0.60 === Backtracking. Learning clause 55:2:2:[21.2,2.1]:TopTop: p9(x0,x1) -> p9(x1,x0)
% 0.86/0.60 === Backtracking. Learning clause 56:2:2:[22.2,3.1]:TopTop: p8(x0,x1) -> p8(x1,x0)
% 0.86/0.60 === Backtracking. Learning clause 57:2:2:[25.2,6.1]:TopTop: p3(x0,x1) -> p3(x1,x0)
% 0.86/0.60 === Backtracking. Learning clause 58:2:2:[34.2,15.1]:TopTop: p16(x0,x1) -> p16(x1,x0)
% 0.86/0.60 === Backtracking. Learning clause 59:3:2:[38.2,19.1]:TopTop: p19(f20(c36,c39),x0),p16(f17(c37,c40),x1) -> p31(x0,x1)
% 0.86/0.60 === Backtracking. Learning clause 60:3:4:[39.3,37.1]:TopTopTopTop: p30(x0,f4(f7(c34,x1),f14(c38,x2))),p9(x0,x3) -> p30(x3,f14(x1,x2))
% 0.86/0.60 === Backtracking. Learning clause 61:2:3:[25.2,37.1]:TopTopTop: p3(f4(f7(c34,x0),f14(c38,x1)),x2) -> p3(x2,f14(x0,x1))
% 0.86/0.60 === Backtracking. Learning clause 62:3:2:[39.4,40.1]:TopTop: p30(x0,x1),p9(x0,f10(f12(c32,c33),f14(c35,c39))),p3(x1,f4(f7(c34,c35),c40)) ->
% 0.86/0.60 === Clause set with instances from active satisfied. Growing active. New size: 114
% 0.86/0.60 === Restarting.
% 0.86/0.60 === Conflict found: 58:2:2:[34.2,15.1]:TopTop: p16(x0,x1) -> p16(x1,x0) {x0 -> c40, x1 -> f17(c37,c40)}
% 0.86/0.60 === Backtracking. Learning clause 63:3:2:[58.2,59.2]:TopTop: p16(x0,f17(c37,c40)),p19(f20(c36,c39),x1) -> p31(x1,x0)
% 0.86/0.60 === Backtracking. Learning clause 64:2:2:[28.2,9.1]:TopTop: p24(x0,x1) -> p24(x1,x0)
% 0.86/0.60 === Backtracking. Learning clause 65:2:2:[29.2,10.1]:TopTop: p22(x0,x1) -> p22(x1,x0)
% 0.86/0.60 === Backtracking. Learning clause 66:2:2:[30.2,11.1]:TopTop: p21(x0,x1) -> p21(x1,x0)
% 0.86/0.60 === Backtracking. Learning clause 67:2:2:[31.2,12.1]:TopTop: p2(x0,x1) -> p2(x1,x0)
% 0.86/0.60 === Backtracking. Learning clause 68:2:2:[32.2,13.1]:TopTop: p19(x0,x1) -> p19(x1,x0)
% 0.86/0.60 === Backtracking. Learning clause 69:4:5:[32.1,51.3]:TopTopTopTopTop: p19(f20(x0,x1),x2),p13(x1,x3),p18(x0,x4) -> p19(f20(x4,x3),x2)
% 0.86/0.60 === Conflict found: 63:3:2:[58.2,59.2]:TopTop: p16(x0,f17(c37,c40)),p19(f20(c36,c39),x1) -> p31(x1,x0) {x0 -> c40, x1 -> f20(c36,c39)}
% 0.86/0.60 === Backtracking. Learning clause 70:2:1:[63.2,13.1]:Top: p16(x0,f17(c37,c40)) -> p31(f20(c36,c39),x0)
% 0.86/0.60 === Backtracking. Learning clause 71:4:5:[34.1,41.3,58.2,58.1]:TopTopTopTopTop: p15(x0,x1),p3(x2,x3),p16(x4,f17(x0,x2)) -> p16(x4,f17(x1,x3))
% 0.86/0.60 === Conflict found: 57:2:2:[25.2,6.1]:TopTop: p3(x0,x1) -> p3(x1,x0) {x0 -> c40, x1 -> f4(f7(c34,c40),f14(c38,c40))}
% 0.86/0.60 === Backtracking. Learning clause 72:2:3:[57.2,61.1]:TopTopTop: p3(x0,f4(f7(c34,x1),f14(c38,x2))) -> p3(x0,f14(x1,x2))
% 0.86/0.60 === Conflict found: 62:3:2:[39.4,40.1]:TopTop: p30(x0,x1),p9(x0,f10(f12(c32,c33),f14(c35,c39))),p3(x1,f4(f7(c34,c35),c40)) -> {x0 -> f10(c40,c40), x1 -> c40}
% 0.86/0.60 === Backtracking. Learning clause 73:4:3:[62.2,42.3]:TopTopTop: p30(f10(x0,x1),x2),p3(x2,f4(f7(c34,c35),c40)),p3(x1,f14(c35,c39)),p8(x0,f12(c32,c33)) ->
% 0.86/0.60 === Conflict found: 62:3:2:[39.4,40.1]:TopTop: p30(x0,x1),p9(x0,f10(f12(c32,c33),f14(c35,c39))),p3(x1,f4(f7(c34,c35),c40)) -> {x0 -> c40, x1 -> f4(c40,c40)}
% 0.86/0.60 === Backtracking. Learning clause 74:4:3:[62.3,44.3]:TopTopTop: p30(x0,f4(x1,x2)),p9(x0,f10(f12(c32,c33),f14(c35,c39))),p2(x1,f7(c34,c35)),p3(x2,c40) ->
% 0.86/0.60 === Conflict found: 57:2:2:[25.2,6.1]:TopTop: p3(x0,x1) -> p3(x1,x0) {x0 -> f4(f7(c34,c40),f14(c38,c40)), x1 -> f14(c40,c40)}
% 0.86/0.60 === Backtracking. Learning clause 75:1:2:[57.1,37.1]:TopTop: -> p3(f14(x0,x1),f4(f7(c34,x0),f14(c38,x1)))
% 0.86/0.60 === Backtracking. Learning clause 76:4:4:[53.3,60.1]:TopTopTopTop: p31(f20(c36,x0),f17(c37,f4(f7(c34,x1),f14(c38,x2)))),p9(f10(f12(c32,c33),f14(c38,x0)),x3) -> p3(f4(f7(c34,x1),f14(c38,x2)),f14(c38,x0)),p30(x3,f14(x1,x2))
% 0.86/0.60 === Conflict found: 60:3:4:[39.3,37.1]:TopTopTopTop: p30(x0,f4(f7(c34,x1),f14(c38,x2))),p9(x0,x3) -> p30(x3,f14(x1,x2)) {x0 -> f10(f12(c32,c33),f4(f7(c34,c35),c40)), x1 -> c35, x2 -> c40, x3 -> c40}
% 0.86/0.60 === Backtracking. Learning clause 77:3:3:[60.1,54.2]:TopTopTop: p9(f10(f12(c32,c33),f4(f7(c34,c35),x0)),x1),p30(f10(f12(c32,c33),x0),f14(c38,x2)) -> p30(x1,f14(c35,x2))
% 0.86/0.60 === Backtracking. Learning clause 78:3:5:[39.3,52.1]:TopTopTopTopTop: p30(x0,f4(f7(c34,x1),f23(f29(c41,x2),x3))),p9(x0,x4) -> p30(x4,f23(f29(c41,x2),f25(f27(c42,f7(c34,x1)),x3)))
% 0.86/0.60 === Backtracking. Learning clause 79:2:4:[25.1,52.1,57.1]:TopTopTopTop: p3(f4(f7(c34,x0),f23(f29(c41,x1),x2)),x3) -> p3(x3,f23(f29(c41,x1),f25(f27(c42,f7(c34,x0)),x2)))
% 0.86/0.60 === Clause set with instances from active satisfied. Growing active. New size: 151
% 0.86/0.60 === Restarting.
% 0.86/0.60 === Backtracking. Learning clause 80:5:6:[38.3,41.3]:TopTopTopTopTopTop: p19(x0,x1),p31(x0,f17(x2,x3)),p15(x2,x4),p3(x3,x5) -> p31(x1,f17(x4,x5))
% 0.86/0.60 === Conflict found: 73:4:3:[62.2,42.3]:TopTopTop: p30(f10(x0,x1),x2),p3(x2,f4(f7(c34,c35),c40)),p3(x1,f14(c35,c39)),p8(x0,f12(c32,c33)) -> {x0 -> c40, x1 -> c40, x2 -> f4(c40,c40)}
% 0.86/0.60 === Backtracking. Learning clause 81:5:4:[73.2,44.3]:TopTopTopTop: p30(f10(x0,x1),f4(x2,x3)),p3(x1,f14(c35,c39)),p8(x0,f12(c32,c33)),p2(x2,f7(c34,c35)),p3(x3,c40) ->
% 0.86/0.60 === Conflict found: 55:2:2:[21.2,2.1]:TopTop: p9(x0,x1) -> p9(x1,x0) {x0 -> c40, x1 -> f10(f12(c32,c33),f4(f7(c34,c35),c40))}
% 0.86/0.60 === Backtracking. Learning clause 82:3:3:[55.2,77.1]:TopTopTop: p9(x0,f10(f12(c32,c33),f4(f7(c34,c35),x1))),p30(f10(f12(c32,c33),x1),f14(c38,x2)) -> p30(x0,f14(c35,x2))
% 0.86/0.60 === Conflict found: 62:3:2:[39.4,40.1]:TopTop: p30(x0,x1),p9(x0,f10(f12(c32,c33),f14(c35,c39))),p3(x1,f4(f7(c34,c35),c40)) -> {x0 -> f10(c40,c40), x1 -> f4(f7(c34,c35),c40)}
% 0.86/0.60 === Backtracking. Learning clause 83:3:2:[62.3,6.1,42.3]:TopTop: p30(f10(x0,x1),f4(f7(c34,c35),c40)),p3(x1,f14(c35,c39)),p8(x0,f12(c32,c33)) ->
% 0.86/0.60 === Conflict found: 63:3:2:[58.2,59.2]:TopTop: p16(x0,f17(c37,c40)),p19(f20(c36,c39),x1) -> p31(x1,x0) {x0 -> f17(c37,f4(f7(c34,c40),f14(c38,c40))), x1 -> f20(c36,c40)}
% 0.86/0.60 === Backtracking. Learning clause 84:5:4:[63.3,76.1,58.2]:TopTopTopTop: p19(f20(c36,c39),f20(c36,x0)),p9(f10(f12(c32,c33),f14(c38,x0)),x1),p16(f17(c37,c40),f17(c37,f4(f7(c34,x2),f14(c38,x3)))) -> p3(f4(f7(c34,x2),f14(c38,x3)),f14(c38,x0)),p30(x1,f14(x2,x3))
% 0.86/0.60 === Backtracking. Learning clause 85:2:1:[39.2,2.1,40.1]:Top: p30(f10(f12(c32,c33),f14(c35,c39)),x0),p3(x0,f4(f7(c34,c35),c40)) ->
% 0.86/0.60 === Conflict found: 83:3:2:[62.3,6.1,42.3]:TopTop: p30(f10(x0,x1),f4(f7(c34,c35),c40)),p3(x1,f14(c35,c39)),p8(x0,f12(c32,c33)) -> {x0 -> f12(c32,c33), x1 -> f4(f7(c34,c35),c40)}
% 0.86/0.60 === Backtracking. Learning clause 86:3:1:[83.1,54.2]:Top: p3(f4(f7(c34,c35),x0),f14(c35,c39)),p8(f12(c32,c33),f12(c32,c33)),p30(f10(f12(c32,c33),x0),c40) ->
% 0.86/0.60 === Conflict found: 60:3:4:[39.3,37.1]:TopTopTopTop: p30(x0,f4(f7(c34,x1),f14(c38,x2))),p9(x0,x3) -> p30(x3,f14(x1,x2)) {x0 -> f10(f12(c32,c33),f4(f7(c34,c35),c40)), x1 -> c35, x2 -> c40, x3 -> f10(f12(c32,c33),f4(f7(c34,c35),c40))}
% 0.86/0.60 === Backtracking. Learning clause 87:2:2:[60.2,2.1,54.2]:TopTop: p30(f10(f12(c32,c33),x0),f14(c38,x1)) -> p30(f10(f12(c32,c33),f4(f7(c34,c35),x0)),f14(c35,x1))
% 0.86/0.60 === Clause set with instances from active satisfied. Growing active. New size: 172
% 0.86/0.60 === Restarting.
% 0.86/0.60 === Conflict found: 57:2:2:[25.2,6.1]:TopTop: p3(x0,x1) -> p3(x1,x0) {x0 -> f14(c35,c39), x1 -> f4(f7(c34,c35),c40)}
% 0.86/0.60 === Backtracking. Learning clause 88:3:1:[57.2,86.1]:Top: p3(f14(c35,c39),f4(f7(c34,c35),x0)),p8(f12(c32,c33),f12(c32,c33)),p30(f10(f12(c32,c33),x0),c40) ->
% 0.86/0.60 === Conflict found: 86:3:1:[83.1,54.2]:Top: p3(f4(f7(c34,c35),x0),f14(c35,c39)),p8(f12(c32,c33),f12(c32,c33)),p30(f10(f12(c32,c33),x0),c40) -> {x0 -> f14(c38,c39)}
% 0.86/0.60
% 0.86/0.60 SZS status Unsatisfiable
% 0.86/0.60
% 0.86/0.60 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.86/0.60
% 0.86/0.60 SPASS-SCL-FOL Statistics:
% 0.86/0.60 Number of learned clauses: 34
% 0.86/0.60 Number of propagations: 1004
% 0.86/0.60 Number of decisions: 647
% 0.86/0.60 Number of resolutions: 46
% 0.86/0.60 Number of condensations: 0
% 0.86/0.60 Number of sub resolutions: 0
% 0.86/0.60 Number of input literals (deduplicated): 57
% 0.86/0.60 Number of grows: 3
% 0.86/0.60 Number of considered ground atoms: 172
% 0.86/0.60
% 0.86/0.60 Needed: 0:00:00.18
% 0.86/0.60
%------------------------------------------------------------------------------