%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN579-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 : n015.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:02 PM UTC 2026
% Result : Unsatisfiable 7.27s 2.31s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SYN579-1 : TPTP v9.2.1. Released v2.5.0.
% 0.09/0.15 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.37 % Computer : n015.cluster.edu
% 0.18/0.37 % Model : x86_64 x86_64
% 0.18/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.37 % Memory : 8042.1875MB
% 0.18/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.37 % CPULimit : 300
% 0.18/0.37 % WCLimit : 300
% 0.18/0.37 % DateTime : Thu May 7 13:45:47 EDT 2026
% 0.18/0.37 % CPUTime :
% 0.18/0.37 SPASS-SCL-FOL version:
% 0.28/0.46 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 7.27/2.31 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.27/2.31 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.27/2.31 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.27/2.31 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.27/2.31 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.27/2.31 Execution resolution_1 ended with status: unsatisfiable
% 7.27/2.31 Used heuristic: resolution_1
% 7.27/2.31
% 7.27/2.31 Input Clauses:
% 7.27/2.31
% 7.27/2.31 Predicates: p10 p7 p3 p2 p9 p11
% 7.27/2.31 Fol Constants: c12 c13 c14 c15 c16
% 7.27/2.31 Fol Functions: f5 f4 f6 f8
% 7.27/2.31 Problem Properties:
% 7.27/2.31 This is a full first-order problem without equality.
% 7.27/2.31
% 7.27/2.31 After reduction: Problem Properties:
% 7.27/2.31 This is a full first-order problem without equality.
% 7.27/2.31
% 7.27/2.31
% 7.27/2.31 Reduced Input Clauses:
% 7.27/2.31
% 7.27/2.31 Most General Atoms: p7(x1,x2) p2(x1,x2) p10(x1,x3) p11(x2,x3) p3(x2,x3) p9(x1,x3)
% 7.27/2.31
% 7.27/2.31 === Starting SPASS-SCL-FOL A Little Less Naive, considering 49 atoms initially, heuristics mode: resolution_1 ===
% 7.27/2.31
% 7.27/2.31 === Backtracking. Learning clause 24:3:2:[20.2,5.1]:TopTop: p7(c12,x0),p3(c13,x1) -> p9(x0,x1)
% 7.27/2.31 === Backtracking. Learning clause 25:3:2:[19.1,6.1]:TopTop: p2(c14,x0),p10(c15,x1) -> p11(x0,x1)
% 7.27/2.31 === Backtracking. Learning clause 26:2:1:[18.2,7.1]:Top: p2(c16,x0) -> p2(x0,f5(c14))
% 7.27/2.31 === Backtracking. Learning clause 27:2:2:[18.2,4.1]:TopTop: p2(x0,x1) -> p2(x1,x0)
% 7.27/2.31 === Backtracking. Learning clause 28:3:3:[20.3,8.1]:TopTopTop: p7(x0,x1),p9(x0,f4(f5(x2))) -> p9(x1,f4(x2))
% 7.27/2.31 === Backtracking. Learning clause 29:2:2:[17.2,8.1]:TopTop: p3(f4(f5(x0)),x1) -> p3(x1,f4(x0))
% 7.27/2.31 === Backtracking. Learning clause 30:3:3:[20.3,9.1]:TopTopTop: p7(x0,x1),p9(x0,f6(f5(x2))) -> p9(x1,f6(x2))
% 7.27/2.31 === Backtracking. Learning clause 31:2:2:[17.2,9.1]:TopTop: p3(f6(f5(x0)),x1) -> p3(x1,f6(x0))
% 7.27/2.31 === Backtracking. Learning clause 32:4:1:[10.1,22.4]:Top: p11(c16,c15),p9(c12,x0) -> p9(f8(x0,c16),c13),p9(f8(x0,c16),x0)
% 7.27/2.31 === Backtracking. Learning clause 33:2:2:[16.2,2.1]:TopTop: p7(x0,x1) -> p7(x1,x0)
% 7.27/2.31 === Backtracking. Learning clause 34:4:1:[22.3,10.1]:Top: p11(x0,c15),p9(c12,f6(c16)) -> p9(f8(f6(c16),x0),f6(x0)),p9(f8(f6(c16),x0),c13)
% 7.27/2.31 === Clause set with instances from active satisfied. Growing active. New size: 81
% 7.27/2.31 === Restarting.
% 7.27/2.31 === Backtracking. Learning clause 35:4:3:[20.2,11.2]:TopTopTop: p7(x0,x1),p3(f6(c16),x2),p9(x0,c13) -> p9(x1,x2)
% 7.27/2.31 === Backtracking. Learning clause 36:3:3:[17.3,29.1]:TopTopTop: p3(x0,f4(f5(x1))),p3(x0,x2) -> p3(x2,f4(x1))
% 7.27/2.31 === Backtracking. Learning clause 37:3:3:[17.3,31.1]:TopTopTop: p3(x0,f6(f5(x1))),p3(x0,x2) -> p3(x2,f6(x1))
% 7.27/2.31 === Backtracking. Learning clause 38:4:3:[23.3,22.3,20.4]:TopTopTop: p11(x0,c15),p7(x1,c12),p9(x1,x2),p3(x2,f6(x0)) ->
% 7.27/2.31 === Conflict found: 34:4:1:[22.3,10.1]:Top: p11(x0,c15),p9(c12,f6(c16)) -> p9(f8(f6(c16),x0),f6(x0)),p9(f8(f6(c16),x0),c13) {x0 -> c12}
% 7.27/2.31 === Backtracking. Learning clause 39:6:2:[34.3,38.3]:TopTop: p11(x0,c15),p9(c12,f6(c16)),p11(x1,c15),p7(f8(f6(c16),x0),c12),p3(f6(x0),f6(x1)) -> p9(f8(f6(c16),x0),c13)
% 7.27/2.31 === Conflict found: 34:4:1:[22.3,10.1]:Top: p11(x0,c15),p9(c12,f6(c16)) -> p9(f8(f6(c16),x0),f6(x0)),p9(f8(f6(c16),x0),c13) {x0 -> c16}
% 7.27/2.31 === Backtracking. Learning clause 40:3:0:[34.3,23.3]:: p11(c16,c15),p9(c12,f6(c16)) -> p9(f8(f6(c16),c16),c13)
% 7.27/2.31 === Backtracking. Learning clause 42:1:0:[5.0,41.1,11.2,23.3,40.3,11.2]:: p11(c16,c15) ->
% 7.27/2.31 === Clause set with instances from active satisfied. Growing active. New size: 102
% 7.27/2.31 === Restarting.
% 7.27/2.31 === Conflict found: 25:3:2:[19.1,6.1]:TopTop: p2(c14,x0),p10(c15,x1) -> p11(x0,x1) {x0 -> c16, x1 -> c15}
% 7.27/2.31 === Backtracking. Learning clause 43:2:0:[25.3,42.1]:: p2(c14,c16),p10(c15,c15) ->
% 7.27/2.31 === Backtracking. Learning clause 44:3:2:[19.4,42.1]:TopTop: p11(x0,x1),p2(x0,c16),p10(x1,c15) ->
% 7.27/2.31 === Backtracking. Learning clause 45:3:3:[17.2,13.2]:TopTopTop: p3(f6(x0),x1),p2(x0,x2) -> p3(x1,f6(x2))
% 7.27/2.31 === Conflict found: 35:4:3:[20.2,11.2]:TopTopTop: p7(x0,x1),p3(f6(c16),x2),p9(x0,c13) -> p9(x1,x2) {x0 -> c12, x1 -> c12, x2 -> f6(c12)}
% 7.27/2.31 === Backtracking. Learning clause 46:4:3:[35.2,13.2]:TopTopTop: p7(x0,x1),p9(x0,c13),p2(c16,x2) -> p9(x1,f6(x2))
% 7.27/2.31 === Backtracking. Learning clause 47:4:4:[20.3,13.2]:TopTopTopTop: p7(x0,x1),p9(x0,f6(x2)),p2(x2,x3) -> p9(x1,f6(x3))
% 7.27/2.31 === Clause set with instances from active satisfied. Growing active. New size: 111
% 7.27/2.31 === Restarting.
% 7.27/2.31 === Backtracking. Learning clause 48:4:4:[17.3,45.1]:TopTopTopTop: p3(x0,f6(x1)),p3(x0,x2),p2(x1,x3) -> p3(x2,f6(x3))
% 7.27/2.31 === Backtracking. Learning clause 49:3:3:[17.1,14.2]:TopTopTop: p3(f4(x0),x1),p2(x0,x2) -> p3(f4(x2),x1)
% 7.27/2.31 === Backtracking. Learning clause 50:3:3:[17.2,14.2]:TopTopTop: p3(f4(x0),x1),p2(x0,x2) -> p3(x1,f4(x2))
% 7.27/2.31 === Clause set with instances from active satisfied. Growing active. New size: 113
% 7.27/2.31 === Restarting.
% 7.27/2.31 === Conflict found: 38:4:3:[23.3,22.3,20.4]:TopTopTop: p11(x0,c15),p7(x1,c12),p9(x1,x2),p3(x2,f6(x0)) -> {x0 -> c12, x1 -> c12, x2 -> f6(c12)}
% 7.27/2.31 === Backtracking. Learning clause 51:3:2:[38.4,3.1]:TopTop: p11(x0,c15),p7(x1,c12),p9(x1,f6(x0)) ->
% 7.27/2.31 === Conflict found: 45:3:3:[17.2,13.2]:TopTopTop: p3(f6(x0),x1),p2(x0,x2) -> p3(x1,f6(x2)) {x0 -> c12, x1 -> f6(c16), x2 -> c12}
% 7.27/2.31 === Backtracking. Learning clause 52:5:4:[45.3,35.2]:TopTopTopTop: p3(f6(x0),f6(c16)),p2(x0,x1),p7(x2,x3),p9(x2,c13) -> p9(x3,f6(x1))
% 7.27/2.31 === Conflict found: 51:3:2:[38.4,3.1]:TopTop: p11(x0,c15),p7(x1,c12),p9(x1,f6(x0)) -> {x0 -> f5(c12), x1 -> c12}
% 7.27/2.31 === Backtracking. Learning clause 53:7:5:[51.3,46.4,19.4]:TopTopTopTopTop: p7(x0,c12),p7(x1,x0),p9(x1,c13),p2(c16,x2),p11(x3,x4),p2(x3,x2),p10(x4,c15) ->
% 7.27/2.31 === Clause set with instances from active satisfied. Growing active. New size: 117
% 7.27/2.31 === Restarting.
% 7.27/2.31 === Conflict found: 53:7:5:[51.3,46.4,19.4]:TopTopTopTopTop: p7(x0,c12),p7(x1,x0),p9(x1,c13),p2(c16,x2),p11(x3,x4),p2(x3,x2),p10(x4,c15) -> {x0 -> c12, x1 -> c12, x2 -> f5(c14), x3 -> c12, x4 -> c12}
% 7.27/2.31 === Backtracking. Learning clause 54:6:4:[53.4,7.1]:TopTopTopTop: p7(x0,c12),p7(x1,x0),p9(x1,c13),p11(x2,x3),p2(x2,f5(c14)),p10(x3,c15) ->
% 7.27/2.31 === Conflict found: 45:3:3:[17.2,13.2]:TopTopTop: p3(f6(x0),x1),p2(x0,x2) -> p3(x1,f6(x2)) {x0 -> c16, x1 -> c12, x2 -> f5(c12)}
% 7.27/2.31 === Backtracking. Learning clause 55:4:4:[45.3,37.1]:TopTopTopTop: p3(f6(x0),x1),p2(x0,f5(x2)),p3(x1,x3) -> p3(x3,f6(x2))
% 7.27/2.31 === Conflict found: 50:3:3:[17.2,14.2]:TopTopTop: p3(f4(x0),x1),p2(x0,x2) -> p3(x1,f4(x2)) {x0 -> c12, x1 -> f6(c16), x2 -> c12}
% 7.27/2.31 === Backtracking. Learning clause 56:4:4:[50.3,17.2]:TopTopTopTop: p3(f4(x0),x1),p2(x0,x2),p3(x1,x3) -> p3(x3,f4(x2))
% 7.27/2.31 === Conflict found: 56:4:4:[50.3,17.2]:TopTopTopTop: p3(f4(x0),x1),p2(x0,x2),p3(x1,x3) -> p3(x3,f4(x2)) {x0 -> f5(c12), x1 -> f4(c12), x2 -> f5(c12), x3 -> f4(c12)}
% 7.27/2.31 === Backtracking. Learning clause 57:5:5:[56.1,8.1,20.3]:TopTopTopTopTop: p2(f5(x0),x1),p3(f4(x0),x2),p7(x3,x4),p9(x3,x2) -> p9(x4,f4(x1))
% 7.27/2.31 === Conflict found: 56:4:4:[50.3,17.2]:TopTopTopTop: p3(f4(x0),x1),p2(x0,x2),p3(x1,x3) -> p3(x3,f4(x2)) {x0 -> f5(c12), x1 -> f4(c12), x2 -> f5(c12), x3 -> f4(c12)}
% 7.27/2.31 === Backtracking. Learning clause 58:3:3:[56.1,8.1]:TopTopTop: p2(f5(x0),x1),p3(f4(x0),x2) -> p3(x2,f4(x1))
% 7.27/2.31 === Conflict found: 45:3:3:[17.2,13.2]:TopTopTop: p3(f6(x0),x1),p2(x0,x2) -> p3(x1,f6(x2)) {x0 -> f5(c12), x1 -> f6(c12), x2 -> f5(c12)}
% 7.27/2.31 === Backtracking. Learning clause 59:2:2:[45.1,9.1]:TopTop: p2(f5(x0),x1) -> p3(f6(x0),f6(x1))
% 7.27/2.31 === Clause set with instances from active satisfied. Growing active. New size: 127
% 7.27/2.31 === Restarting.
% 7.27/2.31 === Clause set with instances from active satisfied. Growing active. New size: 191
% 7.27/2.31 === Backtracking. Learning clause 60:5:6:[20.1,21.3]:TopTopTopTopTopTop: p9(f8(x0,x1),x2),p3(x2,x3),p2(x1,x4),p3(x0,x5) -> p9(f8(x5,x4),x3)
% 7.27/2.31 === Backtracking. Learning clause 61:4:5:[16.1,21.3]:TopTopTopTopTop: p7(f8(x0,x1),x2),p2(x1,x3),p3(x0,x4) -> p7(f8(x4,x3),x2)
% 7.27/2.31 === Backtracking. Learning clause 62:3:3:[17.3,17.2,3.1]:TopTopTop: p3(x0,x1),p3(x1,x2) -> p3(x2,x0)
% 7.27/2.31 === Conflict found: 50:3:3:[17.2,14.2]:TopTopTop: p3(f4(x0),x1),p2(x0,x2) -> p3(x1,f4(x2)) {x0 -> f5(c12), x1 -> f4(c12), x2 -> f5(c12)}
% 7.27/2.31 === Backtracking. Learning clause 63:2:2:[50.2,4.1]:TopTop: p3(f4(x0),x1) -> p3(x1,f4(x0))
% 7.27/2.31 === Clause set with instances from active satisfied. Growing active. New size: 255
% 7.27/2.31 === Backtracking. Learning clause 64:5:5:[18.3,19.2]:TopTopTopTopTop: p2(x0,x1),p2(x0,x2),p11(x1,x3),p10(x3,x4) -> p11(x2,x4)
% 7.27/2.31 === Conflict found: 37:3:3:[17.3,31.1]:TopTopTop: p3(x0,f6(f5(x1))),p3(x0,x2) -> p3(x2,f6(x1)) {x0 -> f6(c16), x1 -> c14, x2 -> f6(c16)}
% 7.27/2.31
% 7.27/2.31 SZS status Unsatisfiable
% 7.27/2.31
% 7.27/2.31 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.27/2.31
% 7.27/2.31 SPASS-SCL-FOL Statistics:
% 7.27/2.31 Number of learned clauses: 40
% 7.27/2.31 Number of propagations: 1192
% 7.27/2.31 Number of decisions: 769
% 7.27/2.31 Number of resolutions: 54
% 7.27/2.31 Number of condensations: 0
% 7.27/2.31 Number of sub resolutions: 1
% 7.27/2.31 Number of input literals (deduplicated): 25
% 7.27/2.31 Number of grows: 8
% 7.27/2.31 Number of considered ground atoms: 255
% 7.27/2.31
% 7.27/2.31 Needed: 0:00:01.72
% 7.27/2.31
%------------------------------------------------------------------------------