%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN582-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 : n002.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:03 PM UTC 2026
% Result : Unsatisfiable 3.70s 1.22s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN582-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.18/0.34 % Computer : n002.cluster.edu
% 0.18/0.34 % Model : x86_64 x86_64
% 0.18/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.34 % Memory : 8042.1875MB
% 0.18/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.34 % CPULimit : 300
% 0.18/0.34 % WCLimit : 300
% 0.18/0.34 % DateTime : Thu May 7 13:45:47 EDT 2026
% 0.18/0.34 % CPUTime :
% 0.18/0.34 SPASS-SCL-FOL version:
% 0.20/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 3.70/1.22 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.70/1.22 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.70/1.22 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.70/1.22 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.70/1.22 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.70/1.22 Execution resolution_3 ended with status: unsatisfiable
% 3.70/1.22 Used heuristic: resolution_3
% 3.70/1.22
% 3.70/1.22 Input Clauses:
% 3.70/1.22
% 3.70/1.22 Predicates: p7 p2 p5 p12 p11 p10
% 3.70/1.22 Fol Constants: c18 c14 c13 c17 c15 c16
% 3.70/1.22 Fol Functions: f3 f9 f8 f6 f4
% 3.70/1.22 Problem Properties:
% 3.70/1.22 This is a full first-order problem without equality.
% 3.70/1.22
% 3.70/1.22 After reduction: Problem Properties:
% 3.70/1.22 This is a full first-order problem without equality.
% 3.70/1.22
% 3.70/1.22
% 3.70/1.22 Reduced Input Clauses:
% 3.70/1.22
% 3.70/1.22 Most General Atoms: p7(x1,x2) p11(x1,x3) p12(x1,x3) p5(x2,x3) p2(x4,x5) p10(x1,x5,x3)
% 3.70/1.22
% 3.70/1.22 === Starting SPASS-SCL-FOL A Little Less Naive, considering 53 atoms initially, heuristics mode: resolution_3 ===
% 3.70/1.22
% 3.70/1.22 === Backtracking. Learning clause 26:3:2:[22.3,4.1]:TopTop: p2(c18,x0),p2(c14,x1) -> p12(x0,x1)
% 3.70/1.22 === Backtracking. Learning clause 27:2:2:[17.2,1.1]:TopTop: p7(x0,x1) -> p7(x1,x0)
% 3.70/1.22 === Backtracking. Learning clause 28:2:2:[18.2,2.1]:TopTop: p2(x0,x1) -> p2(x1,x0)
% 3.70/1.22 === Backtracking. Learning clause 29:4:2:[21.1,6.1,16.1]:TopTop: p2(x0,x1),p11(f3(c18),x0) -> p12(f8(f9(c17)),x1),p2(f8(f9(c17)),x1)
% 3.70/1.22 === Backtracking. Learning clause 30:4:2:[21.2,6.1,16.1]:TopTop: p2(x0,x1),p11(x0,f3(c18)) -> p12(x1,f8(f9(c17))),p2(x1,f8(f9(c17)))
% 3.70/1.22 === Backtracking. Learning clause 31:3:2:[10.2,9.1,22.4]:TopTop: p2(x0,f4(f6(c15,c18))),p2(x1,c16),p12(x0,x1) ->
% 3.70/1.22 === Backtracking. Learning clause 32:1:0:[10.2,9.1]:: p12(f4(f6(c15,c18)),c16) ->
% 3.70/1.22 === Backtracking. Learning clause 33:1:0:[11.2,9.1]:: p2(f4(f6(c15,c18)),c16) ->
% 3.70/1.22 === Backtracking. Learning clause 34:2:0:[16.1,8.1]:: -> p12(f4(f6(c15,c14)),c16),p2(f4(f6(c15,c14)),c16)
% 3.70/1.22 === Backtracking. Learning clause 35:2:0:[16.1,7.1]:: -> p12(f4(f6(c15,c13)),c16),p2(f4(f6(c15,c13)),c16)
% 3.70/1.22 === Clause set with instances from active satisfied. Growing active. New size: 76
% 3.70/1.22 === Restarting.
% 3.70/1.22 === Conflict found: 28:2:2:[18.2,2.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> c13, x1 -> c18}
% 3.70/1.22 === Backtracking. Learning clause 36:1:0:[28.1,5.1]:: -> p2(c18,c13)
% 3.70/1.22 === Backtracking. Learning clause 38:1:0:[36.0,37.0,25.4,9.1,6.1,26.3,4.1]:: p2(c14,c18) ->
% 3.70/1.22 === Conflict found: 34:2:0:[16.1,8.1]:: -> p12(f4(f6(c15,c14)),c16),p2(f4(f6(c15,c14)),c16) {}
% 3.70/1.22 === Backtracking. Learning clause 39:4:2:[34.1,22.3]:TopTop: p2(f4(f6(c15,c14)),x0),p2(c16,x1) -> p2(f4(f6(c15,c14)),c16),p12(x0,x1)
% 3.70/1.22 === Conflict found: 35:2:0:[16.1,7.1]:: -> p12(f4(f6(c15,c13)),c16),p2(f4(f6(c15,c13)),c16) {}
% 3.70/1.22 === Backtracking. Learning clause 40:4:2:[35.1,22.3]:TopTop: p2(f4(f6(c15,c13)),x0),p2(c16,x1) -> p2(f4(f6(c15,c13)),c16),p12(x0,x1)
% 3.70/1.22 === Backtracking. Learning clause 41:3:2:[14.2,31.1]:TopTop: p2(x0,f6(c15,c18)),p2(x1,c16),p12(f4(x0),x1) ->
% 3.70/1.22 === Backtracking. Learning clause 42:2:1:[22.1,2.1,32.1]:Top: p2(x0,c16),p12(f4(f6(c15,c18)),x0) ->
% 3.70/1.22 === Clause set with instances from active satisfied. Growing active. New size: 96
% 3.70/1.22 === Restarting.
% 3.70/1.22 === Conflict found: 28:2:2:[18.2,2.1]:TopTop: p2(x0,x1) -> p2(x1,x0) {x0 -> c18, x1 -> c14}
% 3.70/1.22 === Backtracking. Learning clause 43:1:0:[28.2,38.1]:: p2(c18,c14) ->
% 3.70/1.22 === Conflict found: 39:4:2:[34.1,22.3]:TopTop: p2(f4(f6(c15,c14)),x0),p2(c16,x1) -> p2(f4(f6(c15,c14)),c16),p12(x0,x1) {x0 -> c18, x1 -> c18}
% 3.70/1.22 === Backtracking. Learning clause 44:4:2:[39.3,28.1]:TopTop: p2(f4(f6(c15,c14)),x0),p2(c16,x1) -> p12(x0,x1),p2(c16,f4(f6(c15,c14)))
% 3.70/1.22 === Conflict found: 40:4:2:[35.1,22.3]:TopTop: p2(f4(f6(c15,c13)),x0),p2(c16,x1) -> p2(f4(f6(c15,c13)),c16),p12(x0,x1) {x0 -> c18, x1 -> c18}
% 3.70/1.22 === Backtracking. Learning clause 45:4:2:[40.3,28.1]:TopTop: p2(f4(f6(c15,c13)),x0),p2(c16,x1) -> p12(x0,x1),p2(c16,f4(f6(c15,c13)))
% 3.70/1.22 === Conflict found: 41:3:2:[14.2,31.1]:TopTop: p2(x0,f6(c15,c18)),p2(x1,c16),p12(f4(x0),x1) -> {x0 -> f6(c18,c18), x1 -> c18}
% 3.70/1.22 === Backtracking. Learning clause 46:4:3:[41.1,23.3]:TopTopTop: p2(x0,c16),p12(f4(f6(x1,x2)),x0),p2(x2,c18),p5(x1,c15) ->
% 3.70/1.22 === Backtracking. Learning clause 47:3:1:[22.1,2.1,34.1]:Top: p2(c16,x0) -> p12(f4(f6(c15,c14)),x0),p2(f4(f6(c15,c14)),c16)
% 3.70/1.22 === Backtracking. Learning clause 48:3:1:[22.1,2.1,35.1]:Top: p2(c16,x0) -> p12(f4(f6(c15,c13)),x0),p2(f4(f6(c15,c13)),c16)
% 3.70/1.22 === Clause set with instances from active satisfied. Growing active. New size: 104
% 3.70/1.22 === Restarting.
% 3.70/1.22 === Backtracking. Learning clause 49:6:4:[22.3,29.3]:TopTopTopTop: p2(f8(f9(c17)),x0),p2(x1,x2),p2(x3,x1),p11(f3(c18),x3) -> p12(x0,x2),p2(f8(f9(c17)),x1)
% 3.70/1.22 === Backtracking. Learning clause 50:6:5:[22.3,26.3,18.3]:TopTopTopTopTop: p2(x0,x1),p2(c18,x2),p2(c14,x0),p2(x3,x2),p2(x3,x4) -> p12(x4,x1)
% 3.70/1.22 === Conflict found: 50:6:5:[22.3,26.3,18.3]:TopTopTopTopTop: p2(x0,x1),p2(c18,x2),p2(c14,x0),p2(x3,x2),p2(x3,x4) -> p12(x4,x1) {x0 -> c16, x1 -> c18, x2 -> f4(f6(c15,c13)), x3 -> c18, x4 -> f4(f6(c18,c18))}
% 3.70/1.22 === Backtracking. Learning clause 51:8:6:[50.6,46.2]:TopTopTopTopTopTop: p2(x0,x1),p2(c18,x2),p2(c14,x0),p2(x3,x2),p2(x3,f4(f6(x4,x5))),p2(x1,c16),p2(x5,c18),p5(x4,c15) ->
% 3.70/1.22 === Conflict found: 48:3:1:[22.1,2.1,35.1]:Top: p2(c16,x0) -> p12(f4(f6(c15,c13)),x0),p2(f4(f6(c15,c13)),c16) {x0 -> c18}
% 3.70/1.22 === Backtracking. Learning clause 52:2:0:[48.2,46.2,28.1,51.5,3.1,2.1,28.2,5.1]:: p2(c18,c16),p2(c14,c16) ->
% 3.70/1.22 === Backtracking. Learning clause 53:3:2:[18.3,33.1,18.3]:TopTop: p2(x0,c16),p2(x1,x0),p2(x1,f4(f6(c15,c18))) ->
% 3.70/1.22 === Backtracking. Learning clause 54:3:3:[18.2,14.2,28.2]:TopTopTop: p2(x0,x1),p2(x2,f4(x0)) -> p2(x2,f4(x1))
% 3.70/1.22 === Conflict found: 48:3:1:[22.1,2.1,35.1]:Top: p2(c16,x0) -> p12(f4(f6(c15,c13)),x0),p2(f4(f6(c15,c13)),c16) {x0 -> c18}
% 3.70/1.22 === Backtracking. Learning clause 57:7:4:[5.0,55.2,3.0,56.3,48.2,46.2,45.1,18.2,54.2]:TopTopTopTop: p2(c16,x0),p2(x0,c16),p2(c16,x1),p2(c16,x2),p2(f6(c15,c13),x3) -> p12(c16,x1),p2(x2,f4(x3))
% 3.70/1.22 === Conflict found: 54:3:3:[18.2,14.2,28.2]:TopTopTop: p2(x0,x1),p2(x2,f4(x0)) -> p2(x2,f4(x1)) {x0 -> f6(c18,c18), x1 -> f6(c15,c18), x2 -> c18}
% 3.70/1.22 === Backtracking. Learning clause 58:5:4:[54.1,23.3,53.3]:TopTopTopTop: p2(x0,f4(f6(x1,x2))),p2(x2,c18),p5(x1,c15),p2(x3,c16),p2(x0,x3) ->
% 3.70/1.22 === Conflict found: 48:3:1:[22.1,2.1,35.1]:Top: p2(c16,x0) -> p12(f4(f6(c15,c13)),x0),p2(f4(f6(c15,c13)),c16) {x0 -> c18}
% 3.70/1.22 === Backtracking. Learning clause 62:5:4:[5.0,59.1,3.0,60.2,28.1,61.3,48.2,46.2,45.1,58.1,22.3]:TopTopTopTop: p2(c16,x0),p2(c16,x1),p2(c16,x2),p2(x0,x3) -> p12(x2,x3)
% 3.70/1.22 === Conflict found: 48:3:1:[22.1,2.1,35.1]:Top: p2(c16,x0) -> p12(f4(f6(c15,c13)),x0),p2(f4(f6(c15,c13)),c16) {x0 -> c18}
% 3.70/1.22 === Backtracking. Learning clause 63:1:1:[48.2,46.2,28.1,58.1,3.1,2.1,28.2,5.1]:Top: p2(x0,c16) ->
% 3.70/1.22 === Conflict found: 63:1:1:[48.2,46.2,28.1,58.1,3.1,2.1,28.2,5.1]:Top: p2(x0,c16) -> {x0 -> c16}
% 3.70/1.22
% 3.70/1.22 SZS status Unsatisfiable
% 3.70/1.22
% 3.70/1.22 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.70/1.22
% 3.70/1.22 SPASS-SCL-FOL Statistics:
% 3.70/1.22 Number of learned clauses: 32
% 3.70/1.22 Number of propagations: 1011
% 3.70/1.22 Number of decisions: 485
% 3.70/1.22 Number of resolutions: 64
% 3.70/1.22 Number of condensations: 2
% 3.70/1.22 Number of sub resolutions: 6
% 3.70/1.22 Number of input literals (deduplicated): 27
% 3.70/1.22 Number of grows: 3
% 3.70/1.22 Number of considered ground atoms: 104
% 3.70/1.22
% 3.70/1.22 Needed: 0:00:00.68
% 3.70/1.22
%------------------------------------------------------------------------------