%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYO680-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 : n009.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.29s 0.55s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYO680-1 : TPTP v9.2.1. Released v7.3.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.32 % Computer : n009.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Thu May 7 13:55:56 EDT 2026
% 0.13/0.33 % CPUTime :
% 0.13/0.33 SPASS-SCL-FOL version:
% 0.18/0.42 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.29/0.55 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.29/0.55 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.29/0.55 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.29/0.55 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.29/0.55 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.29/0.55 Execution normal ended with status: unsatisfiable
% 0.29/0.55 Used heuristic: normal
% 0.29/0.55
% 0.29/0.55 Input Clauses:
% 0.29/0.55
% 0.29/0.55 Predicates: 'E' iLEQ 'LE'
% 0.29/0.55 Fol Constants: '0' z
% 0.29/0.55 Fol Functions: f suc s
% 0.29/0.55 Problem Properties:
% 0.29/0.55 This is a full first-order problem without equality.
% 0.29/0.55
% 0.29/0.55 After reduction: Problem Properties:
% 0.29/0.55 This is a full first-order problem without equality.
% 0.29/0.55
% 0.29/0.55
% 0.29/0.55 Reduced Input Clauses:
% 0.29/0.55 19:2:1:[2.0,12.0]:Top: -> 'E'(s(s(s('0'))),f(x0)),'LE'(f(x0),s(s(s('0'))))
% 0.29/0.55
% 0.29/0.55 Most General Atoms: 'LE'(f(x0),s(s(s(s('0'))))) 'LE'(f(x0),'0') iLEQ(suc(x2),suc(x0)) 'E'(s(s('0')),f(x2)) 'E'(s(s(s('0'))),f(x2)) 'LE'(f(x0),s(s('0'))) 'LE'(f(x0),s('0')) 'E'('0',f(x2)) 'LE'(f(x0),s(s(s('0')))) 'E'(s('0'),f(x1))
% 0.29/0.55
% 0.29/0.55 === Starting SPASS-SCL-FOL A Little Less Naive, considering 58 atoms initially, heuristics mode: normal ===
% 0.29/0.55
% 0.29/0.55 === Backtracking. Learning clause 20:2:1:[16.3,7.1,15.2,19.1]:Top: 'LE'(f(suc(x0)),s(s(s(s('0'))))) -> 'LE'(f(x0),s(s(s('0'))))
% 0.29/0.55 === Backtracking. Learning clause 21:3:1:[6.3,5.3,13.2]:Top: 'E'(s(s('0')),f(suc(x0))),'LE'(f(x0),s(s(s('0')))) -> 'LE'(f(x0),s(s('0')))
% 0.29/0.55 === Backtracking. Learning clause 22:4:1:[3.1,8.2,18.2]:Top: 'LE'(f(x0),s(s('0'))),'LE'(f(suc(x0)),s(s('0'))) -> iLEQ(suc(x0),suc(x0)),'LE'(f(x0),s('0'))
% 0.29/0.55 === Backtracking. Learning clause 23:3:1:[10.2,21.1]:Top: 'LE'(f(suc(x0)),s(s(s('0')))),'LE'(f(x0),s(s(s('0')))) -> 'LE'(f(x0),s(s('0')))
% 0.29/0.55 === Clause set with instances from active satisfied. Growing active. New size: 122
% 0.29/0.55 === Conflict found: 20:2:1:[16.3,7.1,15.2,19.1]:Top: 'LE'(f(suc(x0)),s(s(s(s('0'))))) -> 'LE'(f(x0),s(s(s('0')))) {x0 -> suc('0')}
% 0.29/0.55 === Backtracking. Learning clause 24:2:1:[20.1,2.1,23.1]:Top: 'LE'(f(x0),s(s(s('0')))) -> 'LE'(f(x0),s(s('0')))
% 0.29/0.55 === Backtracking. Learning clause 25:3:1:[14.2,18.2,8.2,22.3]:Top: 'LE'(f(x0),s(s('0'))),'LE'(f(suc(x0)),s(s('0'))) -> 'LE'(f(x0),s('0'))
% 0.29/0.55 === Backtracking. Learning clause 26:4:1:[11.2,1.3,4.2,8.3]:Top: 'E'('0',f(x0)),'LE'(f(suc(x0)),s(s('0'))) -> 'LE'(f(x0),'0'),'E'(s('0'),f(suc(x0)))
% 0.29/0.55 === Clause set with instances from active satisfied. Growing active. New size: 186
% 0.29/0.55 === Conflict found: 24:2:1:[20.1,2.1,23.1]:Top: 'LE'(f(x0),s(s(s('0')))) -> 'LE'(f(x0),s(s('0'))) {x0 -> suc(s('0'))}
% 0.29/0.55 === Backtracking. Learning clause 27:4:1:[24.1,19.2,22.2]:Top: 'LE'(f(x0),s(s('0'))) -> 'E'(s(s(s('0'))),f(suc(x0))),iLEQ(suc(x0),suc(x0)),'LE'(f(x0),s('0'))
% 0.29/0.55 === Backtracking. Learning clause 28:2:1:[16.3,7.1]:Top: 'E'(s(s(s('0'))),f(x0)),'E'(s(s(s('0'))),f(suc(x0))) ->
% 0.29/0.55 === Backtracking. Learning clause 29:2:1:[1.3,11.2]:Top: 'E'('0',f(suc(x0))),'E'('0',f(x0)) ->
% 0.29/0.55 === Clause set with instances from active satisfied. Growing active. New size: 250
% 0.29/0.55 === Conflict found: 20:2:1:[16.3,7.1,15.2,19.1]:Top: 'LE'(f(suc(x0)),s(s(s(s('0'))))) -> 'LE'(f(x0),s(s(s('0')))) {x0 -> suc(s(z))}
% 0.29/0.55 === Backtracking. Learning clause 30:2:1:[20.2,24.1,2.1,25.2]:Top: 'LE'(f(x0),s(s('0'))) -> 'LE'(f(x0),s('0'))
% 0.29/0.55
% 0.29/0.55 SZS status Unsatisfiable
% 0.29/0.55
% 0.29/0.55 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.29/0.55
% 0.29/0.55 SPASS-SCL-FOL Statistics:
% 0.29/0.55 Number of learned clauses: 11
% 0.29/0.55 Number of propagations: 573
% 0.29/0.55 Number of decisions: 194
% 0.29/0.55 Number of resolutions: 36
% 0.29/0.55 Number of condensations: 0
% 0.29/0.55 Number of sub resolutions: 1
% 0.29/0.55 Number of input literals (deduplicated): 20
% 0.29/0.55 Number of grows: 3
% 0.29/0.55 Number of considered ground atoms: 250
% 0.29/0.55
% 0.29/0.55 Needed: 0:00:00.02
% 0.29/0.55
%------------------------------------------------------------------------------