%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN634-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 : n023.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 64.55s 13.44s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN634-1 : TPTP v9.2.1. Released v2.5.0.
% 0.00/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.34 % Computer : n023.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Thu May 7 13:47:09 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 SPASS-SCL-FOL version:
% 0.19/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 64.55/13.44 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 64.55/13.44 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 64.55/13.44 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 64.55/13.44 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 64.55/13.44 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 64.55/13.44 Execution resolution_3 ended with status: unsatisfiable
% 64.55/13.44 Used heuristic: resolution_3
% 64.55/13.44
% 64.55/13.44 Input Clauses:
% 64.55/13.44
% 64.55/13.44 Predicates: p10 p9 p5 p3 p2 p14 p22 p21
% 64.55/13.44 Fol Constants: c23 c24 c25 c26 c27 c28 c29 c30 c32 c31
% 64.55/13.44 Fol Functions: f8 f7 f6 f4 f12 f15 f16 f13 f11 f20 f19 f18 f17
% 64.55/13.44 Problem Properties:
% 64.55/13.44 This is a full first-order problem without equality.
% 64.55/13.44
% 64.55/13.44 After reduction: Problem Properties:
% 64.55/13.44 This is a full first-order problem without equality.
% 64.55/13.44
% 64.55/13.44
% 64.55/13.44 Reduced Input Clauses:
% 64.55/13.44
% 64.55/13.44 Most General Atoms: p14(x1,x2) p22(x3,x1) p21(x3,x1) p3(x2,x3) p5(x2,x3) p9(x2,x3) p10(x4,x5) p2(x2,x3)
% 64.55/13.44
% 64.55/13.44 === Starting SPASS-SCL-FOL A Little Less Naive, considering 58 atoms initially, heuristics mode: resolution_3 ===
% 64.55/13.44
% 64.55/13.44 === Backtracking. Learning clause 41:2:2:[14.2,1.1]:TopTop: p10(x0,x1) -> p10(x1,x0)
% 64.55/13.44 === Backtracking. Learning clause 42:2:2:[17.2,4.1]:TopTop: p3(x0,x1) -> p3(x1,x0)
% 64.55/13.44 === Backtracking. Learning clause 43:2:2:[19.2,6.1]:TopTop: p14(x0,x1) -> p14(x1,x0)
% 64.55/13.44 === Backtracking. Learning clause 44:2:2:[16.2,3.1]:TopTop: p5(x0,x1) -> p5(x1,x0)
% 64.55/13.44 === Backtracking. Learning clause 45:2:2:[18.2,5.1]:TopTop: p2(x0,x1) -> p2(x1,x0)
% 64.55/13.44 === Backtracking. Learning clause 46:4:3:[26.2,21.2]:TopTopTop: p22(x0,f16(f6(c25,f7(c23,c26)))),p10(f12(f13(c28,x0)),x1),p10(f12(f13(c28,c29)),x2) -> p21(x2,x1)
% 64.55/13.44 === Backtracking. Learning clause 47:4:3:[27.2,21.2]:TopTopTop: p22(x0,f15(f6(c25,f7(c23,c26)))),p10(f12(f13(c28,x0)),x1),p10(f12(f13(c28,c29)),x2) -> p21(x2,x1)
% 64.55/13.44 === Backtracking. Learning clause 48:1:0:[28.4,25.1,5.1,2.1]:: p10(c28,c29) ->
% 64.55/13.44 === Backtracking. Learning clause 49:2:1:[14.3,25.1]:Top: p10(x0,f11(f6(c25,f7(c23,c26)),c27,c28)),p10(x0,f11(f6(c25,f7(c23,c26)),c27,c29)) ->
% 64.55/13.44 === Clause set with instances from active satisfied. Growing active. New size: 126
% 64.55/13.44 === Restarting.
% 64.55/13.44 === Backtracking. Learning clause 50:3:1:[26.2,37.1]:Top: p22(f20(x0,c28,c29),f16(f6(c25,f7(c23,c26)))) -> p3(f4(x0),f8(c24)),p10(f11(x0,c32,c28),f11(x0,c32,c29))
% 64.55/13.44 === Backtracking. Learning clause 51:3:1:[27.2,37.1]:Top: p22(f20(x0,c28,c29),f15(f6(c25,f7(c23,c26)))) -> p3(f4(x0),f8(c24)),p10(f11(x0,c32,c28),f11(x0,c32,c29))
% 64.55/13.44 === Backtracking. Learning clause 52:3:1:[26.2,38.1]:Top: p22(f17(x0,c28,c29),f16(f6(c25,f7(c23,c26)))) -> p3(f4(x0),f8(c24)),p10(f11(x0,c30,c28),f11(x0,c30,c29))
% 64.55/13.44 === Backtracking. Learning clause 53:3:1:[27.2,38.1]:Top: p22(f17(x0,c28,c29),f15(f6(c25,f7(c23,c26)))) -> p3(f4(x0),f8(c24)),p10(f11(x0,c30,c28),f11(x0,c30,c29))
% 64.55/13.44 === Backtracking. Learning clause 54:2:0:[36.3,25.1]:: -> p3(f4(f6(c25,f7(c23,c26))),f8(c24)),p22(f18(f6(c25,f7(c23,c26)),c28,c29),f16(f6(c25,f7(c23,c26))))
% 64.55/13.44 === Clause set with instances from active satisfied. Growing active. New size: 169
% 64.55/13.44 === Restarting.
% 64.55/13.44 === Backtracking. Learning clause 55:2:1:[14.3,48.1]:Top: p10(x0,c28),p10(x0,c29) ->
% 64.55/13.44 === Conflict found: 42:2:2:[17.2,4.1]:TopTop: p3(x0,x1) -> p3(x1,x0) {x0 -> f4(f6(c23,f7(c23,c23))), x1 -> c23}
% 64.55/13.44 === Backtracking. Learning clause 56:1:3:[42.1,8.1]:TopTopTop: -> p3(x0,f4(f6(x1,f7(x0,x2))))
% 64.55/13.44 === Backtracking. Learning clause 57:6:5:[20.4,47.1]:TopTopTopTopTop: p14(x0,f15(f6(c25,f7(c23,c26)))),p22(x1,x0),p10(x1,x2),p10(f12(f13(c28,x2)),x3),p10(f12(f13(c28,c29)),x4) -> p21(x4,x3)
% 64.55/13.44 === Backtracking. Learning clause 58:6:5:[20.4,46.1]:TopTopTopTopTop: p14(x0,f16(f6(c25,f7(c23,c26)))),p22(x1,x0),p10(x1,x2),p10(f12(f13(c28,x2)),x3),p10(f12(f13(c28,c29)),x4) -> p21(x4,x3)
% 64.55/13.44 === Backtracking. Learning clause 59:3:1:[26.2,40.1]:Top: p22(f19(x0,c28,c29),f16(f6(c25,f7(c23,c26)))) -> p3(f4(x0),f8(c24)),p10(f11(x0,c31,c28),f11(x0,c31,c29))
% 64.55/13.44 === Backtracking. Learning clause 60:3:1:[27.2,40.1]:Top: p22(f19(x0,c28,c29),f15(f6(c25,f7(c23,c26)))) -> p3(f4(x0),f8(c24)),p10(f11(x0,c31,c28),f11(x0,c31,c29))
% 64.55/13.44 === Backtracking. Learning clause 61:3:1:[26.2,39.1]:Top: p22(f18(x0,c28,c29),f16(f6(c25,f7(c23,c26)))) -> p3(f4(x0),f8(c24)),p10(f11(x0,c27,c28),f11(x0,c27,c29))
% 64.55/13.44 === Backtracking. Learning clause 62:3:1:[27.2,39.1]:Top: p22(f18(x0,c28,c29),f15(f6(c25,f7(c23,c26)))) -> p3(f4(x0),f8(c24)),p10(f11(x0,c27,c28),f11(x0,c27,c29))
% 64.55/13.44 === Conflict found: 46:4:3:[26.2,21.2]:TopTopTop: p22(x0,f16(f6(c25,f7(c23,c26)))),p10(f12(f13(c28,x0)),x1),p10(f12(f13(c28,c29)),x2) -> p21(x2,x1) {x0 -> f18(f6(c25,f7(c23,c26)),c28,c29), x1 -> c23, x2 -> f12(f13(c28,c29))}
% 64.55/13.44 === Backtracking. Learning clause 63:4:2:[46.1,54.2]:TopTop: p10(f12(f13(c28,f18(f6(c25,f7(c23,c26)),c28,c29))),x0),p10(f12(f13(c28,c29)),x1) -> p21(x1,x0),p3(f4(f6(c25,f7(c23,c26))),f8(c24))
% 64.55/13.44 === Conflict found: 49:2:1:[14.3,25.1]:Top: p10(x0,f11(f6(c25,f7(c23,c26)),c27,c28)),p10(x0,f11(f6(c25,f7(c23,c26)),c27,c29)) -> {x0 -> f11(f6(c25,f7(c23,c26)),c27,c23)}
% 64.55/13.44 === Backtracking. Learning clause 64:5:1:[49.2,36.3,28.4]:Top: p2(f6(c25,f7(c23,c26)),f6(c25,f7(c23,c26))),p9(c27,c27),p10(x0,c28) -> p3(f4(f6(c25,f7(c23,c26))),f8(c24)),p22(f18(f6(c25,f7(c23,c26)),x0,c29),f16(f6(c25,f7(c23,c26))))
% 64.55/13.44 === Conflict found: 49:2:1:[14.3,25.1]:Top: p10(x0,f11(f6(c25,f7(c23,c26)),c27,c28)),p10(x0,f11(f6(c25,f7(c23,c26)),c27,c29)) -> {x0 -> f11(f6(c25,f7(c23,c26)),c27,c23)}
% 64.55/13.44 === Backtracking. Learning clause 65:5:1:[49.2,39.3,28.4]:Top: p21(f12(f13(x0,c29)),f12(f13(x0,f18(f6(c25,f7(c23,c26)),x0,c29)))),p2(f6(c25,f7(c23,c26)),f6(c25,f7(c23,c26))),p9(c27,c27),p10(x0,c28) -> p3(f4(f6(c25,f7(c23,c26))),f8(c24))
% 64.55/13.44 === Conflict found: 61:3:1:[26.2,39.1]:Top: p22(f18(x0,c28,c29),f16(f6(c25,f7(c23,c26)))) -> p3(f4(x0),f8(c24)),p10(f11(x0,c27,c28),f11(x0,c27,c29)) {x0 -> f6(c25,f7(c23,c26))}
% 64.55/13.44 === Backtracking. Learning clause 66:1:0:[61.3,25.1,54.2]:: -> p3(f4(f6(c25,f7(c23,c26))),f8(c24))
% 64.55/13.44 === Clause set with instances from active satisfied. Growing active. New size: 195
% 64.55/13.44 === Restarting.
% 64.55/13.44
% 64.55/13.44 SZS status Unsatisfiable
% 64.55/13.44
% 64.55/13.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 64.55/13.44
% 64.55/13.44 SPASS-SCL-FOL Statistics:
% 64.55/13.44 Number of learned clauses: 26
% 64.55/13.44 Number of propagations: 679
% 64.55/13.44 Number of decisions: 746
% 64.55/13.44 Number of resolutions: 35
% 64.55/13.44 Number of condensations: 0
% 64.55/13.44 Number of sub resolutions: 0
% 64.55/13.44 Number of input literals (deduplicated): 46
% 64.55/13.44 Number of grows: 3
% 64.55/13.44 Number of considered ground atoms: 195
% 64.55/13.44
% 64.55/13.44 Needed: 0:0:12.85
% 64.55/13.44
%------------------------------------------------------------------------------