%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYO674-1 : TPTP v9.2.1. Released v7.3.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n010.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:16 PM UTC 2026
% Result : Unsatisfiable 2.10s 0.99s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO674-1 : TPTP v9.2.1. Released v7.3.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.34 % Computer : n010.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:55:52 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.34 SPASS-SCL-FOL version:
% 0.19/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 2.10/0.99 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.10/0.99 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.10/0.99 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.10/0.99 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.10/0.99 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.10/0.99 Execution resolution_1 ended with status: unsatisfiable
% 2.10/0.99 Used heuristic: resolution_1
% 2.10/0.99
% 2.10/0.99 Input Clauses:
% 2.10/0.99
% 2.10/0.99 Predicates: 'E' iLEQ 'LE'
% 2.10/0.99 Fol Constants: '0' z
% 2.10/0.99 Fol Functions: s suc f
% 2.10/0.99 Problem Properties:
% 2.10/0.99 This is a full first-order problem without equality.
% 2.10/0.99
% 2.10/0.99 After reduction: Problem Properties:
% 2.10/0.99 This is a full first-order problem without equality.
% 2.10/0.99
% 2.10/0.99
% 2.10/0.99 Reduced Input Clauses:
% 2.10/0.99 15:2:1:[7.0,5.0]:Top: -> 'E'(s(s('0')),f(x0)),'LE'(f(x0),s(s('0')))
% 2.10/0.99
% 2.10/0.99 Most General Atoms: 'E'(s('0'),f(x5)) 'LE'(f(x0),s(s('0'))) 'LE'(f(x0),s('0')) 'LE'(f(x0),'0') 'LE'(f(x0),s(s(s('0')))) 'E'(s(s('0')),f(x4)) iLEQ(suc(x2),suc(x5)) 'E'('0',f(x2))
% 2.10/0.99
% 2.10/0.99 === Starting SPASS-SCL-FOL A Little Less Naive, considering 11 atoms initially, heuristics mode: resolution_1 ===
% 2.10/0.99
% 2.10/0.99 === Backtracking. Learning clause 16:2:1:[14.1,3.3]:Top: 'E'('0',f(x0)),'E'('0',f(suc(x0))) ->
% 2.10/0.99 === Conflict found: 15:2:1:[7.0,5.0]:Top: -> 'E'(s(s('0')),f(x0)),'LE'(f(x0),s(s('0'))) {x0 -> '0'}
% 2.10/0.99 === Backtracking. Learning clause 17:3:1:[15.2,2.1]:Top: -> 'E'(s(s('0')),f(x0)),'E'(s('0'),f(x0)),'LE'(f(x0),s('0'))
% 2.10/0.99 === Conflict found: 15:2:1:[7.0,5.0]:Top: -> 'E'(s(s('0')),f(x0)),'LE'(f(x0),s(s('0'))) {x0 -> suc('0')}
% 2.10/0.99 === Backtracking. Learning clause 18:4:1:[15.2,12.1,10.2,17.1]:Top: iLEQ(suc(x0),suc(x0)) -> 'E'(s('0'),f(suc(x0))),'E'(s('0'),f(x0)),'LE'(f(x0),s('0'))
% 2.10/0.99 === Backtracking. Learning clause 19:3:1:[9.1,7.1,10.2,2.1,17.1]:Top: iLEQ(suc(x0),suc(x0)) -> 'E'(s('0'),f(x0)),'LE'(f(x0),s('0'))
% 2.10/0.99 === Clause set with instances from active satisfied. Growing active. New size: 13
% 2.10/0.99 === Restarting.
% 2.10/0.99 === Conflict found: 15:2:1:[7.0,5.0]:Top: -> 'E'(s(s('0')),f(x0)),'LE'(f(x0),s(s('0'))) {x0 -> suc('0')}
% 2.10/0.99 === Backtracking. Learning clause 21:3:1:[18.0,20.1,15.2,12.1,6.2,17.1]:Top: -> 'E'(s('0'),f(suc(x0))),'E'(s('0'),f(x0)),'LE'(f(x0),s('0'))
% 2.10/0.99 === Backtracking. Learning clause 22:4:1:[9.1,7.1,6.2,2.1,17.1,4.1]:Top: -> iLEQ(suc(x0),suc(x0)),'E'(s('0'),f(x0)),'E'('0',f(x0)),'LE'(f(x0),'0')
% 2.10/0.99 === Conflict found: 19:3:1:[9.1,7.1,10.2,2.1,17.1]:Top: iLEQ(suc(x0),suc(x0)) -> 'E'(s('0'),f(x0)),'LE'(f(x0),s('0')) {x0 -> '0'}
% 2.10/0.99 === Backtracking. Learning clause 23:3:1:[19.3,4.1,22.1]:Top: -> 'E'(s('0'),f(x0)),'E'('0',f(x0)),'LE'(f(x0),'0')
% 2.10/0.99 === Conflict found: 15:2:1:[7.0,5.0]:Top: -> 'E'(s(s('0')),f(x0)),'LE'(f(x0),s(s('0'))) {x0 -> suc('0')}
% 2.10/0.99 === Backtracking. Learning clause 24:4:1:[15.2,12.1,6.2]:Top: 'E'(s(s('0')),f(x0)) -> 'E'(s('0'),f(suc(x0))),'LE'(f(x0),s('0')),iLEQ(suc(x0),suc(x0))
% 2.10/0.99 === Conflict found: 15:2:1:[7.0,5.0]:Top: -> 'E'(s(s('0')),f(x0)),'LE'(f(x0),s(s('0'))) {x0 -> suc('0')}
% 2.10/0.99 === Backtracking. Learning clause 25:3:1:[15.2,12.1]:Top: -> 'E'(s(s('0')),f(suc(x0))),'E'(s('0'),f(suc(x0))),'LE'(f(x0),s('0'))
% 2.10/0.99 === Clause set with instances from active satisfied. Growing active. New size: 14
% 2.10/0.99 === Restarting.
% 2.10/0.99 === Clause set with instances from active satisfied. Growing active. New size: 76
% 2.10/0.99 === Backtracking. Learning clause 26:2:1:[10.4,6.3,9.2,15.1]:Top: 'LE'(f(suc(x0)),s(s(s('0')))) -> 'LE'(f(x0),s(s('0')))
% 2.10/0.99 === Clause set with instances from active satisfied. Growing active. New size: 140
% 2.10/0.99 === Backtracking. Learning clause 27:2:1:[1.3,13.3,12.2,26.2,7.1,4.1,23.1]:Top: -> 'E'('0',f(x0)),'LE'(f(x0),'0')
% 2.10/0.99 === Backtracking. Learning clause 28:2:1:[6.3,10.4]:Top: 'E'(s(s('0')),f(x0)),'E'(s(s('0')),f(suc(x0))) ->
% 2.10/0.99 === Conflict found: 26:2:1:[10.4,6.3,9.2,15.1]:Top: 'LE'(f(suc(x0)),s(s(s('0')))) -> 'LE'(f(x0),s(s('0'))) {x0 -> suc('0')}
% 2.10/0.99 === Backtracking. Learning clause 29:1:1:[26.1,7.1]:Top: -> 'LE'(f(x0),s(s('0')))
% 2.10/0.99 === Backtracking. Learning clause 31:2:1:[29.0,30.1,1.3,13.3,12.2,2.2]:Top: 'LE'(f(suc(x0)),s(s('0'))) -> 'LE'(f(x0),s('0'))
% 2.10/0.99 === Backtracking. Learning clause 32:2:1:[13.3,1.3]:Top: 'E'(s('0'),f(suc(x0))),'E'(s('0'),f(x0)) ->
% 2.10/0.99 === Clause set with instances from active satisfied. Growing active. New size: 204
% 2.10/0.99 === Conflict found: 31:2:1:[29.0,30.1,1.3,13.3,12.2,2.2]:Top: 'LE'(f(suc(x0)),s(s('0'))) -> 'LE'(f(x0),s('0')) {x0 -> suc(z)}
% 2.10/0.99
% 2.10/0.99 SZS status Unsatisfiable
% 2.10/0.99
% 2.10/0.99 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.10/0.99
% 2.10/0.99 SPASS-SCL-FOL Statistics:
% 2.10/0.99 Number of learned clauses: 15
% 2.10/0.99 Number of propagations: 430
% 2.10/0.99 Number of decisions: 121
% 2.10/0.99 Number of resolutions: 42
% 2.10/0.99 Number of condensations: 0
% 2.10/0.99 Number of sub resolutions: 3
% 2.10/0.99 Number of input literals (deduplicated): 16
% 2.10/0.99 Number of grows: 5
% 2.10/0.99 Number of considered ground atoms: 204
% 2.10/0.99
% 2.10/0.99 Needed: 0:00:00.45
% 2.10/0.99
%------------------------------------------------------------------------------