%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYO683-1 : TPTP v9.2.1. Released v7.3.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n021.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:41:17 PM UTC 2026
% Result : Unsatisfiable 0.51s 0.62s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYO683-1 : TPTP v9.2.1. Released v7.3.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.34 % Computer : n021.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Thu May 7 13:56:58 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.34 SPASS-SCL-FOL version:
% 0.19/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.51/0.62 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.51/0.62 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.51/0.62 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.51/0.62 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.51/0.62 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.51/0.62 Execution resolution_2 ended with status: unsatisfiable
% 0.51/0.62 Used heuristic: resolution_2
% 0.51/0.62
% 0.51/0.62 Input Clauses:
% 0.51/0.62
% 0.51/0.62 Predicates: 'E' iLEQ 'LE'
% 0.51/0.62 Fol Constants: '0' z
% 0.51/0.62 Fol Functions: f suc s
% 0.51/0.62 Problem Properties:
% 0.51/0.62 This is a full first-order problem without equality.
% 0.51/0.62
% 0.51/0.62 After reduction: Problem Properties:
% 0.51/0.62 This is a full first-order problem without equality.
% 0.51/0.62
% 0.51/0.62
% 0.51/0.62 Reduced Input Clauses:
% 0.51/0.62 19:2:1:[3.0,12.0]:Top: -> 'E'(s(s(s('0'))),f(x0)),'LE'(f(x0),s(s(s('0'))))
% 0.51/0.62
% 0.51/0.62 Most General Atoms: 'LE'(f(x0),s(s(s(s('0'))))) 'E'(s(s(s('0'))),f(x4)) 'LE'(f(x0),s(s('0'))) 'LE'(f(x0),s(s(s('0')))) 'LE'(f(x0),'0') 'E'(s(s('0')),f(x2)) 'LE'(f(x0),s('0')) 'E'('0',f(x4)) 'E'(s('0'),f(x3)) iLEQ(suc(x2),suc(x4))
% 0.51/0.62
% 0.51/0.62 === Starting SPASS-SCL-FOL A Little Less Naive, considering 58 atoms initially, heuristics mode: resolution_2 ===
% 0.51/0.62
% 0.51/0.62 === Backtracking. Learning clause 20:2:1:[18.8,2.3]:Top: 'E'(s('0'),f(x0)),'E'(s('0'),f(suc(x0))) ->
% 0.51/0.62 === Backtracking. Learning clause 21:2:1:[11.3,4.3]:Top: 'E'(s(s('0')),f(x0)),'E'(s(s('0')),f(suc(x0))) ->
% 0.51/0.62 === Clause set with instances from active satisfied. Growing active. New size: 58
% 0.51/0.62 === Restarting.
% 0.51/0.62 === Backtracking. Learning clause 22:2:1:[8.1,3.1]:Top: -> 'E'(s(s(s('0'))),f(suc(x0))),'LE'(f(x0),s(s(s('0'))))
% 0.51/0.62 === Clause set with instances from active satisfied. Growing active. New size: 58
% 0.51/0.62 === Restarting.
% 0.51/0.62 === Backtracking. Learning clause 23:2:0:[17.3,9.1]:: 'LE'(f(z),s('0')) -> 'E'('0',f(z))
% 0.51/0.62 === Backtracking. Learning clause 24:2:0:[10.3,9.1]:: 'LE'(f(suc(z)),s('0')) -> 'E'('0',f(suc(z)))
% 0.51/0.62 === Backtracking. Learning clause 25:1:1:[5.3,13.3,22.1,19.1]:Top: -> 'LE'(f(x0),s(s(s('0'))))
% 0.51/0.62 === Clause set with instances from active satisfied. Growing active. New size: 58
% 0.51/0.62 === Restarting.
% 0.51/0.62 === Backtracking. Learning clause 26:2:1:[6.1,25.1]:Top: -> 'E'(s(s('0')),f(suc(x0))),'LE'(f(x0),s(s('0')))
% 0.51/0.62 === Backtracking. Learning clause 27:2:1:[16.9,1.3]:Top: 'E'('0',f(x0)),'E'('0',f(suc(x0))) ->
% 0.51/0.62 === Clause set with instances from active satisfied. Growing active. New size: 58
% 0.51/0.62 === Restarting.
% 0.51/0.62 === Backtracking. Learning clause 28:2:1:[7.1,25.1]:Top: -> 'E'(s(s('0')),f(x0)),'LE'(f(x0),s(s('0')))
% 0.51/0.62 === Conflict found: 20:2:1:[18.8,2.3]:Top: 'E'(s('0'),f(x0)),'E'(s('0'),f(suc(x0))) -> {x0 -> z}
% 0.51/0.62 === Backtracking. Learning clause 29:3:1:[20.1,15.2,14.2,6.3,7.3,21.2]:Top: 'LE'(f(suc(x0)),s(s(s('0')))),'E'(s(s('0')),f(x0)) -> 'LE'(f(x0),s('0'))
% 0.51/0.62 === Conflict found: 27:2:1:[16.9,1.3]:Top: 'E'('0',f(x0)),'E'('0',f(suc(x0))) -> {x0 -> '0'}
% 0.51/0.62 === Backtracking. Learning clause 30:3:1:[27.1,17.2,10.2]:Top: 'LE'(f(x0),s('0')),'LE'(f(suc(x0)),s('0')) -> 'LE'(f(x0),'0')
% 0.51/0.62 === Conflict found: 28:2:1:[7.1,25.1]:Top: -> 'E'(s(s('0')),f(x0)),'LE'(f(x0),s(s('0'))) {x0 -> f('0')}
% 0.51/0.62 === Backtracking. Learning clause 31:3:1:[28.1,29.2,15.1]:Top: 'LE'(f(suc(x0)),s(s(s('0')))) -> 'E'(s('0'),f(x0)),'LE'(f(x0),s('0'))
% 0.51/0.62 === Conflict found: 20:2:1:[18.8,2.3]:Top: 'E'(s('0'),f(x0)),'E'(s('0'),f(suc(x0))) -> {x0 -> '0'}
% 0.51/0.62 === Backtracking. Learning clause 32:4:1:[20.1,31.2,14.2,17.1]:Top: 'LE'(f(suc(x0)),s(s(s('0')))),'LE'(f(suc(x0)),s(s('0'))) -> 'E'('0',f(x0)),'LE'(f(x0),'0')
% 0.51/0.62 === Backtracking. Learning clause 33:4:1:[15.3,10.1]:Top: 'LE'(f(suc(x0)),s(s('0'))) -> 'E'(s('0'),f(suc(x0))),'E'('0',f(suc(x0))),'LE'(f(x0),'0')
% 0.51/0.62 === Clause set with instances from active satisfied. Growing active. New size: 122
% 0.51/0.62 === Conflict found: 31:3:1:[28.1,29.2,15.1]:Top: 'LE'(f(suc(x0)),s(s(s('0')))) -> 'E'(s('0'),f(x0)),'LE'(f(x0),s('0')) {x0 -> suc(z)}
% 0.51/0.62 === Backtracking. Learning clause 34:2:0:[31.1,25.1,24.1]:: -> 'E'(s('0'),f(suc(z))),'E'('0',f(suc(z)))
% 0.51/0.62 === Conflict found: 21:2:1:[11.3,4.3]:Top: 'E'(s(s('0')),f(x0)),'E'(s(s('0')),f(suc(x0))) -> {x0 -> suc(z)}
% 0.51/0.62 === Backtracking. Learning clause 35:2:1:[21.2,26.1,28.1,32.2,25.1]:Top: -> 'E'('0',f(x0)),'LE'(f(x0),'0')
% 0.51/0.62 === Conflict found: 21:2:1:[11.3,4.3]:Top: 'E'(s(s('0')),f(x0)),'E'(s(s('0')),f(suc(x0))) -> {x0 -> suc(f('0'))}
% 0.51/0.62 === Backtracking. Learning clause 36:2:1:[21.2,26.1,28.1,14.1,20.2,15.2]:Top: 'LE'(f(x0),s(s('0'))) -> 'LE'(f(x0),s('0'))
% 0.51/0.62 === Conflict found: 21:2:1:[11.3,4.3]:Top: 'E'(s(s('0')),f(x0)),'E'(s(s('0')),f(suc(x0))) -> {x0 -> suc(z)}
% 0.51/0.62
% 0.51/0.62 SZS status Unsatisfiable
% 0.51/0.62
% 0.51/0.62 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.51/0.62
% 0.51/0.62 SPASS-SCL-FOL Statistics:
% 0.51/0.62 Number of learned clauses: 17
% 0.51/0.62 Number of propagations: 372
% 0.51/0.62 Number of decisions: 208
% 0.51/0.62 Number of resolutions: 42
% 0.51/0.62 Number of condensations: 0
% 0.51/0.62 Number of sub resolutions: 1
% 0.51/0.62 Number of input literals (deduplicated): 20
% 0.51/0.62 Number of grows: 5
% 0.51/0.62 Number of considered ground atoms: 122
% 0.51/0.62
% 0.51/0.62 Needed: 0:00:00.09
% 0.51/0.62
%------------------------------------------------------------------------------