%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN628-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 : n011.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 4.17s 1.51s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYN628-1 : TPTP v9.2.1. Released v2.5.0.
% 0.12/0.14 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.36 % Computer : n011.cluster.edu
% 0.17/0.36 % Model : x86_64 x86_64
% 0.17/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.36 % Memory : 8042.1875MB
% 0.17/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.36 % CPULimit : 300
% 0.17/0.36 % WCLimit : 300
% 0.17/0.36 % DateTime : Thu May 7 13:46:03 EDT 2026
% 0.17/0.36 % CPUTime :
% 0.17/0.36 SPASS-SCL-FOL version:
% 0.17/0.46 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 4.17/1.51 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.17/1.51 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.17/1.51 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.17/1.51 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.17/1.51 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.17/1.51 Execution resolution_3 ended with status: unsatisfiable
% 4.17/1.51 Used heuristic: resolution_3
% 4.17/1.51
% 4.17/1.51 Input Clauses:
% 4.17/1.51
% 4.17/1.51 Predicates: p2 p9 p6 p5 p3 p20 p21 p19
% 4.17/1.51 Fol Constants: c28 c22 c26 c27 c23 c24 c25 c29
% 4.17/1.51 Fol Functions: f8 f7 f4 f16 f12 f13 f14 f11 f18 f17 f15 f10
% 4.17/1.51 Problem Properties:
% 4.17/1.51 This is a full first-order problem without equality.
% 4.17/1.51
% 4.17/1.51 After reduction: Problem Properties:
% 4.17/1.51 This is a full first-order problem without equality.
% 4.17/1.51
% 4.17/1.51
% 4.17/1.51 Reduced Input Clauses:
% 4.17/1.51
% 4.17/1.51 Most General Atoms: p2(x1,x2) p3(x1,x2) p9(x2,x3) p19(x3,x1) p21(x1,x3) p20(x1,x3) p6(x2,x3) p5(x2,x3)
% 4.17/1.51
% 4.17/1.51 === Starting SPASS-SCL-FOL A Little Less Naive, considering 51 atoms initially, heuristics mode: resolution_3 ===
% 4.17/1.51
% 4.17/1.51 === Backtracking. Learning clause 37:3:2:[26.3,8.1]:TopTop: p9(c28,x0),p9(c26,x1) -> p20(x0,x1)
% 4.17/1.51 === Backtracking. Learning clause 38:3:2:[25.3,9.1]:TopTop: p9(c27,x0),p9(c22,x1) -> p21(x0,x1)
% 4.17/1.51 === Backtracking. Learning clause 39:2:2:[20.2,2.1]:TopTop: p9(x0,x1) -> p9(x1,x0)
% 4.17/1.51 === Backtracking. Learning clause 40:2:2:[22.2,4.1]:TopTop: p5(x0,x1) -> p5(x1,x0)
% 4.17/1.51 === Backtracking. Learning clause 41:2:2:[23.2,5.1]:TopTop: p3(x0,x1) -> p3(x1,x0)
% 4.17/1.51 === Backtracking. Learning clause 42:2:2:[19.2,1.1]:TopTop: p2(x0,x1) -> p2(x1,x0)
% 4.17/1.51 === Backtracking. Learning clause 43:3:2:[24.3,10.1]:TopTop: p3(f4(f7(c23,f8(c24,c25))),x0),p9(c22,x1) -> p19(x1,x0)
% 4.17/1.51 === Clause set with instances from active satisfied. Growing active. New size: 108
% 4.17/1.51 === Restarting.
% 4.17/1.51 === Backtracking. Learning clause 44:2:2:[21.2,3.1]:TopTop: p6(x0,x1) -> p6(x1,x0)
% 4.17/1.51 === Conflict found: 41:2:2:[23.2,5.1]:TopTop: p3(x0,x1) -> p3(x1,x0) {x0 -> c28, x1 -> f4(f7(c23,f8(c24,c25)))}
% 4.17/1.51 === Backtracking. Learning clause 45:3:2:[41.2,43.1]:TopTop: p3(x0,f4(f7(c23,f8(c24,c25)))),p9(c22,x1) -> p19(x1,x0)
% 4.17/1.51 === Backtracking. Learning clause 46:2:0:[33.3,10.1]:: p21(c22,c26),p21(c22,c22) ->
% 4.17/1.51 === Backtracking. Learning clause 47:2:0:[33.3,11.1]:: p21(c27,c26),p21(c22,c27) ->
% 4.17/1.51 === Conflict found: 43:3:2:[24.3,10.1]:TopTop: p3(f4(f7(c23,f8(c24,c25))),x0),p9(c22,x1) -> p19(x1,x0) {x0 -> f4(f7(c23,f8(c24,c25))), x1 -> c28}
% 4.17/1.51 === Backtracking. Learning clause 48:5:3:[43.1,5.1,33.3,25.4]:TopTopTop: p9(c22,x0),p21(x0,c26),p9(x1,c22),p9(x2,x0),p21(x1,x2) ->
% 4.17/1.51 === Conflict found: 37:3:2:[26.3,8.1]:TopTop: p9(c28,x0),p9(c26,x1) -> p20(x0,x1) {x0 -> f16(f17(c22,c27)), x1 -> f10(f15(f7(c23,f8(c24,c25)),c22),f11(f12(f13(f14(c29)))))}
% 4.17/1.51 === Backtracking. Learning clause 49:2:0:[37.3,35.1]:: p9(c28,f16(f17(c22,c27))),p9(c26,f10(f15(f7(c23,f8(c24,c25)),c22),f11(f12(f13(f14(c29)))))) ->
% 4.17/1.51 === Backtracking. Learning clause 50:3:2:[26.4,35.1]:TopTop: p9(x0,f16(f17(c22,c27))),p9(x1,f10(f15(f7(c23,f8(c24,c25)),c22),f11(f12(f13(f14(c29)))))),p20(x0,x1) ->
% 4.17/1.51 === Clause set with instances from active satisfied. Growing active. New size: 132
% 4.17/1.51 === Restarting.
% 4.17/1.51 === Conflict found: 38:3:2:[25.3,9.1]:TopTop: p9(c27,x0),p9(c22,x1) -> p21(x0,x1) {x0 -> c28, x1 -> c26}
% 4.17/1.51 === Backtracking. Learning clause 51:3:1:[38.3,48.2,39.2,39.2,20.3,39.2]:Top: p9(x0,c27),p9(x0,c26),p9(x0,c22) ->
% 4.17/1.51 === Backtracking. Learning clause 52:7:3:[25.3,38.3,48.2]:TopTopTop: p9(x0,x1),p9(x2,c26),p9(c27,x0),p9(c22,x2),p9(c22,x1),p9(x1,c22),p9(c26,x1) ->
% 4.17/1.51 === Conflict found: 47:2:0:[33.3,11.1]:: p21(c27,c26),p21(c22,c27) -> {}
% 4.17/1.51 === Backtracking. Learning clause 53:3:0:[47.1,38.3]:: p21(c22,c27),p9(c27,c27),p9(c22,c26) ->
% 4.17/1.51 === Backtracking. Learning clause 54:4:3:[31.3,50.2]:TopTopTop: p9(x0,f15(f7(c23,f8(c24,c25)),c22)),p9(x1,f11(f12(f13(f14(c29))))),p9(x2,f16(f17(c22,c27))),p20(x2,f10(x0,x1)) ->
% 4.17/1.51 === Backtracking. Learning clause 55:2:1:[26.2,2.1,35.1]:Top: p9(x0,f16(f17(c22,c27))),p20(x0,f10(f15(f7(c23,f8(c24,c25)),c22),f11(f12(f13(f14(c29)))))) ->
% 4.17/1.51 === Clause set with instances from active satisfied. Growing active. New size: 162
% 4.17/1.51 === Restarting.
% 4.17/1.51 === Conflict found: 54:4:3:[31.3,50.2]:TopTopTop: p9(x0,f15(f7(c23,f8(c24,c25)),c22)),p9(x1,f11(f12(f13(f14(c29))))),p9(x2,f16(f17(c22,c27))),p20(x2,f10(x0,x1)) -> {x0 -> f15(c28,c28), x1 -> c28, x2 -> c28}
% 4.17/1.51 === Backtracking. Learning clause 56:5:4:[54.1,30.3]:TopTopTopTop: p9(x0,f11(f12(f13(f14(c29))))),p9(x1,f16(f17(c22,c27))),p20(x1,f10(f15(x2,x3),x0)),p2(x2,f7(c23,f8(c24,c25))),p9(x3,c22) ->
% 4.17/1.51 === Conflict found: 54:4:3:[31.3,50.2]:TopTopTop: p9(x0,f15(f7(c23,f8(c24,c25)),c22)),p9(x1,f11(f12(f13(f14(c29))))),p9(x2,f16(f17(c22,c27))),p20(x2,f10(x0,x1)) -> {x0 -> f15(f7(c23,f8(c24,c25)),c22), x1 -> c28, x2 -> c28}
% 4.17/1.51 === Backtracking. Learning clause 57:3:2:[54.1,2.1]:TopTop: p9(x0,f11(f12(f13(f14(c29))))),p9(x1,f16(f17(c22,c27))),p20(x1,f10(f15(f7(c23,f8(c24,c25)),c22),x0)) ->
% 4.17/1.51 === Clause set with instances from active satisfied. Growing active. New size: 167
% 4.17/1.51 === Restarting.
% 4.17/1.51 === Conflict found: 37:3:2:[26.3,8.1]:TopTop: p9(c28,x0),p9(c26,x1) -> p20(x0,x1) {x0 -> c28, x1 -> f10(f15(c28,c28),c28)}
% 4.17/1.51 === Backtracking. Learning clause 58:7:5:[37.3,56.3,20.3]:TopTopTopTopTop: p9(c28,x0),p9(x1,f11(f12(f13(f14(c29))))),p9(x0,f16(f17(c22,c27))),p2(x2,f7(c23,f8(c24,c25))),p9(x3,c22),p9(x4,c26),p9(x4,f10(f15(x2,x3),x1)) ->
% 4.17/1.51 === Conflict found: 37:3:2:[26.3,8.1]:TopTop: p9(c28,x0),p9(c26,x1) -> p20(x0,x1) {x0 -> c28, x1 -> f10(f15(f7(c23,f8(c24,c25)),c22),c28)}
% 4.17/1.51 === Backtracking. Learning clause 59:5:3:[37.3,57.3,20.3]:TopTopTop: p9(c28,x0),p9(x1,f11(f12(f13(f14(c29))))),p9(x0,f16(f17(c22,c27))),p9(x2,c26),p9(x2,f10(f15(f7(c23,f8(c24,c25)),c22),x1)) ->
% 4.17/1.51 === Backtracking. Learning clause 60:3:4:[30.3,20.2,1.1]:TopTopTopTop: p9(x0,x1),p9(f15(x2,x0),x3) -> p9(x3,f15(x2,x1))
% 4.17/1.51 === Conflict found: 54:4:3:[31.3,50.2]:TopTopTop: p9(x0,f15(f7(c23,f8(c24,c25)),c22)),p9(x1,f11(f12(f13(f14(c29))))),p9(x2,f16(f17(c22,c27))),p20(x2,f10(x0,x1)) -> {x0 -> f15(f7(c23,f8(c24,c25)),c28), x1 -> f11(f12(f13(f14(c29)))), x2 -> f16(f17(c28,c27))}
% 4.17/1.51 === Backtracking. Learning clause 62:1:0:[6.0,61.1,54.4,34.1,30.3,2.1,1.1]:: p9(f16(f17(c28,c27)),f16(f17(c22,c27))) ->
% 4.17/1.51 === Clause set with instances from active satisfied. Growing active. New size: 182
% 4.17/1.51 === Restarting.
% 4.17/1.51 === Conflict found: 58:7:5:[37.3,56.3,20.3]:TopTopTopTopTop: p9(c28,x0),p9(x1,f11(f12(f13(f14(c29))))),p9(x0,f16(f17(c22,c27))),p2(x2,f7(c23,f8(c24,c25))),p9(x3,c22),p9(x4,c26),p9(x4,f10(f15(x2,x3),x1)) -> {x0 -> c28, x1 -> f11(c28), x2 -> c28, x3 -> c28, x4 -> c28}
% 4.17/1.51 === Backtracking. Learning clause 63:7:5:[58.2,18.2]:TopTopTopTopTop: p9(c28,x0),p9(x0,f16(f17(c22,c27))),p2(x1,f7(c23,f8(c24,c25))),p9(x2,c22),p9(x3,c26),p9(x3,f10(f15(x1,x2),f11(x4))),p5(x4,f12(f13(f14(c29)))) ->
% 4.17/1.51
% 4.17/1.51 SZS status Unsatisfiable
% 4.17/1.51
% 4.17/1.51 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.17/1.51
% 4.17/1.51 SPASS-SCL-FOL Statistics:
% 4.17/1.51 Number of learned clauses: 26
% 4.17/1.51 Number of propagations: 1088
% 4.17/1.51 Number of decisions: 800
% 4.17/1.51 Number of resolutions: 44
% 4.17/1.51 Number of condensations: 1
% 4.17/1.51 Number of sub resolutions: 1
% 4.17/1.51 Number of input literals (deduplicated): 38
% 4.17/1.51 Number of grows: 5
% 4.17/1.51 Number of considered ground atoms: 182
% 4.17/1.51
% 4.17/1.51 Needed: 0:00:00.93
% 4.17/1.51
%------------------------------------------------------------------------------