%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN353-1 : TPTP v9.2.1. Released v1.2.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n008.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:39:39 PM UTC 2026
% Result : Unsatisfiable 7.86s 2.07s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN353-1 : TPTP v9.2.1. Released v1.2.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.34 % Computer : n008.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:41:14 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]
% 7.86/2.07 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.86/2.07 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.86/2.07 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.86/2.07 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.86/2.07 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.86/2.07 Execution lmodel_grow ended with status: unsatisfiable
% 7.86/2.07 Used heuristic: lmodel_grow
% 7.86/2.07
% 7.86/2.07 Input Clauses:
% 7.86/2.07
% 7.86/2.07 Predicates: f
% 7.86/2.07 Fol Constants: a
% 7.86/2.07 Fol Functions: z
% 7.86/2.07 Problem Properties:
% 7.86/2.07 This is a full first-order problem without equality.
% 7.86/2.07
% 7.86/2.07 After reduction: Problem Properties:
% 7.86/2.07 This is a full first-order problem without equality.
% 7.86/2.07
% 7.86/2.07
% 7.86/2.07 Reduced Input Clauses:
% 7.86/2.07
% 7.86/2.07 Most General Atoms: f(x2,x0,x1)
% 7.86/2.07
% 7.86/2.07 === Starting SPASS-SCL-FOL A Little Less Naive, considering 54 atoms initially, heuristics mode: lmodel_grow ===
% 7.86/2.07
% 7.86/2.07 === Backtracking. Learning clause 18:1:1:[4.1,5.1]:Top: -> f(x0,x0,z(x0,x0,x0))
% 7.86/2.07 === Clause set with instances from active satisfied. Growing active. New size: 77
% 7.86/2.07 === Clause set with instances from active satisfied. Growing active. New size: 105
% 7.86/2.07 === Clause set with instances from active satisfied. Growing active. New size: 129
% 7.86/2.07 === Backtracking. Learning clause 19:3:1:[1.2,4.2,10.1,2.1]:Top: f(a,a,z(a,a,x0)) -> f(a,z(a,a,x0),a),f(a,a,x0)
% 7.86/2.07 === Clause set with instances from active satisfied. Growing active. New size: 158
% 7.86/2.07 === Clause set with instances from active satisfied. Growing active. New size: 187
% 7.86/2.07 === Backtracking. Learning clause 20:3:1:[6.2,19.2]:Top: f(a,x0,a),f(a,a,z(a,a,x0)) -> f(a,a,x0)
% 7.86/2.07 === Conflict found: 19:3:1:[1.2,4.2,10.1,2.1]:Top: f(a,a,z(a,a,x0)) -> f(a,z(a,a,x0),a),f(a,a,x0) {x0 -> z(a,z(a,z(a,a,a),a),a)}
% 7.86/2.07 === Backtracking. Learning clause 21:3:1:[19.1,11.3]:Top: f(z(a,a,z(a,a,x0)),a,a) -> f(a,a,x0),f(a,z(a,a,x0),a)
% 7.86/2.07 === Backtracking. Learning clause 22:2:3:[5.2,15.1,14.1]:TopTopTop: -> f(x0,x1,z(x1,x0,x2)),f(z(x1,x0,x2),z(x1,x0,x2),z(x1,x0,x2))
% 7.86/2.07 === Backtracking. Learning clause 23:2:3:[9.2,15.1,16.1]:TopTopTop: -> f(x0,z(x0,x1,x2),x1),f(z(x1,x2,x0),z(x1,x2,x0),z(x1,x2,x0))
% 7.86/2.07 === Clause set with instances from active satisfied. Growing active. New size: 217
% 7.86/2.07 === Backtracking. Learning clause 24:3:1:[4.2,20.2,11.1,8.2]:Top: -> f(a,a,z(a,a,x0)),f(a,a,x0),f(a,x0,a)
% 7.86/2.07 === Clause set with instances from active satisfied. Growing active. New size: 250
% 7.86/2.07 === Backtracking. Learning clause 25:4:3:[12.1,4.1,8.1,13.1,7.1,1.3]:TopTopTop: f(x0,x1,z(x1,x0,z(x0,x1,x2))),f(a,a,z(x0,x1,z(x1,x0,z(x0,x1,x2)))) -> f(z(x0,x1,x2),x1,x0),f(z(x1,x0,z(x0,x1,x2)),x0,x1)
% 7.86/2.07 === Conflict found: 25:4:3:[12.1,4.1,8.1,13.1,7.1,1.3]:TopTopTop: f(x0,x1,z(x1,x0,z(x0,x1,x2))),f(a,a,z(x0,x1,z(x1,x0,z(x0,x1,x2)))) -> f(z(x0,x1,x2),x1,x0),f(z(x1,x0,z(x0,x1,x2)),x0,x1) {x0 -> a, x1 -> a, x2 -> z(a,z(a,z(a,a,a),a),a)}
% 7.86/2.07 === Backtracking. Learning clause 26:2:1:[25.3,2.1,24.1,4.2,11.1]:Top: -> f(a,z(a,a,x0),a),f(a,a,z(a,a,x0))
% 7.86/2.07 === Conflict found: 26:2:1:[25.3,2.1,24.1,4.2,11.1]:Top: -> f(a,z(a,a,x0),a),f(a,a,z(a,a,x0)) {x0 -> z(a,a,z(z(a,a,z(a,a,a)),a,a))}
% 7.86/2.07 === Backtracking. Learning clause 27:1:1:[26.2,20.2,6.2,26.1,13.1]:Top: -> f(z(a,a,z(a,a,x0)),a,a)
% 7.86/2.07 === Conflict found: 26:2:1:[25.3,2.1,24.1,4.2,11.1]:Top: -> f(a,z(a,a,x0),a),f(a,a,z(a,a,x0)) {x0 -> z(a,a,z(z(a,a,z(a,a,a)),a,a))}
% 7.86/2.07 === Backtracking. Learning clause 28:2:1:[26.2,20.2,6.2]:Top: f(a,x0,a) -> f(a,a,x0)
% 7.86/2.07 === Conflict found: 28:2:1:[26.2,20.2,6.2]:Top: f(a,x0,a) -> f(a,a,x0) {x0 -> z(a,a,z(a,a,z(a,z(a,z(a,a,a),a),a)))}
% 7.86/2.07 === Backtracking. Learning clause 30:1:1:[27.0,29.0,28.1,8.2,3.2,13.2,21.2]:Top: -> f(a,z(a,a,x0),a)
% 7.86/2.07 === Backtracking. Learning clause 31:4:3:[1.1,11.3,3.1]:TopTopTop: f(a,a,z(x0,x1,x2)),f(z(x0,x1,x2),x1,x0),f(x1,x0,z(x0,x1,x2)) -> f(x1,x2,x0)
% 7.86/2.07 === Backtracking. Learning clause 33:4:3:[8.1,32.0,10.1,7.3,1.1,3.1]:TopTopTop: f(x0,z(x0,x1,z(x1,x0,x2)),x1),f(a,a,z(x1,x0,x2)),f(x0,x1,z(x1,x0,x2)) -> f(x0,x2,x1)
% 7.86/2.07 === Backtracking. Learning clause 34:1:1:[17.1,28.2,27.1,30.1]:Top: f(z(a,a,z(a,a,z(a,a,x0))),z(a,a,z(a,a,z(a,a,x0))),z(a,a,z(a,a,z(a,a,x0)))) ->
% 7.86/2.07 === Backtracking. Learning clause 36:1:1:[30.0,35.0,7.2,30.1,33.4,4.2]:Top: -> f(x0,a,a)
% 7.86/2.07 === Clause set with instances from active satisfied. Growing active. New size: 284
% 7.86/2.07 === Backtracking. Learning clause 39:1:1:[36.0,37.0,30.0,38.1,2.2,28.2]:Top: -> f(a,a,x0)
% 7.86/2.07 === Backtracking. Learning clause 41:1:1:[39.0,40.0,17.2,30.1,36.1]:Top: f(z(a,a,z(a,a,x0)),z(a,a,z(a,a,x0)),z(a,a,z(a,a,x0))) ->
% 7.86/2.07 === Clause set with instances from active satisfied. Growing active. New size: 320
% 7.86/2.07 === Conflict found: 23:2:3:[9.2,15.1,16.1]:TopTopTop: -> f(x0,z(x0,x1,x2),x1),f(z(x1,x2,x0),z(x1,x2,x0),z(x1,x2,x0)) {x0 -> z(a,a,z(a,a,z(a,a,z(a,z(z(a,a,a),a,a),a)))), x1 -> a, x2 -> a}
% 7.86/2.07 === Backtracking. Learning clause 42:1:1:[23.2,34.1]:Top: -> f(z(a,a,z(a,a,x0)),z(z(a,a,z(a,a,x0)),a,a),a)
% 7.86/2.07 === Clause set with instances from active satisfied. Growing active. New size: 356
% 7.86/2.07 === Backtracking. Learning clause 43:3:3:[1.2,39.1]:TopTopTop: f(x0,x1,x2) -> f(x1,x2,x0),f(x2,x0,x1)
% 7.86/2.07 === Clause set with instances from active satisfied. Growing active. New size: 393
% 7.86/2.07 === Backtracking. Learning clause 45:1:1:[30.0,44.0,5.2,27.1]:Top: -> f(z(a,a,z(a,a,x0)),a,z(a,z(a,a,z(a,a,x0)),a))
% 7.86/2.07 === Clause set with instances from active satisfied. Growing active. New size: 424
% 7.86/2.07 === Backtracking. Learning clause 47:2:1:[28.1,46.1,17.2,36.1]:Top: f(a,x0,a),f(z(a,x0,a),z(a,x0,a),z(a,x0,a)) ->
% 7.86/2.07 === Clause set with instances from active satisfied. Growing active. New size: 460
% 7.86/2.07 === Backtracking. Learning clause 50:1:1:[36.0,48.0,39.0,49.1,5.2,36.1,31.4]:Top: -> f(x0,a,z(a,x0,a))
% 7.86/2.07 === Backtracking. Learning clause 51:2:3:[9.1,14.1,16.1]:TopTopTop: -> f(x0,z(x0,x1,x2),x1),f(z(x0,x1,x2),z(x0,x1,x2),z(x0,x1,x2))
% 7.86/2.07 === Conflict found: 43:3:3:[1.2,39.1]:TopTopTop: f(x0,x1,x2) -> f(x1,x2,x0),f(x2,x0,x1) {x0 -> z(z(a,a,a),z(a,a,a),a), x1 -> z(a,a,a), x2 -> z(a,a,a)}
% 7.86/2.07 === Backtracking. Learning clause 52:2:3:[43.2,2.2,12.3,43.2,8.1]:TopTopTop: -> f(x0,x1,x2),f(x0,z(x0,x1,x2),x1)
% 7.86/2.07 === Backtracking. Learning clause 53:2:3:[6.2,52.2,43.3]:TopTopTop: f(x0,x1,x2) -> f(x1,x2,x0)
% 7.86/2.07 === Conflict found: 53:2:3:[6.2,52.2,43.3]:TopTopTop: f(x0,x1,x2) -> f(x1,x2,x0) {x0 -> z(a,a,a), x1 -> z(z(a,a,a),z(a,a,a),a), x2 -> z(a,a,a)}
% 7.86/2.07 === Backtracking. Learning clause 54:1:3:[53.2,11.1,8.2,53.1,53.1]:TopTopTop: -> f(x0,x1,x2)
% 7.86/2.07
% 7.86/2.07 SZS status Unsatisfiable
% 7.86/2.07
% 7.86/2.07 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.86/2.07
% 7.86/2.07 SPASS-SCL-FOL Statistics:
% 7.86/2.07 Number of learned clauses: 27
% 7.86/2.07 Number of propagations: 3517
% 7.86/2.07 Number of decisions: 650
% 7.86/2.07 Number of resolutions: 68
% 7.86/2.07 Number of condensations: 0
% 7.86/2.07 Number of sub resolutions: 10
% 7.86/2.07 Number of input literals (deduplicated): 6
% 7.86/2.07 Number of grows: 13
% 7.86/2.07 Number of considered ground atoms: 460
% 7.86/2.07
% 7.86/2.07 Needed: 0:00:01.54
% 7.86/2.07
%------------------------------------------------------------------------------