%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN558-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 : n017.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:01 PM UTC 2026
% Result : Unsatisfiable 0.40s 0.66s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN558-1 : TPTP v9.2.1. Released v2.5.0.
% 0.00/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.34 % Computer : n017.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Thu May 7 13:44:28 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 SPASS-SCL-FOL version:
% 0.21/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.40/0.66 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.66 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.66 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.66 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.66 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.66 Execution resolution_3 ended with status: unsatisfiable
% 0.40/0.66 Used heuristic: resolution_3
% 0.40/0.66
% 0.40/0.66 Input Clauses:
% 0.40/0.66
% 0.40/0.66 Predicates: p2 p4 p6 p5
% 0.40/0.66 Fol Constants: c7 c10 c9 c8
% 0.40/0.66 Fol Functions: f3
% 0.40/0.66 Problem Properties:
% 0.40/0.66 This is a full first-order problem without equality.
% 0.40/0.66
% 0.40/0.66 After reduction: Problem Properties:
% 0.40/0.66 This is a full first-order problem without equality.
% 0.40/0.66
% 0.40/0.66
% 0.40/0.66 Reduced Input Clauses:
% 0.40/0.66
% 0.40/0.66 Most General Atoms: p6(x1,x3) p2(x1,x0) p4(x4,x5) p5(x5,x1,x3)
% 0.40/0.66
% 0.40/0.66 === Starting SPASS-SCL-FOL A Little Less Naive, considering 26 atoms initially, heuristics mode: resolution_3 ===
% 0.40/0.66
% 0.40/0.66 === Backtracking. Learning clause 15:3:3:[12.2,3.1]:TopTopTop: p4(c7,x0),p2(f3(x1),x2) -> p6(x0,x2)
% 0.40/0.66 === Backtracking. Learning clause 16:2:1:[11.2,4.1]:Top: p5(c7,x0,c10) -> p5(c7,x0,c9)
% 0.40/0.66 === Backtracking. Learning clause 17:2:1:[11.2,5.1]:Top: p5(c7,x0,c10) -> p5(c7,x0,c8)
% 0.40/0.66 === Backtracking. Learning clause 18:1:0:[8.1,6.1]:: p5(c7,c9,f3(c8)) ->
% 0.40/0.66 === Clause set with instances from active satisfied. Growing active. New size: 33
% 0.40/0.66 === Restarting.
% 0.40/0.66 === Backtracking. Learning clause 19:5:4:[11.3,18.1,14.5]:TopTopTopTop: p5(c7,c9,x0),p2(x1,x0),p2(x2,f3(c8)),p4(x3,c7),p5(x3,x1,x2) ->
% 0.40/0.66 === Backtracking. Learning clause 20:1:0:[11.2,6.1,18.1]:: p5(c7,c9,c8) ->
% 0.40/0.66 === Backtracking. Learning clause 21:4:3:[11.3,8.1,11.3]:TopTopTop: p5(c7,x0,x1),p5(c7,c9,x1),p5(c7,c8,x2),p5(c7,x2,x0) ->
% 0.40/0.66 === Clause set with instances from active satisfied. Growing active. New size: 38
% 0.40/0.66 === Restarting.
% 0.40/0.66 === Conflict found: 19:5:4:[11.3,18.1,14.5]:TopTopTopTop: p5(c7,c9,x0),p2(x1,x0),p2(x2,f3(c8)),p4(x3,c7),p5(x3,x1,x2) -> {x0 -> f3(c9), x1 -> c7, x2 -> f3(c7), x3 -> c7}
% 0.40/0.66 === Backtracking. Learning clause 22:3:1:[19.1,6.1,6.1]:Top: p2(x0,f3(c9)),p2(f3(x0),f3(c8)),p4(c7,c7) ->
% 0.40/0.66 === Conflict found: 19:5:4:[11.3,18.1,14.5]:TopTopTopTop: p5(c7,c9,x0),p2(x1,x0),p2(x2,f3(c8)),p4(x3,c7),p5(x3,x1,x2) -> {x0 -> f3(c9), x1 -> c7, x2 -> c7, x3 -> c7}
% 0.40/0.66 === Backtracking. Learning clause 23:4:3:[19.1,6.1]:TopTopTop: p2(x0,f3(c9)),p2(x1,f3(c8)),p4(x2,c7),p5(x2,x0,x1) ->
% 0.40/0.66 === Backtracking. Learning clause 24:2:1:[11.3,20.1]:Top: p5(c7,c9,x0),p5(c7,x0,c8) ->
% 0.40/0.66 === Clause set with instances from active satisfied. Growing active. New size: 43
% 0.40/0.66 === Restarting.
% 0.40/0.66 === Conflict found: 23:4:3:[19.1,6.1]:TopTopTop: p2(x0,f3(c9)),p2(x1,f3(c8)),p4(x2,c7),p5(x2,x0,x1) -> {x0 -> c10, x1 -> c9, x2 -> c7}
% 0.40/0.66 === Backtracking. Learning clause 25:3:0:[23.4,4.1]:: p2(c10,f3(c9)),p2(c9,f3(c8)),p4(c7,c7) ->
% 0.40/0.66 === Conflict found: 23:4:3:[19.1,6.1]:TopTopTop: p2(x0,f3(c9)),p2(x1,f3(c8)),p4(x2,c7),p5(x2,x0,x1) -> {x0 -> c10, x1 -> c8, x2 -> c7}
% 0.40/0.66 === Backtracking. Learning clause 26:3:0:[23.4,5.1]:: p2(c10,f3(c9)),p2(c8,f3(c8)),p4(c7,c7) ->
% 0.40/0.66 === Conflict found: 22:3:1:[19.1,6.1,6.1]:Top: p2(x0,f3(c9)),p2(f3(x0),f3(c8)),p4(c7,c7) -> {x0 -> c8}
% 0.40/0.66 === Backtracking. Learning clause 27:2:0:[22.2,1.1]:: p2(c8,f3(c9)),p4(c7,c7) ->
% 0.40/0.66 === Clause set with instances from active satisfied. Growing active. New size: 107
% 0.40/0.66 === Backtracking. Learning clause 28:3:2:[14.2,1.1,4.1]:TopTop: p2(c10,x0),p4(c7,x1) -> p5(x1,x0,c9)
% 0.40/0.66 === Backtracking. Learning clause 29:1:1:[13.3,11.3,14.2,13.3,3.1,11.3,3.1,3.1,14.2,6.1,6.1,1.1,5.1,18.1,28.3,6.1,2.1]:Top: p2(c10,x0) ->
% 0.40/0.66 === Conflict found: 29:1:1:[13.3,11.3,14.2,13.3,3.1,11.3,3.1,3.1,14.2,6.1,6.1,1.1,5.1,18.1,28.3,6.1,2.1]:Top: p2(c10,x0) -> {x0 -> c10}
% 0.40/0.66
% 0.40/0.66 SZS status Unsatisfiable
% 0.40/0.66
% 0.40/0.66 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.66
% 0.40/0.66 SPASS-SCL-FOL Statistics:
% 0.40/0.66 Number of learned clauses: 15
% 0.40/0.66 Number of propagations: 307
% 0.40/0.66 Number of decisions: 137
% 0.40/0.66 Number of resolutions: 36
% 0.40/0.66 Number of condensations: 0
% 0.40/0.66 Number of sub resolutions: 0
% 0.40/0.66 Number of input literals (deduplicated): 15
% 0.40/0.66 Number of grows: 4
% 0.40/0.66 Number of considered ground atoms: 107
% 0.40/0.66
% 0.40/0.66 Needed: 0:00:00.07
% 0.40/0.66
%------------------------------------------------------------------------------