%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN587-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 : n028.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.35s 1.18s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN587-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.17/0.34 % Computer : n028.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Thu May 7 13:45:46 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 SPASS-SCL-FOL version:
% 0.21/0.44 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 3.35/1.18 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.35/1.18 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.35/1.18 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.35/1.18 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.35/1.18 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.35/1.18 Execution resolution_2 ended with status: unsatisfiable
% 3.35/1.18 Used heuristic: resolution_2
% 3.35/1.18
% 3.35/1.18 Input Clauses:
% 3.35/1.18
% 3.35/1.18 Predicates: p12 p5 p3 p2 p15
% 3.35/1.18 Fol Constants: c21 c19 c20 c18 c16 c17
% 3.35/1.18 Fol Functions: f13 f7 f10 f9 f8 f11 f6 f4 f14
% 3.35/1.18 Problem Properties:
% 3.35/1.18 This is a full first-order problem without equality.
% 3.35/1.18
% 3.35/1.18 After reduction: Problem Properties:
% 3.35/1.18 This is a full first-order problem without equality.
% 3.35/1.18
% 3.35/1.18
% 3.35/1.18 Reduced Input Clauses:
% 3.35/1.18
% 3.35/1.18 Most General Atoms: p12(x1,x2) p2(x2,x3) p15(x1,x3) p5(x2,x3) p3(x1,x3)
% 3.35/1.18
% 3.35/1.18 === Starting SPASS-SCL-FOL A Little Less Naive, considering 51 atoms initially, heuristics mode: resolution_2 ===
% 3.35/1.18
% 3.35/1.18 === Clause set with instances from active satisfied. Growing active. New size: 51
% 3.35/1.18 === Restarting.
% 3.35/1.18 === Backtracking. Learning clause 27:3:3:[13.2,24.1]:TopTopTop: p12(f13(x0),x1) -> p12(x1,f13(c18)),p15(f4(f6(f10(x2),f6(f7(f8(f9(c17))),c18)),f14(x0,x2)),x0)
% 3.35/1.18 === Clause set with instances from active satisfied. Growing active. New size: 51
% 3.35/1.18 === Restarting.
% 3.35/1.18 === Backtracking. Learning clause 28:2:2:[20.2,5.1]:TopTop: p2(x0,x1) -> p2(f4(x0,c21),f4(x1,c19))
% 3.35/1.18 === Clause set with instances from active satisfied. Growing active. New size: 51
% 3.35/1.18 === Restarting.
% 3.35/1.18 === Clause set with instances from active satisfied. Growing active. New size: 51
% 3.35/1.18 === Restarting.
% 3.35/1.18 === Conflict found: 28:2:2:[20.2,5.1]:TopTop: p2(x0,x1) -> p2(f4(x0,c21),f4(x1,c19)) {x0 -> c21, x1 -> c21}
% 3.35/1.18 === Backtracking. Learning clause 29:1:1:[28.1,4.1]:Top: -> p2(f4(x0,c21),f4(x0,c19))
% 3.35/1.18 === Clause set with instances from active satisfied. Growing active. New size: 115
% 3.35/1.18 === Clause set with instances from active satisfied. Growing active. New size: 119
% 3.35/1.18 === Restarting.
% 3.35/1.18 === Backtracking. Learning clause 30:1:1:[24.1,6.1]:Top: -> p15(f4(f6(f10(x0),f6(f7(f8(f9(c17))),c18)),f14(c20,x0)),c20)
% 3.35/1.18 === Clause set with instances from active satisfied. Growing active. New size: 122
% 3.35/1.18 === Restarting.
% 3.35/1.18 === Backtracking. Learning clause 31:3:2:[17.3,18.1]:TopTop: p2(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),x0),p2(c20,x1) -> p15(x0,x1)
% 3.35/1.18 === Clause set with instances from active satisfied. Growing active. New size: 124
% 3.35/1.18 === Restarting.
% 3.35/1.18 === Backtracking. Learning clause 32:3:2:[17.4,19.1]:TopTop: p2(x0,f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c21)),p2(x1,c20),p15(x0,x1) ->
% 3.35/1.18 === Conflict found: 31:3:2:[17.3,18.1]:TopTop: p2(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),x0),p2(c20,x1) -> p15(x0,x1) {x0 -> f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c21), x1 -> c20}
% 3.35/1.18 === Backtracking. Learning clause 33:1:0:[31.3,19.1,4.1]:: p2(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c21)) ->
% 3.35/1.18 === Clause set with instances from active satisfied. Growing active. New size: 126
% 3.35/1.18 === Restarting.
% 3.35/1.18 === Backtracking. Learning clause 34:3:2:[17.4,23.1]:TopTop: p2(x0,f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19))),p2(x1,c20),p15(x0,x1) ->
% 3.35/1.18 === Conflict found: 34:3:2:[17.4,23.1]:TopTop: p2(x0,f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19))),p2(x1,c20),p15(x0,x1) -> {x0 -> f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19), x1 -> c20}
% 3.35/1.18 === Backtracking. Learning clause 35:2:1:[34.2,4.1]:Top: p2(x0,f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19))),p15(x0,c20) ->
% 3.35/1.18 === Clause set with instances from active satisfied. Growing active. New size: 190
% 3.35/1.18 === Clause set with instances from active satisfied. Growing active. New size: 194
% 3.35/1.18 === Restarting.
% 3.35/1.18 === Backtracking. Learning clause 36:3:3:[17.1,29.1]:TopTopTop: p2(x0,x1),p15(f4(x2,c21),x0) -> p15(f4(x2,c19),x1)
% 3.35/1.18 === Backtracking. Learning clause 37:2:3:[22.1,29.1]:TopTopTop: p5(x0,x1) -> p2(f6(x0,f4(x2,c21)),f6(x1,f4(x2,c19)))
% 3.35/1.18 === Backtracking. Learning clause 38:2:3:[20.1,29.1]:TopTopTop: p3(x0,x1) -> p2(f4(f4(x2,c21),x0),f4(f4(x2,c19),x1))
% 3.35/1.18 === Backtracking. Learning clause 39:2:2:[16.1,29.1]:TopTop: p2(f4(x0,c21),x1) -> p2(f4(x0,c19),x1)
% 3.35/1.18 === Backtracking. Learning clause 40:1:1:[7.1,29.1]:Top: -> p12(f13(f4(x0,c21)),f13(f4(x0,c19)))
% 3.35/1.18 === Clause set with instances from active satisfied. Growing active. New size: 196
% 3.35/1.18 === Restarting.
% 3.35/1.18 === Backtracking. Learning clause 41:3:3:[17.3,30.1]:TopTopTop: p2(f4(f6(f10(x0),f6(f7(f8(f9(c17))),c18)),f14(c20,x0)),x1),p2(c20,x2) -> p15(x1,x2)
% 3.35/1.18 === Conflict found: 34:3:2:[17.4,23.1]:TopTop: p2(x0,f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19))),p2(x1,c20),p15(x0,x1) -> {x0 -> f4(f6(f10(c21),f6(f7(f8(f9(c17))),c18)),f14(c20,c21)), x1 -> c20}
% 3.35/1.18 === Backtracking. Learning clause 42:1:1:[34.3,30.1,4.1]:Top: p2(f4(f6(f10(x0),f6(f7(f8(f9(c17))),c18)),f14(c20,x0)),f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19))) ->
% 3.35/1.18 === Clause set with instances from active satisfied. Growing active. New size: 199
% 3.35/1.18 === Restarting.
% 3.35/1.18 === Backtracking. Learning clause 43:2:0:[20.3,33.1]:: p2(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f6(f10(c16),f6(f7(f8(f9(c17))),c18))),p3(c19,c21) ->
% 3.35/1.18 === Backtracking. Learning clause 44:2:1:[16.3,33.1]:Top: p2(x0,f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19)),p2(x0,f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c21)) ->
% 3.35/1.18 === Conflict found: 39:2:2:[16.1,29.1]:TopTop: p2(f4(x0,c21),x1) -> p2(f4(x0,c19),x1) {x0 -> f6(f10(c16),f6(f7(f8(f9(c17))),c18)), x1 -> f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c21)}
% 3.35/1.18
% 3.35/1.18 SZS status Unsatisfiable
% 3.35/1.18
% 3.35/1.18 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.35/1.18
% 3.35/1.18 SPASS-SCL-FOL Statistics:
% 3.35/1.18 Number of learned clauses: 18
% 3.35/1.18 Number of propagations: 924
% 3.35/1.18 Number of decisions: 465
% 3.35/1.18 Number of resolutions: 22
% 3.35/1.18 Number of condensations: 0
% 3.35/1.18 Number of sub resolutions: 0
% 3.35/1.18 Number of input literals (deduplicated): 28
% 3.35/1.18 Number of grows: 13
% 3.35/1.18 Number of considered ground atoms: 199
% 3.35/1.18
% 3.35/1.18 Needed: 0:00:00.64
% 3.35/1.18
%------------------------------------------------------------------------------