%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN586-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 : n001.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.77s 1.40s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN586-1 : TPTP v9.2.1. Released v2.5.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.34 % Computer : n001.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:46:19 EDT 2026
% 0.18/0.34 % CPUTime :
% 0.18/0.34 SPASS-SCL-FOL version:
% 0.20/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 3.77/1.40 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.77/1.40 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.77/1.40 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.77/1.40 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.77/1.40 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.77/1.40 Execution resolution_2 ended with status: unsatisfiable
% 3.77/1.40 Used heuristic: resolution_2
% 3.77/1.40
% 3.77/1.40 Input Clauses:
% 3.77/1.40
% 3.77/1.40 Predicates: p12 p5 p3 p2 p15
% 3.77/1.40 Fol Constants: c21 c19 c20 c18 c16 c17
% 3.77/1.40 Fol Functions: f13 f7 f10 f9 f8 f11 f6 f4 f14
% 3.77/1.40 Problem Properties:
% 3.77/1.40 This is a full first-order problem without equality.
% 3.77/1.40
% 3.77/1.40 After reduction: Problem Properties:
% 3.77/1.40 This is a full first-order problem without equality.
% 3.77/1.40
% 3.77/1.40
% 3.77/1.40 Reduced Input Clauses:
% 3.77/1.40
% 3.77/1.40 Most General Atoms: p12(x1,x2) p2(x2,x3) p15(x1,x3) p5(x2,x3) p3(x1,x3)
% 3.77/1.40
% 3.77/1.40 === Starting SPASS-SCL-FOL A Little Less Naive, considering 51 atoms initially, heuristics mode: resolution_2 ===
% 3.77/1.40
% 3.77/1.40 === Clause set with instances from active satisfied. Growing active. New size: 51
% 3.77/1.40 === Restarting.
% 3.77/1.40 === Clause set with instances from active satisfied. Growing active. New size: 51
% 3.77/1.40 === Restarting.
% 3.77/1.40 === Backtracking. Learning clause 27:1:0:[8.1,5.1]:: -> p5(f7(c21),f7(c19))
% 3.77/1.40 === Clause set with instances from active satisfied. Growing active. New size: 51
% 3.77/1.40 === Restarting.
% 3.77/1.40 === Backtracking. Learning clause 28:1:0:[12.1,5.1]:: -> p3(f11(c21),f11(c19))
% 3.77/1.40 === Clause set with instances from active satisfied. Growing active. New size: 51
% 3.77/1.40 === Restarting.
% 3.77/1.40 === Backtracking. Learning clause 29:2:2:[20.2,5.1]:TopTop: p2(x0,x1) -> p2(f4(x0,c21),f4(x1,c19))
% 3.77/1.40 === Clause set with instances from active satisfied. Growing active. New size: 115
% 3.77/1.40 === Clause set with instances from active satisfied. Growing active. New size: 120
% 3.77/1.40 === Restarting.
% 3.77/1.40 === Backtracking. Learning clause 30:2:1:[13.3,6.1]:Top: p12(x0,f13(c20)),p12(x0,f13(c18)) ->
% 3.77/1.40 === Backtracking. Learning clause 31:1:1:[25.2,6.1]:Top: p15(f4(f6(f10(x0),f6(f7(f8(f9(c17))),c18)),f11(f14(c20,x0))),c20) ->
% 3.77/1.40 === Clause set with instances from active satisfied. Growing active. New size: 123
% 3.77/1.40 === Restarting.
% 3.77/1.40 === Backtracking. Learning clause 32: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.77/1.40 === Clause set with instances from active satisfied. Growing active. New size: 126
% 3.77/1.40 === Restarting.
% 3.77/1.40 === Backtracking. Learning clause 33:3:2:[17.3,22.1]:TopTop: p2(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c21)),x0),p2(c20,x1) -> p15(x0,x1)
% 3.77/1.40 === Backtracking. Learning clause 34:2:3:[20.2,3.1]:TopTopTop: p2(x0,x1) -> p2(f4(x0,x2),f4(x1,x2))
% 3.77/1.40 === Clause set with instances from active satisfied. Growing active. New size: 129
% 3.77/1.40 === Restarting.
% 3.77/1.40 === Backtracking. Learning clause 35: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.77/1.40 === Conflict found: 32: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)),f11(c19)), x1 -> c20}
% 3.77/1.40 === Backtracking. Learning clause 36:1:0:[32.3,23.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)),f11(c19))) ->
% 3.77/1.40 === Clause set with instances from active satisfied. Growing active. New size: 193
% 3.77/1.40 === Clause set with instances from active satisfied. Growing active. New size: 195
% 3.77/1.40 === Restarting.
% 3.77/1.40 === Backtracking. Learning clause 37:2:2:[21.2,27.1]:TopTop: p2(x0,x1) -> p2(f6(f7(c21),x0),f6(f7(c19),x1))
% 3.77/1.40 === Backtracking. Learning clause 38:2:1:[14.1,27.1]:Top: p5(f7(c21),x0) -> p5(f7(c19),x0)
% 3.77/1.40 === Backtracking. Learning clause 39:1:0:[9.1,27.1]:: -> p5(f10(f7(c21)),f10(f7(c19)))
% 3.77/1.40 === Clause set with instances from active satisfied. Growing active. New size: 196
% 3.77/1.40 === Restarting.
% 3.77/1.40 === Backtracking. Learning clause 40:2:2:[20.2,28.1]:TopTop: p2(x0,x1) -> p2(f4(x0,f11(c21)),f4(x1,f11(c19)))
% 3.77/1.40 === Backtracking. Learning clause 41:2:1:[15.1,28.1]:Top: p3(f11(c21),x0) -> p3(f11(c19),x0)
% 3.77/1.40 === Backtracking. Learning clause 42:1:0:[10.1,28.1]:: -> p3(f9(f11(c21)),f9(f11(c19)))
% 3.77/1.40 === Clause set with instances from active satisfied. Growing active. New size: 198
% 3.77/1.40 === Restarting.
% 3.77/1.40 === Backtracking. Learning clause 43:3:3:[17.4,31.1]:TopTopTop: p2(x0,f4(f6(f10(x1),f6(f7(f8(f9(c17))),c18)),f11(f14(c20,x1)))),p2(x2,c20),p15(x0,x2) ->
% 3.77/1.40 === Conflict found: 33:3:2:[17.3,22.1]:TopTop: p2(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c21)),x0),p2(c20,x1) -> p15(x0,x1) {x0 -> f4(f6(f10(c21),f6(f7(f8(f9(c17))),c18)),f11(f14(c20,c21))), x1 -> c20}
% 3.77/1.40 === Backtracking. Learning clause 44:1:1:[33.3,31.1,4.1]:Top: p2(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c21)),f4(f6(f10(x0),f6(f7(f8(f9(c17))),c18)),f11(f14(c20,x0)))) ->
% 3.77/1.40 === Clause set with instances from active satisfied. Growing active. New size: 201
% 3.77/1.40 === Restarting.
% 3.77/1.40 === Backtracking. Learning clause 45:2:0:[20.3,36.1]:: p2(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f6(f10(c16),f6(f7(f8(f9(c17))),c18))),p3(c19,f11(c19)) ->
% 3.77/1.40 === Backtracking. Learning clause 46:2:1:[16.3,36.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)),f11(c19))) ->
% 3.77/1.40 === Backtracking. Learning clause 47:2:2:[16.2,4.1]:TopTop: p2(x0,x1) -> p2(x1,x0)
% 3.77/1.40 === Conflict found: 40:2:2:[20.2,28.1]:TopTop: p2(x0,x1) -> p2(f4(x0,f11(c21)),f4(x1,f11(c19))) {x0 -> f6(f10(c16),f6(f7(f8(f9(c17))),c18)), x1 -> f6(f10(c16),f6(f7(f8(f9(c17))),c18))}
% 3.77/1.40
% 3.77/1.40 SZS status Unsatisfiable
% 3.77/1.40
% 3.77/1.40 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.77/1.40
% 3.77/1.40 SPASS-SCL-FOL Statistics:
% 3.77/1.40 Number of learned clauses: 21
% 3.77/1.40 Number of propagations: 1260
% 3.77/1.40 Number of decisions: 517
% 3.77/1.40 Number of resolutions: 27
% 3.77/1.40 Number of condensations: 0
% 3.77/1.40 Number of sub resolutions: 0
% 3.77/1.40 Number of input literals (deduplicated): 28
% 3.77/1.40 Number of grows: 14
% 3.77/1.40 Number of considered ground atoms: 201
% 3.77/1.40
% 3.77/1.40 Needed: 0:00:00.85
% 3.77/1.40
%------------------------------------------------------------------------------