%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN677-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 : 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:09 PM UTC 2026
% Result : Unsatisfiable 5.71s 1.67s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN677-1 : TPTP v9.2.1. Released v2.5.0.
% 0.11/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.34 % Computer : n011.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Thu May 7 13:46:48 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 SPASS-SCL-FOL version:
% 0.19/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 5.71/1.67 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.71/1.67 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.71/1.67 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.71/1.67 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.71/1.67 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.71/1.67 Execution resolution_1 ended with status: unsatisfiable
% 5.71/1.67 Used heuristic: resolution_1
% 5.71/1.67
% 5.71/1.67 Input Clauses:
% 5.71/1.67
% 5.71/1.67 Predicates: p22 p10 p7 p6 p3 p2 p19 p18 p14 p12 p25 p26 p23 p27 p24
% 5.71/1.67 Fol Constants: c28 c36 c33 c32 c31 c29 c30 c37 c34 c35
% 5.71/1.67 Fol Functions: f9 f8 f20 f5 f4 f17 f16 f11 f21 f13 f15
% 5.71/1.67 Problem Properties:
% 5.71/1.67 This is a full first-order problem without equality.
% 5.71/1.67
% 5.71/1.67 After reduction: Problem Properties:
% 5.71/1.67 This is a full first-order problem without equality.
% 5.71/1.67
% 5.71/1.67
% 5.71/1.67 Reduced Input Clauses:
% 5.71/1.67
% 5.71/1.67 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)
% 5.71/1.67
% 5.71/1.67 === Starting SPASS-SCL-FOL A Little Less Naive, considering 51 atoms initially, heuristics mode: resolution_1 ===
% 5.71/1.67
% 5.71/1.67 === Backtracking. Learning clause 56:3:2:[37.2,11.1]:TopTop: p2(c33,x0),p2(c36,x1) -> p25(x1,x0)
% 5.71/1.67 === Backtracking. Learning clause 57:2:1:[27.2,15.1]:Top: p7(f8(c29),x0) -> p7(x0,c30)
% 5.71/1.67 === Backtracking. Learning clause 58:2:1:[30.2,14.1]:Top: p2(c32,x0) -> p2(x0,f9(c31))
% 5.71/1.67 === Backtracking. Learning clause 59:2:2:[27.2,3.1]:TopTop: p7(x0,x1) -> p7(x1,x0)
% 5.71/1.67 === Backtracking. Learning clause 60:2:2:[29.2,5.1]:TopTop: p3(x0,x1) -> p3(x1,x0)
% 5.71/1.67 === Backtracking. Learning clause 61:2:2:[30.2,6.1]:TopTop: p2(x0,x1) -> p2(x1,x0)
% 5.71/1.67 === Clause set with instances from active satisfied. Growing active. New size: 123
% 5.71/1.67 === Restarting.
% 5.71/1.67 === Backtracking. Learning clause 62:2:2:[31.2,7.1]:TopTop: p19(x0,x1) -> p19(x1,x0)
% 5.71/1.67 === Backtracking. Learning clause 63:2:2:[34.2,10.1]:TopTop: p12(x0,x1) -> p12(x1,x0)
% 5.71/1.67 === Backtracking. Learning clause 64:2:2:[49.3,19.1]:TopTop: p2(x0,f16(x0,x1)),p2(x1,f9(f17(c31))) ->
% 5.71/1.67 === Backtracking. Learning clause 65: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)
% 5.71/1.67 === Backtracking. Learning clause 66: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))))
% 5.71/1.67 === Backtracking. Learning clause 67:2:0:[48.3,43.1]:: p10(c34,c34),p3(f4(f21(c32,f9(f17(c31)))),f4(c32)) ->
% 5.71/1.67 === Clause set with instances from active satisfied. Growing active. New size: 162
% 5.71/1.67 === Restarting.
% 5.71/1.67 === Backtracking. Learning clause 68:2:2:[33.2,9.1]:TopTop: p14(x0,x1) -> p14(x1,x0)
% 5.71/1.67 === Backtracking. Learning clause 69:2:1:[30.2,40.1]:Top: p2(f11(f4(c32),c34),x0) -> p2(x0,f16(f11(f4(c36),c34),f9(f17(c31))))
% 5.71/1.67 === Backtracking. Learning clause 70:2:0:[50.3,43.1]:: p25(f21(c32,f9(f17(c31))),c33),p25(c32,f21(c32,f9(f17(c31)))) ->
% 5.71/1.67 === Backtracking. Learning clause 71:2:0:[51.3,43.1]:: p25(f21(c32,f9(f17(c31))),c36),p25(c32,f21(c32,f9(f17(c31)))) ->
% 5.71/1.67 === Clause set with instances from active satisfied. Growing active. New size: 170
% 5.71/1.67 === Restarting.
% 5.71/1.67 === Backtracking. Learning clause 72:5:4:[37.2,12.1,37.2]:TopTopTopTop: p2(c33,x0),p2(c32,x1),p2(x0,x2),p2(x1,x3) -> p25(x3,x2)
% 5.71/1.67 === Conflict found: 59:2:2:[27.2,3.1]:TopTop: p7(x0,x1) -> p7(x1,x0) {x0 -> c28, x1 -> f8(c29)}
% 5.71/1.67 === Backtracking. Learning clause 73:2:1:[59.2,57.1]:Top: p7(x0,f8(c29)) -> p7(x0,c30)
% 5.71/1.67 === Conflict found: 64:2:2:[49.3,19.1]:TopTop: p2(x0,f16(x0,x1)),p2(x1,f9(f17(c31))) -> {x0 -> c28, x1 -> f9(c28)}
% 5.71/1.67 === Backtracking. Learning clause 74:2:2:[64.2,24.2]:TopTop: p2(x0,f16(x0,f9(x1))),p2(x1,f17(c31)) ->
% 5.71/1.67 === Conflict found: 71:2:0:[51.3,43.1]:: p25(f21(c32,f9(f17(c31))),c36),p25(c32,f21(c32,f9(f17(c31)))) -> {}
% 5.71/1.67 === Backtracking. Learning clause 75:4:2:[71.1,37.4]:TopTop: p25(c32,f21(c32,f9(f17(c31)))),p2(x0,c36),p25(x1,x0),p2(x1,f21(c32,f9(f17(c31)))) ->
% 5.71/1.67 === Conflict found: 60:2:2:[29.2,5.1]:TopTop: p3(x0,x1) -> p3(x1,x0) {x0 -> f4(c32), x1 -> f4(f21(c32,f9(f17(c31))))}
% 5.71/1.67 === Backtracking. Learning clause 76:2:0:[60.2,67.2]:: p3(f4(c32),f4(f21(c32,f9(f17(c31))))),p10(c34,c34) ->
% 5.71/1.67 === Conflict found: 69:2:1:[30.2,40.1]:Top: p2(f11(f4(c32),c34),x0) -> p2(x0,f16(f11(f4(c36),c34),f9(f17(c31)))) {x0 -> f11(f4(c36),c34)}
% 5.71/1.67 === Backtracking. Learning clause 77:1:0:[69.2,19.1]:: p2(f11(f4(c32),c34),f11(f4(c36),c34)) ->
% 5.71/1.67 === Backtracking. Learning clause 78:2:1:[30.3,43.1]:Top: p2(x0,f11(f4(f21(c32,f9(f17(c31)))),c34)),p2(x0,f11(f4(c32),c34)) ->
% 5.71/1.67 === Backtracking. Learning clause 79: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)
% 5.71/1.67 === Clause set with instances from active satisfied. Growing active. New size: 217
% 5.71/1.67 === Restarting.
% 5.71/1.67 === Conflict found: 59:2:2:[27.2,3.1]:TopTop: p7(x0,x1) -> p7(x1,x0) {x0 -> f8(c29), x1 -> c30}
% 5.71/1.67 === Backtracking. Learning clause 80:2:1:[59.1,15.1,27.2]:Top: p7(c30,x0) -> p7(x0,f8(c29))
% 5.71/1.67 === Backtracking. Learning clause 81:3:2:[27.1,22.2,59.2,59.1,80.2]:TopTop: p6(c29,x0),p7(c30,x1) -> p7(x1,f8(x0))
% 5.71/1.67 === Conflict found: 61:2:2:[30.2,6.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> f11(f4(c36),c34), x1 -> f11(f4(c32),c34)}
% 5.71/1.67
% 5.71/1.67 SZS status Unsatisfiable
% 5.71/1.67
% 5.71/1.67 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.71/1.67
% 5.71/1.67 SPASS-SCL-FOL Statistics:
% 5.71/1.67 Number of learned clauses: 26
% 5.71/1.67 Number of propagations: 1201
% 5.71/1.67 Number of decisions: 903
% 5.71/1.67 Number of resolutions: 35
% 5.71/1.67 Number of condensations: 0
% 5.71/1.67 Number of sub resolutions: 0
% 5.71/1.67 Number of input literals (deduplicated): 58
% 5.71/1.67 Number of grows: 4
% 5.71/1.67 Number of considered ground atoms: 217
% 5.71/1.67
% 5.71/1.67 Needed: 0:00:01.15
% 5.71/1.67
%------------------------------------------------------------------------------