%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN561-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:01 PM UTC 2026
% Result : Unsatisfiable 27.74s 6.12s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN561-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.15/0.34 % Computer : n023.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Thu May 7 13:46:39 EDT 2026
% 0.15/0.35 % CPUTime :
% 0.15/0.35 SPASS-SCL-FOL version:
% 0.19/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 27.74/6.12 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.74/6.12 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.74/6.12 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.74/6.12 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.74/6.12 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.74/6.12 Execution resolution_3 ended with status: unsatisfiable
% 27.74/6.12 Used heuristic: resolution_3
% 27.74/6.12
% 27.74/6.12 Input Clauses:
% 27.74/6.12
% 27.74/6.12 Predicates: p2 p9 p8
% 27.74/6.12 Fol Constants: c14 c10 c11 c15 c16 c12 c13
% 27.74/6.12 Fol Functions: f7 f6 f5 f4 f3
% 27.74/6.12 Problem Properties:
% 27.74/6.12 This is a full first-order problem without equality.
% 27.74/6.12
% 27.74/6.12 After reduction: Problem Properties:
% 27.74/6.12 This is a full first-order problem without equality.
% 27.74/6.12
% 27.74/6.12
% 27.74/6.12 Reduced Input Clauses:
% 27.74/6.12
% 27.74/6.12 Most General Atoms: p2(x2,x3) p9(x3,x1) p8(x3,x1)
% 27.74/6.12
% 27.74/6.12 === Starting SPASS-SCL-FOL A Little Less Naive, considering 52 atoms initially, heuristics mode: resolution_3 ===
% 27.74/6.12
% 27.74/6.12 === Backtracking. Learning clause 16:3:2:[10.2,2.1]:TopTop: p2(c10,x0),p2(c14,x1) -> p9(x1,x0)
% 27.74/6.12 === Backtracking. Learning clause 17:3:2:[11.2,3.1]:TopTop: p2(c14,x0),p2(c11,x1) -> p8(x1,x0)
% 27.74/6.12 === Backtracking. Learning clause 18:2:2:[9.2,1.1]:TopTop: p2(x0,x1) -> p2(x1,x0)
% 27.74/6.12 === Backtracking. Learning clause 19:2:1:[9.2,4.1]:Top: p2(f7(c10,c14),x0) -> p2(x0,c15)
% 27.74/6.12 === Backtracking. Learning clause 20:2:1:[9.2,5.1]:Top: p2(f6(c15,c11),x0) -> p2(x0,c16)
% 27.74/6.12 === Backtracking. Learning clause 21:2:1:[9.2,6.1]:Top: p2(f3(f4(f5(c12)),c13),x0) -> p2(x0,c16)
% 27.74/6.12 === Clause set with instances from active satisfied. Growing active. New size: 73
% 27.74/6.12 === Restarting.
% 27.74/6.12 === Conflict found: 18:2:2:[9.2,1.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> c14, x1 -> f7(c10,c14)}
% 27.74/6.12 === Backtracking. Learning clause 22:2:1:[18.2,19.1]:Top: p2(x0,f7(c10,c14)) -> p2(x0,c15)
% 27.74/6.12 === Conflict found: 18:2:2:[9.2,1.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> f7(c10,c14), x1 -> c15}
% 27.74/6.12 === Backtracking. Learning clause 23:1:0:[18.1,4.1]:: -> p2(c15,f7(c10,c14))
% 27.74/6.12 === Conflict found: 18:2:2:[9.2,1.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> c14, x1 -> f6(c15,c11)}
% 27.74/6.12 === Backtracking. Learning clause 24:2:1:[18.2,20.1]:Top: p2(x0,f6(c15,c11)) -> p2(x0,c16)
% 27.74/6.12 === Conflict found: 18:2:2:[9.2,1.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> f6(c15,c11), x1 -> c16}
% 27.74/6.12 === Backtracking. Learning clause 25:1:0:[18.1,5.1]:: -> p2(c16,f6(c15,c11))
% 27.74/6.12 === Backtracking. Learning clause 26:3:2:[9.1,13.3,4.1]:TopTop: p2(c10,x0),p2(c14,x1) -> p2(f7(x0,x1),c15)
% 27.74/6.12 === Conflict found: 18:2:2:[9.2,1.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> c14, x1 -> f3(f4(f5(c12)),c13)}
% 27.74/6.12 === Backtracking. Learning clause 27:2:1:[18.2,21.1]:Top: p2(x0,f3(f4(f5(c12)),c13)) -> p2(x0,c16)
% 27.74/6.12 === Conflict found: 18:2:2:[9.2,1.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> f3(f4(f5(c12)),c13), x1 -> c16}
% 27.74/6.12 === Backtracking. Learning clause 28:1:0:[18.1,6.1]:: -> p2(c16,f3(f4(f5(c12)),c13))
% 27.74/6.12 === Backtracking. Learning clause 29:3:2:[9.1,12.3,6.1]:TopTop: p2(f4(f5(c12)),x0),p2(c13,x1) -> p2(f3(x0,x1),c16)
% 27.74/6.12 === Clause set with instances from active satisfied. Growing active. New size: 85
% 27.74/6.12 === Restarting.
% 27.74/6.12 === Conflict found: 18:2:2:[9.2,1.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> f7(c14,c14), x1 -> c15}
% 27.74/6.12 === Backtracking. Learning clause 30:3:2:[18.1,26.3]:TopTop: p2(c10,x0),p2(c14,x1) -> p2(c15,f7(x0,x1))
% 27.74/6.12 === Conflict found: 29:3:2:[9.1,12.3,6.1]:TopTop: p2(f4(f5(c12)),x0),p2(c13,x1) -> p2(f3(x0,x1),c16) {x0 -> c14, x1 -> c14}
% 27.74/6.12 === Backtracking. Learning clause 31:4:3:[29.3,18.1,9.3]:TopTopTop: p2(c13,x0),p2(x1,f4(f5(c12))),p2(x1,x2) -> p2(c16,f3(x2,x0))
% 27.74/6.12 === Clause set with instances from active satisfied. Growing active. New size: 89
% 27.74/6.12 === Restarting.
% 27.74/6.12 === Conflict found: 31:4:3:[29.3,18.1,9.3]:TopTopTop: p2(c13,x0),p2(x1,f4(f5(c12))),p2(x1,x2) -> p2(c16,f3(x2,x0)) {x0 -> c14, x1 -> f3(c14,c14), x2 -> f3(c14,c14)}
% 27.74/6.12 === Backtracking. Learning clause 32:3:2:[31.3,1.1]:TopTop: p2(c13,x0),p2(x1,f4(f5(c12))) -> p2(c16,f3(x1,x0))
% 27.74/6.12 === Clause set with instances from active satisfied. Growing active. New size: 91
% 27.74/6.12 === Restarting.
% 27.74/6.12 === Conflict found: 32:3:2:[31.3,1.1]:TopTop: p2(c13,x0),p2(x1,f4(f5(c12))) -> p2(c16,f3(x1,x0)) {x0 -> c14, x1 -> f4(c14)}
% 27.74/6.12 === Backtracking. Learning clause 33:3:2:[32.2,8.2]:TopTop: p2(c13,x0),p2(x1,f5(c12)) -> p2(c16,f3(f4(x1),x0))
% 27.74/6.12 === Clause set with instances from active satisfied. Growing active. New size: 93
% 27.74/6.12 === Restarting.
% 27.74/6.12 === Clause set with instances from active satisfied. Growing active. New size: 151
% 27.74/6.12 === Clause set with instances from active satisfied. Growing active. New size: 215
% 27.74/6.12
% 27.74/6.12 SZS status Unsatisfiable
% 27.74/6.12
% 27.74/6.12 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.74/6.12
% 27.74/6.12 SPASS-SCL-FOL Statistics:
% 27.74/6.12 Number of learned clauses: 18
% 27.74/6.12 Number of propagations: 691
% 27.74/6.12 Number of decisions: 579
% 27.74/6.12 Number of resolutions: 27
% 27.74/6.12 Number of condensations: 0
% 27.74/6.12 Number of sub resolutions: 0
% 27.74/6.12 Number of input literals (deduplicated): 18
% 27.74/6.12 Number of grows: 7
% 27.74/6.12 Number of considered ground atoms: 215
% 27.74/6.12
% 27.74/6.12 Needed: 0:00:05.53
% 27.74/6.12
%------------------------------------------------------------------------------