%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN575-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 : n008.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 0.85s 0.68s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SYN575-1 : TPTP v9.2.1. Released v2.5.0.
% 0.13/0.14 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.35 % Computer : n008.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu May 7 13:45:44 EDT 2026
% 0.17/0.35 % CPUTime :
% 0.17/0.35 SPASS-SCL-FOL version:
% 0.21/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.85/0.67 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.85/0.67 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.85/0.67 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.85/0.67 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.85/0.67 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.85/0.67 Execution resolution_1 ended with status: unsatisfiable
% 0.85/0.67 Used heuristic: resolution_1
% 0.85/0.67
% 0.85/0.67 Input Clauses:
% 0.85/0.67
% 0.85/0.67 Predicates: p10 p7 p3 p2 p9 p11
% 0.85/0.67 Fol Constants: c12 c13 c14 c15
% 0.85/0.67 Fol Functions: f5 f4 f6 f8
% 0.85/0.67 Problem Properties:
% 0.85/0.67 This is a full first-order problem without equality.
% 0.85/0.67
% 0.85/0.67 After reduction: Problem Properties:
% 0.85/0.67 This is a full first-order problem without equality.
% 0.85/0.67
% 0.85/0.67
% 0.85/0.67 Reduced Input Clauses:
% 0.85/0.67
% 0.85/0.67 Most General Atoms: p7(x1,x2) p2(x1,x2) p10(x1,x3) p11(x2,x3) p3(x2,x3) p9(x1,x3)
% 0.85/0.67
% 0.85/0.67 === Starting SPASS-SCL-FOL A Little Less Naive, considering 46 atoms initially, heuristics mode: resolution_1 ===
% 0.85/0.67
% 0.85/0.67 === Backtracking. Learning clause 23:3:2:[19.2,5.1]:TopTop: p7(c12,x0),p3(c13,x1) -> p9(x0,x1)
% 0.85/0.67 === Backtracking. Learning clause 24:3:2:[18.1,6.1]:TopTop: p2(c14,x0),p10(c15,x1) -> p11(x0,x1)
% 0.85/0.67 === Backtracking. Learning clause 25:2:2:[17.2,4.1]:TopTop: p2(x0,x1) -> p2(x1,x0)
% 0.85/0.67 === Backtracking. Learning clause 26:3:3:[19.3,7.1]:TopTopTop: p7(x0,x1),p9(x0,f4(f5(x2))) -> p9(x1,f4(x2))
% 0.85/0.67 === Backtracking. Learning clause 27:2:2:[16.2,7.1]:TopTop: p3(f4(f5(x0)),x1) -> p3(x1,f4(x0))
% 0.85/0.67 === Backtracking. Learning clause 28:3:3:[19.3,8.1]:TopTopTop: p7(x0,x1),p9(x0,f6(f5(x2))) -> p9(x1,f6(x2))
% 0.85/0.67 === Backtracking. Learning clause 29:2:2:[16.2,8.1]:TopTop: p3(f6(f5(x0)),x1) -> p3(x1,f6(x0))
% 0.85/0.67 === Backtracking. Learning clause 30:2:2:[15.2,2.1]:TopTop: p7(x0,x1) -> p7(x1,x0)
% 0.85/0.67 === Clause set with instances from active satisfied. Growing active. New size: 64
% 0.85/0.67 === Restarting.
% 0.85/0.67 === Backtracking. Learning clause 31:4:3:[19.2,10.2]:TopTopTop: p7(x0,x1),p3(f6(c14),x2),p9(x0,c13) -> p9(x1,x2)
% 0.85/0.67 === Backtracking. Learning clause 32:5:5:[19.4,26.2]:TopTopTopTopTop: p7(x0,x1),p9(x0,x2),p3(x2,f4(f5(x3))),p7(x1,x4) -> p9(x4,f4(x3))
% 0.85/0.67 === Backtracking. Learning clause 33:5:5:[19.4,28.2]:TopTopTopTopTop: p7(x0,x1),p9(x0,x2),p3(x2,f6(f5(x3))),p7(x1,x4) -> p9(x4,f6(x3))
% 0.85/0.67 === Backtracking. Learning clause 34:2:2:[16.2,3.1]:TopTop: p3(x0,x1) -> p3(x1,x0)
% 0.85/0.67 === Clause set with instances from active satisfied. Growing active. New size: 75
% 0.85/0.67 === Restarting.
% 0.85/0.67 === Conflict found: 31:4:3:[19.2,10.2]:TopTopTop: p7(x0,x1),p3(f6(c14),x2),p9(x0,c13) -> p9(x1,x2) {x0 -> c12, x1 -> c12, x2 -> f6(c12)}
% 0.85/0.67 === Backtracking. Learning clause 35:4:3:[31.2,12.2]:TopTopTop: p7(x0,x1),p9(x0,c13),p2(c14,x2) -> p9(x1,f6(x2))
% 0.85/0.67 === Backtracking. Learning clause 36:3:3:[16.2,12.2,34.2]:TopTopTop: p2(x0,x1),p3(x2,f6(x0)) -> p3(x2,f6(x1))
% 0.85/0.67 === Backtracking. Learning clause 37:3:3:[19.1,2.1]:TopTopTop: p9(x0,x1),p3(x1,x2) -> p9(x0,x2)
% 0.85/0.67 === Clause set with instances from active satisfied. Growing active. New size: 78
% 0.85/0.68 === Restarting.
% 0.85/0.68 === Backtracking. Learning clause 38:4:4:[16.3,16.2]:TopTopTopTop: p3(x0,x1),p3(x0,x2),p3(x1,x3) -> p3(x3,x2)
% 0.85/0.68 === Conflict found: 34:2:2:[16.2,3.1]:TopTop: p3(x0,x1) -> p3(x1,x0) {x0 -> f4(f5(c12)), x1 -> f4(c12)}
% 0.85/0.68 === Backtracking. Learning clause 39:1:1:[34.1,7.1]:Top: -> p3(f4(x0),f4(f5(x0)))
% 0.85/0.68 === Conflict found: 37:3:3:[19.1,2.1]:TopTopTop: p9(x0,x1),p3(x1,x2) -> p9(x0,x2) {x0 -> f8(c12,c12), x1 -> c13, x2 -> f6(c12)}
% 0.85/0.68 === Backtracking. Learning clause 40:4:4:[37.3,37.1]:TopTopTopTop: p9(x0,x1),p3(x1,x2),p3(x2,x3) -> p9(x0,x3)
% 0.85/0.68 === Clause set with instances from active satisfied. Growing active. New size: 80
% 0.85/0.68 === Restarting.
% 0.85/0.68 === Conflict found: 40:4:4:[37.3,37.1]:TopTopTopTop: p9(x0,x1),p3(x1,x2),p3(x2,x3) -> p9(x0,x3) {x0 -> f8(c12,c12), x1 -> c13, x2 -> c12, x3 -> f6(c12)}
% 0.85/0.68 === Backtracking. Learning clause 41:7:5:[40.4,22.5]:TopTopTopTopTop: p9(f8(x0,x1),x2),p3(x2,x3),p3(x3,f6(x1)),p11(x4,c15),p9(c12,x0),p2(x1,f5(x4)),p9(f8(x0,x1),x0) ->
% 0.85/0.68 === Backtracking. Learning clause 42:7:5:[21.5,40.1,41.1]:TopTopTopTopTop: p3(f6(x0),x1),p3(x1,x2),p3(x2,x3),p3(x3,f6(x0)),p11(x4,c15),p9(c12,x2),p2(x0,f5(x4)) ->
% 0.85/0.68 === Conflict found: 42:7:5:[21.5,40.1,41.1]:TopTopTopTopTop: p3(f6(x0),x1),p3(x1,x2),p3(x2,x3),p3(x3,f6(x0)),p11(x4,c15),p9(c12,x2),p2(x0,f5(x4)) -> {x0 -> f5(c12), x1 -> c12, x2 -> c12, x3 -> c12, x4 -> c12}
% 0.85/0.68 === Backtracking. Learning clause 43:8:6:[42.7,4.1,38.4]:TopTopTopTopTopTop: p3(x0,x1),p3(x1,x2),p3(x2,f6(f5(x3))),p11(x3,c15),p9(c12,x1),p3(x4,x5),p3(x4,x0),p3(x5,f6(f5(x3))) ->
% 0.85/0.68 === Conflict found: 34:2:2:[16.2,3.1]:TopTop: p3(x0,x1) -> p3(x1,x0) {x0 -> f6(f5(c12)), x1 -> f6(c12)}
% 0.85/0.68 === Backtracking. Learning clause 44:6:4:[34.1,8.1,43.3]:TopTopTopTop: p3(x0,x1),p3(x1,f6(x2)),p11(x2,c15),p9(c12,x1),p3(x3,f6(x2)),p3(x3,x0) ->
% 0.85/0.68 === Conflict found: 44:6:4:[34.1,8.1,43.3]:TopTopTopTop: p3(x0,x1),p3(x1,f6(x2)),p11(x2,c15),p9(c12,x1),p3(x3,f6(x2)),p3(x3,x0) -> {x0 -> f6(c12), x1 -> f6(c12), x2 -> c12, x3 -> f6(c12)}
% 0.85/0.68 === Backtracking. Learning clause 45:4:2:[44.1,3.1,35.4]:TopTop: p11(x0,c15),p7(x1,c12),p9(x1,c13),p2(c14,x0) ->
% 0.85/0.68 === Conflict found: 45:4:2:[44.1,3.1,35.4]:TopTop: p11(x0,c15),p7(x1,c12),p9(x1,c13),p2(c14,x0) -> {x0 -> c14, x1 -> c12}
% 0.85/0.68
% 0.85/0.68 SZS status Unsatisfiable
% 0.85/0.68
% 0.85/0.68 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.85/0.68
% 0.85/0.68 SPASS-SCL-FOL Statistics:
% 0.85/0.68 Number of learned clauses: 23
% 0.85/0.68 Number of propagations: 561
% 0.85/0.68 Number of decisions: 405
% 0.85/0.68 Number of resolutions: 32
% 0.85/0.68 Number of condensations: 1
% 0.85/0.68 Number of sub resolutions: 0
% 0.85/0.68 Number of input literals (deduplicated): 25
% 0.85/0.68 Number of grows: 4
% 0.85/0.68 Number of considered ground atoms: 80
% 0.85/0.68
% 0.85/0.68 Needed: 0:00:00.13
% 0.85/0.68
%------------------------------------------------------------------------------