%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN599-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:04 PM UTC 2026
% Result : Unsatisfiable 2.27s 0.91s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN599-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:45:52 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.33 SPASS-SCL-FOL version:
% 0.19/0.42 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 2.27/0.91 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.27/0.91 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.27/0.91 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.27/0.91 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.27/0.91 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.27/0.91 Execution resolution_3 ended with status: unsatisfiable
% 2.27/0.91 Used heuristic: resolution_3
% 2.27/0.91
% 2.27/0.91 Input Clauses:
% 2.27/0.91
% 2.27/0.91 Predicates: p17 p18 p7 p2 p3 p5 p19 p20
% 2.27/0.91 Fol Constants: c21 c22 c23
% 2.27/0.91 Fol Functions: f6 f4 f16 f10 f11 f13 f14 f12 f15 f9 f8
% 2.27/0.91 Problem Properties:
% 2.27/0.91 This is a full first-order problem without equality.
% 2.27/0.91
% 2.27/0.91 After reduction: Problem Properties:
% 2.27/0.91 This is a full first-order problem without equality.
% 2.27/0.91
% 2.27/0.91
% 2.27/0.91 Reduced Input Clauses:
% 2.27/0.91
% 2.27/0.91 Most General Atoms: p17(x1) p18(x1) p2(x1,x2) p5(x1,x2) p3(x1,x2) p7(x2,x3) p19(x1,x3) p20(x1,x3)
% 2.27/0.91
% 2.27/0.91 === Starting SPASS-SCL-FOL A Little Less Naive, considering 56 atoms initially, heuristics mode: resolution_3 ===
% 2.27/0.91
% 2.27/0.91 === Backtracking. Learning clause 30:2:2:[20.2,3.1]:TopTop: p7(x0,x1) -> p7(x1,x0)
% 2.27/0.91 === Backtracking. Learning clause 31:2:2:[19.2,4.1]:TopTop: p2(x0,x1) -> p2(x1,x0)
% 2.27/0.91 === Backtracking. Learning clause 32:2:2:[22.2,5.1]:TopTop: p3(x0,x1) -> p3(x1,x0)
% 2.27/0.91 === Backtracking. Learning clause 33:2:1:[22.2,7.1]:Top: p3(f4(f6(c21)),x0) -> p3(x0,c22)
% 2.27/0.91 === Clause set with instances from active satisfied. Growing active. New size: 79
% 2.27/0.91 === Restarting.
% 2.27/0.91 === Conflict found: 32:2:2:[22.2,5.1]:TopTop: p3(x0,x1) -> p3(x1,x0) {x0 -> c21, x1 -> f4(f6(c21))}
% 2.27/0.91 === Backtracking. Learning clause 34:2:1:[32.2,33.1]:Top: p3(x0,f4(f6(c21))) -> p3(x0,c22)
% 2.27/0.91 === Conflict found: 32:2:2:[22.2,5.1]:TopTop: p3(x0,x1) -> p3(x1,x0) {x0 -> f4(f6(c21)), x1 -> c22}
% 2.27/0.91 === Backtracking. Learning clause 35:1:0:[32.1,7.1]:: -> p3(c22,f4(f6(c21)))
% 2.27/0.91 === Backtracking. Learning clause 36:3:2:[23.4,27.1]:TopTop: p7(x0,f15(f16(c21))),p7(x1,f8(f9(f12(f10(f13(f11(c23)))),f14(c22)),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))),p19(x0,x1) ->
% 2.27/0.91 === Backtracking. Learning clause 37:4:3:[24.3,28.2]:TopTopTop: p7(f8(f9(f12(f10(f13(f11(c23)))),f4(f6(x0))),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23)))))))))),x1),p7(f15(f16(x0)),x2),p18(x0) -> p20(x1,x2)
% 2.27/0.91 === Clause set with instances from active satisfied. Growing active. New size: 91
% 2.27/0.91 === Restarting.
% 2.27/0.91 === Conflict found: 30:2:2:[20.2,3.1]:TopTop: p7(x0,x1) -> p7(x1,x0) {x0 -> c21, x1 -> f8(f9(f12(f10(f13(f11(c23)))),f4(f6(c21))),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))}
% 2.27/0.91 === Backtracking. Learning clause 38:4:3:[30.2,37.1]:TopTopTop: p7(x0,f8(f9(f12(f10(f13(f11(c23)))),f4(f6(x1))),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))),p7(f15(f16(x1)),x2),p18(x1) -> p20(x0,x2)
% 2.27/0.91 === Backtracking. Learning clause 39:4:3:[26.3,36.2]:TopTopTop: p7(x0,f9(f12(f10(f13(f11(c23)))),f14(c22))),p7(x1,f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23)))))))))),p7(x2,f15(f16(c21))),p19(x2,f8(x0,x1)) ->
% 2.27/0.91 === Backtracking. Learning clause 40:2:1:[23.2,3.1,27.1]:Top: p7(x0,f15(f16(c21))),p19(x0,f8(f9(f12(f10(f13(f11(c23)))),f14(c22)),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))) ->
% 2.27/0.91 === Backtracking. Learning clause 41:3:2:[24.1,3.1,28.2]:TopTop: p7(f15(f16(x0)),x1),p18(x0) -> p20(f8(f9(f12(f10(f13(f11(c23)))),f4(f6(x0))),f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23)))))))))),x1)
% 2.27/0.91 === Clause set with instances from active satisfied. Growing active. New size: 101
% 2.27/0.91 === Restarting.
% 2.27/0.91 === Backtracking. Learning clause 42:5:4:[25.3,39.2]:TopTopTopTop: p3(x0,f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))),p7(x1,f12(f10(f13(f11(c23))))),p7(x2,f9(f12(f10(f13(f11(c23)))),f14(c22))),p7(x3,f15(f16(c21))),p19(x3,f8(x2,f9(x1,x0))) ->
% 2.27/0.91 === Conflict found: 39:4:3:[26.3,36.2]:TopTopTop: p7(x0,f9(f12(f10(f13(f11(c23)))),f14(c22))),p7(x1,f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23)))))))))),p7(x2,f15(f16(c21))),p19(x2,f8(x0,x1)) -> {x0 -> c21, x1 -> f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))), x2 -> c21}
% 2.27/0.91 === Backtracking. Learning clause 43:3:2:[39.2,3.1]:TopTop: p7(x0,f9(f12(f10(f13(f11(c23)))),f14(c22))),p7(x1,f15(f16(c21))),p19(x1,f8(x0,f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))) ->
% 2.27/0.91 === Clause set with instances from active satisfied. Growing active. New size: 114
% 2.27/0.91 === Restarting.
% 2.27/0.91 === Backtracking. Learning clause 44:5:4:[12.2,42.1]:TopTopTopTop: p3(x0,f11(f11(f11(f11(f11(f11(f11(c23)))))))),p7(x1,f12(f10(f13(f11(c23))))),p7(x2,f9(f12(f10(f13(f11(c23)))),f14(c22))),p7(x3,f15(f16(c21))),p19(x3,f8(x2,f9(x1,f10(x0)))) ->
% 2.27/0.91 === Conflict found: 42:5:4:[25.3,39.2]:TopTopTopTop: p3(x0,f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))),p7(x1,f12(f10(f13(f11(c23))))),p7(x2,f9(f12(f10(f13(f11(c23)))),f14(c22))),p7(x3,f15(f16(c21))),p19(x3,f8(x2,f9(x1,x0))) -> {x0 -> f10(f11(f11(f11(f11(f11(f11(f11(c23)))))))), x1 -> c21, x2 -> c21, x3 -> c21}
% 2.27/0.91 === Backtracking. Learning clause 45:4:3:[42.1,5.1]:TopTopTop: p7(x0,f12(f10(f13(f11(c23))))),p7(x1,f9(f12(f10(f13(f11(c23)))),f14(c22))),p7(x2,f15(f16(c21))),p19(x2,f8(x1,f9(x0,f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))) ->
% 2.27/0.91 === Backtracking. Learning clause 46:5:4:[23.4,43.3]:TopTopTopTop: p7(x0,x1),p7(x2,f8(x3,f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))),p19(x0,x2),p7(x3,f9(f12(f10(f13(f11(c23)))),f14(c22))),p7(x1,f15(f16(c21))) ->
% 2.27/0.91 === Conflict found: 45:4:3:[42.1,5.1]:TopTopTop: p7(x0,f12(f10(f13(f11(c23))))),p7(x1,f9(f12(f10(f13(f11(c23)))),f14(c22))),p7(x2,f15(f16(c21))),p19(x2,f8(x1,f9(x0,f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))))) -> {x0 -> f12(f10(f13(f11(c23)))), x1 -> f9(f12(f10(f13(f11(c23)))),f14(f4(f6(c21)))), x2 -> f15(f16(c21))}
% 2.27/0.91 === Backtracking. Learning clause 47:4:1:[45.4,29.2]:Top: p7(f12(f10(f13(f11(c23)))),f12(f10(f13(f11(c23))))),p7(f9(f12(f10(f13(f11(c23)))),f14(f4(f6(x0)))),f9(f12(f10(f13(f11(c23)))),f14(c22))),p7(f15(f16(x0)),f15(f16(c21))),p18(x0) ->
% 2.27/0.91 === Clause set with instances from active satisfied. Growing active. New size: 126
% 2.27/0.91 === Restarting.
% 2.27/0.91 === Conflict found: 44:5:4:[12.2,42.1]:TopTopTopTop: p3(x0,f11(f11(f11(f11(f11(f11(f11(c23)))))))),p7(x1,f12(f10(f13(f11(c23))))),p7(x2,f9(f12(f10(f13(f11(c23)))),f14(c22))),p7(x3,f15(f16(c21))),p19(x3,f8(x2,f9(x1,f10(x0)))) -> {x0 -> f11(c21), x1 -> c21, x2 -> c21, x3 -> c21}
% 2.27/0.91 === Backtracking. Learning clause 48:5:4:[44.1,13.2]:TopTopTopTop: p7(x0,f12(f10(f13(f11(c23))))),p7(x1,f9(f12(f10(f13(f11(c23)))),f14(c22))),p7(x2,f15(f16(c21))),p19(x2,f8(x1,f9(x0,f10(f11(x3))))),p3(x3,f11(f11(f11(f11(f11(f11(c23))))))) ->
% 2.27/0.91 === Conflict found: 44:5:4:[12.2,42.1]:TopTopTopTop: p3(x0,f11(f11(f11(f11(f11(f11(f11(c23)))))))),p7(x1,f12(f10(f13(f11(c23))))),p7(x2,f9(f12(f10(f13(f11(c23)))),f14(c22))),p7(x3,f15(f16(c21))),p19(x3,f8(x2,f9(x1,f10(x0)))) -> {x0 -> c21, x1 -> c21, x2 -> f9(c21,c21), x3 -> c21}
% 2.27/0.91 === Backtracking. Learning clause 49:6:5:[44.3,25.3]:TopTopTopTopTop: p3(x0,f11(f11(f11(f11(f11(f11(f11(c23)))))))),p7(x1,f12(f10(f13(f11(c23))))),p7(x2,f15(f16(c21))),p19(x2,f8(f9(x3,x4),f9(x1,f10(x0)))),p3(x4,f14(c22)),p7(x3,f12(f10(f13(f11(c23))))) ->
% 2.27/0.91 === Conflict found: 42:5:4:[25.3,39.2]:TopTopTopTop: p3(x0,f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))),p7(x1,f12(f10(f13(f11(c23))))),p7(x2,f9(f12(f10(f13(f11(c23)))),f14(c22))),p7(x3,f15(f16(c21))),p19(x3,f8(x2,f9(x1,x0))) -> {x0 -> c21, x1 -> c21, x2 -> f9(c21,c21), x3 -> c21}
% 2.27/0.91 === Backtracking. Learning clause 50:6:5:[42.3,25.3]:TopTopTopTopTop: p3(x0,f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))),p7(x1,f12(f10(f13(f11(c23))))),p7(x2,f15(f16(c21))),p19(x2,f8(f9(x3,x4),f9(x1,x0))),p3(x4,f14(c22)),p7(x3,f12(f10(f13(f11(c23))))) ->
% 2.27/0.91 === Conflict found: 42:5:4:[25.3,39.2]:TopTopTopTop: p3(x0,f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))),p7(x1,f12(f10(f13(f11(c23))))),p7(x2,f9(f12(f10(f13(f11(c23)))),f14(c22))),p7(x3,f15(f16(c21))),p19(x3,f8(x2,f9(x1,x0))) -> {x0 -> f10(c21), x1 -> c21, x2 -> f9(f12(f10(f13(f11(c23)))),f14(c22)), x3 -> c21}
% 2.27/0.91 === Backtracking. Learning clause 51:4:3:[42.3,3.1]:TopTopTop: p3(x0,f10(f11(f11(f11(f11(f11(f11(f11(c23))))))))),p7(x1,f12(f10(f13(f11(c23))))),p7(x2,f15(f16(c21))),p19(x2,f8(f9(f12(f10(f13(f11(c23)))),f14(c22)),f9(x1,x0))) ->
% 2.27/0.91 === Conflict found: 39:4:3:[26.3,36.2]:TopTopTop: p7(x0,f9(f12(f10(f13(f11(c23)))),f14(c22))),p7(x1,f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23)))))))))),p7(x2,f15(f16(c21))),p19(x2,f8(x0,x1)) -> {x0 -> f9(f12(f10(f13(f11(c23)))),f14(c22)), x1 -> c21, x2 -> c21}
% 2.27/0.91 === Backtracking. Learning clause 52:3:2:[39.1,3.1]:TopTop: p7(x0,f9(f12(f10(f13(f11(c23)))),f10(f11(f11(f11(f11(f11(f11(f11(c23)))))))))),p7(x1,f15(f16(c21))),p19(x1,f8(f9(f12(f10(f13(f11(c23)))),f14(c22)),x0)) ->
% 2.27/0.91 === Conflict found: 47:4:1:[45.4,29.2]:Top: p7(f12(f10(f13(f11(c23)))),f12(f10(f13(f11(c23))))),p7(f9(f12(f10(f13(f11(c23)))),f14(f4(f6(x0)))),f9(f12(f10(f13(f11(c23)))),f14(c22))),p7(f15(f16(x0)),f15(f16(c21))),p18(x0) -> {x0 -> c21}
% 2.27/0.91
% 2.27/0.91 SZS status Unsatisfiable
% 2.27/0.91
% 2.27/0.91 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.27/0.91
% 2.27/0.91 SPASS-SCL-FOL Statistics:
% 2.27/0.91 Number of learned clauses: 23
% 2.27/0.91 Number of propagations: 625
% 2.27/0.91 Number of decisions: 533
% 2.27/0.91 Number of resolutions: 31
% 2.27/0.91 Number of condensations: 0
% 2.27/0.91 Number of sub resolutions: 0
% 2.27/0.91 Number of input literals (deduplicated): 29
% 2.27/0.91 Number of grows: 5
% 2.27/0.91 Number of considered ground atoms: 126
% 2.27/0.91
% 2.27/0.91 Needed: 0:00:00.39
% 2.27/0.91
%------------------------------------------------------------------------------