%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN560-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 : n021.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:01 PM UTC 2026
% Result : Unsatisfiable 4.16s 1.39s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN560-1 : TPTP v9.2.1. Released v2.5.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.34 % Computer : n021.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:46:43 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 SPASS-SCL-FOL version:
% 0.19/0.42 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 4.16/1.39 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.16/1.39 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.16/1.39 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.16/1.39 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.16/1.39 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.16/1.39 Execution resolution_1 ended with status: unsatisfiable
% 4.16/1.39 Used heuristic: resolution_1
% 4.16/1.39
% 4.16/1.39 Input Clauses:
% 4.16/1.39
% 4.16/1.39 Predicates: p2 p8
% 4.16/1.39 Fol Constants: c9 c10 c11 c12 c13 c14
% 4.16/1.39 Fol Functions: f3 f5 f4 f7 f6
% 4.16/1.39 Problem Properties:
% 4.16/1.39 This is a full first-order problem without equality.
% 4.16/1.39
% 4.16/1.39 After reduction: Problem Properties:
% 4.16/1.39 This is a full first-order problem without equality.
% 4.16/1.39
% 4.16/1.39
% 4.16/1.39 Reduced Input Clauses:
% 4.16/1.39
% 4.16/1.39 Most General Atoms: p2(x2,x3) p8(x3,x1)
% 4.16/1.39
% 4.16/1.39 === Starting SPASS-SCL-FOL A Little Less Naive, considering 51 atoms initially, heuristics mode: resolution_1 ===
% 4.16/1.39
% 4.16/1.39 === Backtracking. Learning clause 16:2:2:[8.2,1.1]:TopTop: p2(x0,x1) -> p2(x1,x0)
% 4.16/1.39 === Backtracking. Learning clause 17:2:1:[8.2,3.1]:Top: p2(c11,x0) -> p2(x0,f4(f5(c12,c13)))
% 4.16/1.39 === Backtracking. Learning clause 18:3:3:[12.3,4.1]:TopTopTop: p2(x0,x1),p8(f4(x2),x0) -> p8(f5(x2,f3(f7(c10))),x1)
% 4.16/1.39 === Backtracking. Learning clause 19:3:3:[12.1,4.1]:TopTopTop: p8(x0,f4(x1)),p2(x0,x2) -> p8(x2,f5(x1,f3(f7(c10))))
% 4.16/1.39 === Backtracking. Learning clause 20:3:3:[9.2,15.2]:TopTopTop: p8(x0,f6(x1,x2)) -> p8(x0,f6(x1,f5(x2,f3(f7(c10))))),p2(x1,f3(c10))
% 4.16/1.39 === Backtracking. Learning clause 21:2:1:[9.2,10.1]:Top: p8(x0,f6(c9,f4(c12))) -> p8(x0,f6(c9,f4(f5(c12,c14))))
% 4.16/1.39 === Backtracking. Learning clause 22:4:3:[9.3,11.1,12.4]:TopTopTop: p8(f6(c9,f4(c12)),x0),p2(x1,f6(c9,f4(f4(f5(c12,c14))))),p8(x2,x1),p2(x2,x0) ->
% 4.16/1.39 === Backtracking. Learning clause 23:2:1:[9.3,11.1]:Top: p8(f6(c9,f4(c12)),x0),p8(x0,f6(c9,f4(f4(f5(c12,c14))))) ->
% 4.16/1.39 === Clause set with instances from active satisfied. Growing active. New size: 69
% 4.16/1.39 === Restarting.
% 4.16/1.39 === Backtracking. Learning clause 24:4:4:[9.2,18.3]:TopTopTopTop: p8(x0,f5(x1,f3(f7(c10)))),p2(x2,x3),p8(f4(x1),x2) -> p8(x0,x3)
% 4.16/1.39 === Backtracking. Learning clause 25:4:3:[12.2,21.2,16.2]:TopTopTop: p2(x0,x1),p8(x0,f6(c9,f4(c12))),p2(x2,f6(c9,f4(f5(c12,c14)))) -> p8(x1,x2)
% 4.16/1.39 === Backtracking. Learning clause 26:5:5:[12.2,20.2,16.2]:TopTopTopTopTop: p2(x0,x1),p8(x0,f6(x2,x3)),p2(x4,f6(x2,f5(x3,f3(f7(c10))))) -> p8(x1,x4),p2(x2,f3(c10))
% 4.16/1.39 === Clause set with instances from active satisfied. Growing active. New size: 78
% 4.16/1.39 === Restarting.
% 4.16/1.39 === Backtracking. Learning clause 27:2:2:[8.1,4.1,16.1]:TopTop: p2(f4(x0),x1) -> p2(x1,f5(x0,f3(f7(c10))))
% 4.16/1.39 === Conflict found: 22:4:3:[9.3,11.1,12.4]:TopTopTop: p8(f6(c9,f4(c12)),x0),p2(x1,f6(c9,f4(f4(f5(c12,c14))))),p8(x2,x1),p2(x2,x0) -> {x0 -> f6(c9,f4(f5(c12,c14))), x1 -> c9, x2 -> c9}
% 4.16/1.39 === Backtracking. Learning clause 28:3:2:[22.1,10.1]:TopTop: p2(x0,f6(c9,f4(f4(f5(c12,c14))))),p8(x1,x0),p2(x1,f6(c9,f4(f5(c12,c14)))) ->
% 4.16/1.39 === Conflict found: 28:3:2:[22.1,10.1]:TopTop: p2(x0,f6(c9,f4(f4(f5(c12,c14))))),p8(x1,x0),p2(x1,f6(c9,f4(f5(c12,c14)))) -> {x0 -> f6(c9,c9), x1 -> c9}
% 4.16/1.39 === Backtracking. Learning clause 29:4:3:[28.1,14.3]:TopTopTop: p8(x0,f6(x1,x2)),p2(x0,f6(c9,f4(f5(c12,c14)))),p2(x2,f4(f4(f5(c12,c14)))),p2(x1,c9) ->
% 4.16/1.39 === Conflict found: 22:4:3:[9.3,11.1,12.4]:TopTopTop: p8(f6(c9,f4(c12)),x0),p2(x1,f6(c9,f4(f4(f5(c12,c14))))),p8(x2,x1),p2(x2,x0) -> {x0 -> f6(c9,f5(f4(c12),f3(f7(c10)))), x1 -> c9, x2 -> c9}
% 4.16/1.39 === Backtracking. Learning clause 31:3:2:[2.0,30.3,22.1,15.2]:TopTop: p2(x0,f6(c9,f4(f4(f5(c12,c14))))),p8(x1,x0),p2(x1,f6(c9,f5(f4(c12),f3(f7(c10))))) ->
% 4.16/1.39 === Clause set with instances from active satisfied. Growing active. New size: 90
% 4.16/1.39 === Restarting.
% 4.16/1.39 === Conflict found: 25:4:3:[12.2,21.2,16.2]:TopTopTop: p2(x0,x1),p8(x0,f6(c9,f4(c12))),p2(x2,f6(c9,f4(f5(c12,c14)))) -> p8(x1,x2) {x0 -> f4(c9), x1 -> f5(c9,f3(f7(c10))), x2 -> f6(c9,c9)}
% 4.16/1.39 === Backtracking. Learning clause 32:8:7:[25.3,14.3,9.2,19.3,4.1,12.4]:TopTopTopTopTopTopTop: p2(x0,f4(f5(c12,c14))),p2(x1,c9),p8(x2,f4(x3)),p2(x2,x4),p2(x5,f6(c9,f4(c12))),p8(x6,x5),p2(x6,f4(x3)) -> p8(x4,f6(x1,x0))
% 4.16/1.39 === Conflict found: 29:4:3:[28.1,14.3]:TopTopTop: p8(x0,f6(x1,x2)),p2(x0,f6(c9,f4(f5(c12,c14)))),p2(x2,f4(f4(f5(c12,c14)))),p2(x1,c9) -> {x0 -> f6(c9,c9), x1 -> c9, x2 -> f5(c9,f3(f7(c10)))}
% 4.16/1.39 === Backtracking. Learning clause 33:3:2:[29.1,15.2,8.3,14.3,7.2,4.1]:TopTop: p2(x0,c9),p2(x1,f4(f5(c12,c14))) -> p2(x0,f3(c10))
% 4.16/1.39 === Backtracking. Learning clause 34:3:3:[9.1,15.2]:TopTopTop: p8(f6(x0,f5(x1,f3(f7(c10)))),x2) -> p8(f6(x0,x1),x2),p2(x0,f3(c10))
% 4.16/1.39 === Backtracking. Learning clause 35:2:1:[9.1,10.1]:Top: p8(f6(c9,f4(f5(c12,c14))),x0) -> p8(f6(c9,f4(c12)),x0)
% 4.16/1.39 === Backtracking. Learning clause 36:6:6:[14.3,26.3]:TopTopTopTopTopTop: p2(x0,f5(x1,f3(f7(c10)))),p2(x2,x3),p2(x4,x5),p8(x4,f6(x3,x1)) -> p8(x5,f6(x2,x0)),p2(x3,f3(c10))
% 4.16/1.39 === Backtracking. Learning clause 37:2:1:[12.1,1.1,10.1]:Top: p2(f6(c9,f4(c12)),x0) -> p8(x0,f6(c9,f4(f5(c12,c14))))
% 4.16/1.39 === Clause set with instances from active satisfied. Growing active. New size: 122
% 4.16/1.39 === Restarting.
% 4.16/1.39 === Backtracking. Learning clause 38:3:2:[7.2,33.2]:TopTop: p2(x0,f5(c12,c14)),p2(x1,c9) -> p2(x1,f3(c10))
% 4.16/1.39 === Backtracking. Learning clause 39:6:7:[12.1,14.3,9.1]:TopTopTopTopTopTopTop: p8(x0,f6(x1,x2)),p2(x0,x3),p2(x2,x4),p2(x1,x5),p8(f6(x5,x4),x6) -> p8(x3,x6)
% 4.16/1.39 === Backtracking. Learning clause 40:7:8:[12.1,14.3,12.2]:TopTopTopTopTopTopTopTop: p8(x0,f6(x1,x2)),p2(x0,x3),p2(x2,x4),p2(x1,x5),p2(f6(x5,x4),x6),p2(x3,x7) -> p8(x7,x6)
% 4.16/1.39 === Conflict found: 33:3:2:[29.1,15.2,8.3,14.3,7.2,4.1]:TopTop: p2(x0,c9),p2(x1,f4(f5(c12,c14))) -> p2(x0,f3(c10)) {x0 -> c9, x1 -> f4(f5(c12,c14))}
% 4.16/1.39
% 4.16/1.39 SZS status Unsatisfiable
% 4.16/1.39
% 4.16/1.39 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.16/1.39
% 4.16/1.39 SPASS-SCL-FOL Statistics:
% 4.16/1.39 Number of learned clauses: 24
% 4.16/1.39 Number of propagations: 665
% 4.16/1.39 Number of decisions: 428
% 4.16/1.39 Number of resolutions: 42
% 4.16/1.39 Number of condensations: 0
% 4.16/1.39 Number of sub resolutions: 1
% 4.16/1.39 Number of input literals (deduplicated): 15
% 4.16/1.39 Number of grows: 4
% 4.16/1.39 Number of considered ground atoms: 122
% 4.16/1.39
% 4.16/1.39 Needed: 0:00:00.84
% 4.16/1.39
%------------------------------------------------------------------------------