%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN555-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 : n022.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 16.67s 3.86s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN555-1 : TPTP v9.2.1. Released v2.5.0.
% 0.11/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.34 % Computer : n022.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:45:52 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 SPASS-SCL-FOL version:
% 0.19/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 16.67/3.86 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.67/3.86 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.67/3.86 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.67/3.86 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.67/3.86 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.67/3.86 Execution resolution_3 ended with status: unsatisfiable
% 16.67/3.86 Used heuristic: resolution_3
% 16.67/3.86
% 16.67/3.86 Input Clauses:
% 16.67/3.86
% 16.67/3.86 Predicates: p2 p4 p3
% 16.67/3.86 Fol Constants: c7 c10 c9 c8
% 16.67/3.86 Fol Functions: f5 f6
% 16.67/3.86 Problem Properties:
% 16.67/3.86 This is a full first-order problem without equality.
% 16.67/3.86
% 16.67/3.86 After reduction: Problem Properties:
% 16.67/3.86 This is a full first-order problem without equality.
% 16.67/3.86
% 16.67/3.86
% 16.67/3.86 Reduced Input Clauses:
% 16.67/3.86
% 16.67/3.86 Most General Atoms: p4(x2,x3) p3(x4,x5) p2(x4,x5)
% 16.67/3.86
% 16.67/3.86 === Starting SPASS-SCL-FOL A Little Less Naive, considering 25 atoms initially, heuristics mode: resolution_3 ===
% 16.67/3.86
% 16.67/3.86 === Backtracking. Learning clause 13:2:1:[8.2,4.1]:Top: p4(f5(c7,c10,c9),x0) -> p4(x0,c9)
% 16.67/3.86 === Backtracking. Learning clause 14:2:1:[8.3,5.1]:Top: p4(x0,f5(c7,c10,c8)),p4(x0,c8) ->
% 16.67/3.86 === Backtracking. Learning clause 15:2:2:[8.2,2.1]:TopTop: p4(x0,x1) -> p4(x1,x0)
% 16.67/3.86 === Backtracking. Learning clause 16:2:2:[8.2,6.1]:TopTop: p4(f5(c7,x0,c8),x1) -> p4(x1,f5(c7,x0,c9))
% 16.67/3.86 === Backtracking. Learning clause 17:2:2:[9.2,3.1]:TopTop: p3(x0,x1) -> p3(x1,x0)
% 16.67/3.86 === Backtracking. Learning clause 18:2:1:[12.2,6.1]:Top: p4(f5(c7,x0,c8),c8) -> p4(f5(c7,x0,c9),c9)
% 16.67/3.86 === Clause set with instances from active satisfied. Growing active. New size: 47
% 16.67/3.86 === Restarting.
% 16.67/3.86 === Backtracking. Learning clause 19:4:4:[8.3,16.1,8.3]:TopTopTopTop: p4(x0,x1),p4(x2,x0),p4(x2,f5(c7,x3,c8)) -> p4(x1,f5(c7,x3,c9))
% 16.67/3.86 === Conflict found: 15:2:2:[8.2,2.1]:TopTop: p4(x0,x1) -> p4(x1,x0) {x0 -> c7, x1 -> f5(c7,c10,c9)}
% 16.67/3.86 === Backtracking. Learning clause 20:2:1:[15.2,13.1]:Top: p4(x0,f5(c7,c10,c9)) -> p4(x0,c9)
% 16.67/3.86 === Conflict found: 15:2:2:[8.2,2.1]:TopTop: p4(x0,x1) -> p4(x1,x0) {x0 -> f5(c7,c10,c9), x1 -> c9}
% 16.67/3.86 === Backtracking. Learning clause 21:1:0:[15.1,4.1]:: -> p4(c9,f5(c7,c10,c9))
% 16.67/3.86 === Backtracking. Learning clause 22:4:3:[8.1,11.4,5.1]:TopTopTop: p4(f5(x0,x1,x2),c8),p3(x1,c10),p4(x2,c8),p2(x0,c7) ->
% 16.67/3.86 === Conflict found: 16:2:2:[8.2,6.1]:TopTop: p4(f5(c7,x0,c8),x1) -> p4(x1,f5(c7,x0,c9)) {x0 -> c7, x1 -> f5(c7,c7,c7)}
% 16.67/3.86 === Backtracking. Learning clause 23:4:4:[16.1,11.4]:TopTopTopTop: p3(x0,x1),p4(c8,x2),p2(c7,x3) -> p4(f5(x3,x1,x2),f5(c7,x0,c9))
% 16.67/3.86 === Conflict found: 15:2:2:[8.2,2.1]:TopTop: p4(x0,x1) -> p4(x1,x0) {x0 -> f5(c7,c7,c8), x1 -> f5(c7,c7,c9)}
% 16.67/3.86 === Backtracking. Learning clause 24:1:1:[15.1,6.1]:Top: -> p4(f5(c7,x0,c9),f5(c7,x0,c8))
% 16.67/3.86 === Backtracking. Learning clause 25:10:7:[8.3,13.1,19.4,11.4,24.1,11.4,23.4]:TopTopTopTopTopTopTop: p3(x0,x1),p4(c8,x2),p2(c7,x3),p3(x4,c10),p4(x5,c8),p2(x6,c7),p3(x0,x4),p4(c8,x5),p2(c7,x6) -> p4(f5(x3,x1,x2),c9)
% 16.67/3.86 === Backtracking. Learning clause 26:5:5:[8.1,23.4]:TopTopTopTopTop: p4(f5(x0,x1,x2),x3),p3(x4,x1),p4(c8,x2),p2(c7,x0) -> p4(f5(c7,x4,c9),x3)
% 16.67/3.86 === Clause set with instances from active satisfied. Growing active. New size: 76
% 16.67/3.86 === Restarting.
% 16.67/3.86 === Backtracking. Learning clause 27:3:3:[8.2,15.2,15.2]:TopTopTop: p4(x0,x1),p4(x2,x1) -> p4(x2,x0)
% 16.67/3.86 === Conflict found: 27:3:3:[8.2,15.2,15.2]:TopTopTop: p4(x0,x1),p4(x2,x1) -> p4(x2,x0) {x0 -> f5(c7,c7,c7), x1 -> c9, x2 -> c9}
% 16.67/3.86 === Backtracking. Learning clause 28:11:8:[27.1,25.10]:TopTopTopTopTopTopTopTop: p4(x0,c9),p3(x1,x2),p4(c8,x3),p2(c7,x4),p3(x5,c10),p4(x6,c8),p2(x7,c7),p3(x1,x5),p4(c8,x6),p2(c7,x7) -> p4(x0,f5(x4,x2,x3))
% 16.67/3.86 === Conflict found: 26:5:5:[8.1,23.4]:TopTopTopTopTop: p4(f5(x0,x1,x2),x3),p3(x4,x1),p4(c8,x2),p2(c7,x0) -> p4(f5(c7,x4,c9),x3) {x0 -> c7, x1 -> c7, x2 -> c7, x3 -> c9, x4 -> c7}
% 16.67/3.86 === Backtracking. Learning clause 29:10:7:[26.5,27.1,25.10]:TopTopTopTopTopTopTop: p3(x0,x1),p4(x2,c9),p3(x3,x1),p3(x4,c10),p4(x5,c8),p2(x6,c7),p3(x3,x4),p4(c8,x5),p2(c7,x6) -> p4(x2,f5(c7,x0,c9))
% 16.67/3.86 === Conflict found: 26:5:5:[8.1,23.4]:TopTopTopTopTop: p4(f5(x0,x1,x2),x3),p3(x4,x1),p4(c8,x2),p2(c7,x0) -> p4(f5(c7,x4,c9),x3) {x0 -> c7, x1 -> f6(c7,c7,c7), x2 -> c7, x3 -> c7, x4 -> f6(c7,c7,c7)}
% 16.67/3.86 === Backtracking. Learning clause 30:4:4:[26.2,3.1]:TopTopTopTop: p4(f5(x0,x1,x2),x3),p4(c8,x2),p2(c7,x0) -> p4(f5(c7,x1,c9),x3)
% 16.67/3.86 === Conflict found: 25:10:7:[8.3,13.1,19.4,11.4,24.1,11.4,23.4]:TopTopTopTopTopTopTop: p3(x0,x1),p4(c8,x2),p2(c7,x3),p3(x4,c10),p4(x5,c8),p2(x6,c7),p3(x0,x4),p4(c8,x5),p2(c7,x6) -> p4(f5(x3,x1,x2),c9) {x0 -> f6(c7,c7,c7), x1 -> f6(c7,c7,c7), x2 -> c7, x3 -> c7, x4 -> f6(c7,c7,c7), x5 -> c7, x6 -> c7}
% 16.67/3.86 === Backtracking. Learning clause 31:9:6:[25.1,3.1,8.2,15.2]:TopTopTopTopTopTop: p4(c8,x0),p2(c7,x1),p3(x2,c10),p4(x3,c8),p2(x4,c7),p4(c8,x3),p2(c7,x4),p4(x5,f5(x1,x2,x0)) -> p4(x5,c9)
% 16.67/3.86 === Conflict found: 25:10:7:[8.3,13.1,19.4,11.4,24.1,11.4,23.4]:TopTopTopTopTopTopTop: p3(x0,x1),p4(c8,x2),p2(c7,x3),p3(x4,c10),p4(x5,c8),p2(x6,c7),p3(x0,x4),p4(c8,x5),p2(c7,x6) -> p4(f5(x3,x1,x2),c9) {x0 -> f6(c7,c7,c7), x1 -> f6(c7,c7,c7), x2 -> c7, x3 -> c7, x4 -> f6(c7,c7,c7), x5 -> c7, x6 -> c7}
% 16.67/3.86 === Backtracking. Learning clause 32:8:5:[25.1,3.1]:TopTopTopTopTop: p4(c8,x0),p2(c7,x1),p3(x2,c10),p4(x3,c8),p2(x4,c7),p4(c8,x3),p2(c7,x4) -> p4(f5(x1,x2,x0),c9)
% 16.67/3.86 === Conflict found: 26:5:5:[8.1,23.4]:TopTopTopTopTop: p4(f5(x0,x1,x2),x3),p3(x4,x1),p4(c8,x2),p2(c7,x0) -> p4(f5(c7,x4,c9),x3) {x0 -> c7, x1 -> c7, x2 -> c7, x3 -> f5(c7,f6(c7,c9,c7),c7), x4 -> f6(c7,c9,c7)}
% 16.67/3.86 === Backtracking. Learning clause 33:6:5:[26.5,12.2]:TopTopTopTopTop: p4(f5(x0,x1,x2),f5(c7,f6(x3,c9,x4),x4)),p3(f6(x3,c9,x4),x1),p4(c8,x2),p2(c7,x0),p4(f5(c7,x3,c9),c9) -> p4(f5(c7,x3,x4),x4)
% 16.67/3.86 === Backtracking. Learning clause 34:8:5:[12.2,24.1,22.1,8.3,29.10]:TopTopTopTopTop: p3(x0,c10),p4(c8,c8),p2(c7,c7),p3(x0,x1),p4(x2,c9),p3(x3,x1),p3(x4,c10),p3(x3,x4) ->
% 16.67/3.86 === Conflict found: 13:2:1:[8.2,4.1]:Top: p4(f5(c7,c10,c9),x0) -> p4(x0,c9) {x0 -> f5(c7,c10,c8)}
% 16.67/3.86 === Backtracking. Learning clause 35:1:0:[13.1,24.1]:: -> p4(f5(c7,c10,c8),c9)
% 16.67/3.86 === Conflict found: 34:8:5:[12.2,24.1,22.1,8.3,29.10]:TopTopTopTopTop: p3(x0,c10),p4(c8,c8),p2(c7,c7),p3(x0,x1),p4(x2,c9),p3(x3,x1),p3(x4,c10),p3(x3,x4) -> {x0 -> f6(c7,c7,c7), x1 -> f6(c7,c7,c7), x2 -> f5(c7,f6(c7,c7,c7),c7), x3 -> f6(c7,c7,c7), x4 -> f6(c7,c7,c7)}
% 16.67/3.86 === Backtracking. Learning clause 36:3:1:[34.4,3.1,32.8]:Top: p4(c8,c8),p2(c7,c7),p3(x0,c10) ->
% 16.67/3.86 === Clause set with instances from active satisfied. Growing active. New size: 96
% 16.67/3.86 === Restarting.
% 16.67/3.86 === Conflict found: 36:3:1:[34.4,3.1,32.8]:Top: p4(c8,c8),p2(c7,c7),p3(x0,c10) -> {x0 -> c10}
% 16.67/3.86
% 16.67/3.86 SZS status Unsatisfiable
% 16.67/3.86
% 16.67/3.86 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.67/3.86
% 16.67/3.86 SPASS-SCL-FOL Statistics:
% 16.67/3.86 Number of learned clauses: 24
% 16.67/3.86 Number of propagations: 660
% 16.67/3.86 Number of decisions: 204
% 16.67/3.86 Number of resolutions: 42
% 16.67/3.86 Number of condensations: 3
% 16.67/3.86 Number of sub resolutions: 0
% 16.67/3.86 Number of input literals (deduplicated): 13
% 16.67/3.86 Number of grows: 3
% 16.67/3.86 Number of considered ground atoms: 96
% 16.67/3.86
% 16.67/3.86 Needed: 0:00:03.29
% 16.67/3.86
%------------------------------------------------------------------------------