%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN618-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 : n004.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:05 PM UTC 2026
% Result : Unsatisfiable 3.68s 1.43s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SYN618-1 : TPTP v9.2.1. Released v2.5.0.
% 0.11/0.14 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.35 % Computer : n004.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Thu May 7 13:46:03 EDT 2026
% 0.18/0.35 % CPUTime :
% 0.18/0.35 SPASS-SCL-FOL version:
% 0.20/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 3.68/1.43 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.68/1.43 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.68/1.43 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.68/1.43 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.68/1.43 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.68/1.43 Execution resolution_3 ended with status: unsatisfiable
% 3.68/1.43 Used heuristic: resolution_3
% 3.68/1.43
% 3.68/1.43 Input Clauses:
% 3.68/1.43
% 3.68/1.43 Predicates: p9 p10 p5 p4 p2 p14 p12 p13 p11 p15
% 3.68/1.43 Fol Constants: c16 c19 c20 c23 c21 c17 c18 c22 c24
% 3.68/1.43 Fol Functions: f3 f8 f7 f6
% 3.68/1.43 Problem Properties:
% 3.68/1.43 This is a full first-order problem without equality.
% 3.68/1.43
% 3.68/1.43 After reduction: Problem Properties:
% 3.68/1.43 This is a full first-order problem without equality.
% 3.68/1.43
% 3.68/1.43
% 3.68/1.43 Reduced Input Clauses:
% 3.68/1.43
% 3.68/1.43 Most General Atoms: p9(x1) p4(x1,x2) p14(x1,x2) p5(x2,x3) p12(x1,x3) p15(x1,x3) p13(x1,x3) p2(x2,x3) p10(x4,x5) p11(x3,x1,x5)
% 3.68/1.43
% 3.68/1.43 === Starting SPASS-SCL-FOL A Little Less Naive, considering 54 atoms initially, heuristics mode: resolution_3 ===
% 3.68/1.43
% 3.68/1.43 === Backtracking. Learning clause 34:3:2:[26.3,7.1]:TopTop: p5(c19,x0),p5(c20,x1) -> p12(x0,x1)
% 3.68/1.43 === Backtracking. Learning clause 35:3:2:[28.3,9.1]:TopTop: p5(c19,x0),p5(c23,x1) -> p13(x0,x1)
% 3.68/1.43 === Backtracking. Learning clause 36:3:1:[24.2,12.1,15.2]:Top: p2(c17,x0),p9(x0) -> p9(f3(c16))
% 3.68/1.43 === Backtracking. Learning clause 37:2:0:[15.2,12.1]:: p9(c17) -> p9(f3(c16))
% 3.68/1.43 === Backtracking. Learning clause 38:2:1:[24.2,12.1]:Top: p2(c17,x0) -> p2(x0,f3(c16))
% 3.68/1.43 === Backtracking. Learning clause 39:2:2:[22.2,3.1]:TopTop: p5(x0,x1) -> p5(x1,x0)
% 3.68/1.43 === Backtracking. Learning clause 40:2:2:[23.2,4.1]:TopTop: p4(x0,x1) -> p4(x1,x0)
% 3.68/1.43 === Backtracking. Learning clause 41:3:2:[28.1,14.1]:TopTop: p5(x0,x1),p13(f8(c16,c20),x0) -> p13(f6(f7(c22)),x1)
% 3.68/1.43 === Backtracking. Learning clause 42:3:2:[28.2,14.1]:TopTop: p5(x0,x1),p13(x0,f8(c16,c20)) -> p13(x1,f6(f7(c22)))
% 3.68/1.43 === Backtracking. Learning clause 43:3:2:[26.1,14.1]:TopTop: p5(x0,x1),p12(f8(c16,c20),x0) -> p12(f6(f7(c22)),x1)
% 3.68/1.43 === Backtracking. Learning clause 44:3:2:[26.2,14.1]:TopTop: p5(x0,x1),p12(x0,f8(c16,c20)) -> p12(x1,f6(f7(c22)))
% 3.68/1.43 === Backtracking. Learning clause 45:2:1:[22.1,14.1,39.1]:Top: p5(f8(c16,c20),x0) -> p5(x0,f6(f7(c22)))
% 3.68/1.43 === Backtracking. Learning clause 46:2:1:[22.2,16.1]:Top: p5(f8(f3(c16),c23),x0) -> p5(x0,f6(f7(c22)))
% 3.68/1.43 === Clause set with instances from active satisfied. Growing active. New size: 98
% 3.68/1.43 === Restarting.
% 3.68/1.43 === Backtracking. Learning clause 47:6:3:[27.4,29.3]:TopTopTop: p14(x0,c24),p15(x0,x1),p10(x1,c18),p13(x2,c21),p13(c19,x2) -> p5(x2,c20)
% 3.68/1.43 === Backtracking. Learning clause 48:4:3:[33.4,13.1]:TopTopTop: p2(c17,x0),p2(c16,x1),p10(c18,x2) -> p11(x1,x0,x2)
% 3.68/1.43 === Conflict found: 45:2:1:[22.1,14.1,39.1]:Top: p5(f8(c16,c20),x0) -> p5(x0,f6(f7(c22))) {x0 -> c16}
% 3.68/1.43 === Backtracking. Learning clause 49:2:1:[45.1,39.2]:Top: p5(x0,f8(c16,c20)) -> p5(x0,f6(f7(c22)))
% 3.68/1.43 === Backtracking. Learning clause 50:5:2:[22.3,31.3,14.1,22.3]:TopTop: p13(x0,c21),p13(c19,x0),p5(x1,f8(c16,c20)),p5(x1,f8(c17,x0)) -> p5(x0,c20)
% 3.68/1.43 === Backtracking. Learning clause 51:2:1:[22.3,17.1,22.3,3.1]:Top: p5(x0,f6(f7(c22))),p5(x0,f8(f3(c16),c20)) ->
% 3.68/1.43 === Conflict found: 51:2:1:[22.3,17.1,22.3,3.1]:Top: p5(x0,f6(f7(c22))),p5(x0,f8(f3(c16),c20)) -> {x0 -> f8(c16,c20)}
% 3.68/1.43 === Backtracking. Learning clause 52:3:1:[51.2,30.3,14.1,38.2,24.3]:Top: p5(c20,c20),p2(x0,c17),p2(x0,c16) ->
% 3.68/1.43 === Conflict found: 52:3:1:[51.2,30.3,14.1,38.2,24.3]:Top: p5(c20,c20),p2(x0,c17),p2(x0,c16) -> {x0 -> c17}
% 3.68/1.43 === Backtracking. Learning clause 53:2:0:[52.2,5.1]:: p5(c20,c20),p2(c17,c16) ->
% 3.68/1.43 === Backtracking. Learning clause 54:2:2:[24.2,5.1]:TopTop: p2(x0,x1) -> p2(x1,x0)
% 3.68/1.43 === Clause set with instances from active satisfied. Growing active. New size: 106
% 3.68/1.43 === Restarting.
% 3.68/1.43 === Clause set with instances from active satisfied. Growing active. New size: 162
% 3.68/1.43 === Clause set with instances from active satisfied. Growing active. New size: 226
% 3.68/1.43 === Clause set with instances from active satisfied. Growing active. New size: 290
% 3.68/1.43 === Clause set with instances from active satisfied. Growing active. New size: 354
% 3.68/1.43 === Clause set with instances from active satisfied. Growing active. New size: 418
% 3.68/1.43 === Backtracking. Learning clause 55:4:5:[30.3,22.2,54.2,39.2]:TopTopTopTopTop: p5(x0,x1),p2(x2,x3),p5(x4,f8(x3,x0)) -> p5(x4,f8(x2,x1))
% 3.68/1.43 === Conflict found: 46:2:1:[22.2,16.1]:Top: p5(f8(f3(c16),c23),x0) -> p5(x0,f6(f7(c22))) {x0 -> f8(c17,c16)}
% 3.68/1.43 === Backtracking. Learning clause 56:4:1:[46.2,31.3,30.3,54.2,12.1]:Top: p13(x0,c21),p13(c19,x0),p5(c23,x0) -> p5(x0,c20)
% 3.68/1.43 === Conflict found: 56:4:1:[46.2,31.3,30.3,54.2,12.1]:Top: p13(x0,c21),p13(c19,x0),p5(c23,x0) -> p5(x0,c20) {x0 -> c23}
% 3.68/1.43 === Backtracking. Learning clause 57:2:1:[56.1,8.1,22.1,3.1,9.1]:Top: p5(c23,x0) -> p5(c20,x0)
% 3.68/1.43 === Backtracking. Learning clause 58:6:7:[22.1,22.3,55.4,39.2]:TopTopTopTopTopTopTop: p5(x0,x1),p5(x0,x2),p5(x3,x4),p2(x5,x6),p5(f8(x6,x3),x1) -> p5(x2,f8(x5,x4))
% 3.68/1.43 === Conflict found: 51:2:1:[22.3,17.1,22.3,3.1]:Top: p5(x0,f6(f7(c22))),p5(x0,f8(f3(c16),c20)) -> {x0 -> c16}
% 3.68/1.43 === Backtracking. Learning clause 59:6:5:[51.1,46.2,58.6]:TopTopTopTopTop: p5(f8(f3(c16),c23),x0),p5(x1,x2),p5(x1,x0),p5(x3,c20),p2(f3(c16),x4),p5(f8(x4,x3),x2) ->
% 3.68/1.43 === Conflict found: 59:6:5:[51.1,46.2,58.6]:TopTopTopTopTop: p5(f8(f3(c16),c23),x0),p5(x1,x2),p5(x1,x0),p5(x3,c20),p2(f3(c16),x4),p5(f8(x4,x3),x2) -> {x0 -> f6(f7(c22)), x1 -> f8(f3(c16),c23), x2 -> f6(f7(c22)), x3 -> c23, x4 -> f3(c16)}
% 3.68/1.43
% 3.68/1.43 SZS status Unsatisfiable
% 3.68/1.43
% 3.68/1.43 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.68/1.43
% 3.68/1.43 SPASS-SCL-FOL Statistics:
% 3.68/1.43 Number of learned clauses: 26
% 3.68/1.43 Number of propagations: 820
% 3.68/1.43 Number of decisions: 345
% 3.68/1.43 Number of resolutions: 52
% 3.68/1.43 Number of condensations: 0
% 3.68/1.43 Number of sub resolutions: 0
% 3.68/1.43 Number of input literals (deduplicated): 36
% 3.68/1.43 Number of grows: 7
% 3.68/1.43 Number of considered ground atoms: 418
% 3.68/1.43
% 3.68/1.43 Needed: 0:00:00.81
% 3.68/1.43
%------------------------------------------------------------------------------