%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN039-1 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n005.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:09 PM UTC 2026
% Result : Unsatisfiable 0.47s 0.56s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN039-1 : TPTP v9.2.1. Released v1.0.0.
% 0.12/0.13 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.34 % Computer : n005.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:39:31 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.47/0.56 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.56 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.56 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.56 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.56 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.56 Execution resolution_1 ended with status: unsatisfiable
% 0.47/0.56 Used heuristic: resolution_1
% 0.47/0.56
% 0.47/0.56 Input Clauses:
% 0.47/0.56
% 0.47/0.56 Predicates: p s q
% 0.47/0.56 Fol Constants: a
% 0.47/0.56 Fol Functions: f1
% 0.47/0.56 Problem Properties:
% 0.47/0.56 This is a full first-order problem without equality.
% 0.47/0.56
% 0.47/0.56 After reduction: Problem Properties:
% 0.47/0.56 This is a full first-order problem without equality.
% 0.47/0.56
% 0.47/0.56
% 0.47/0.56 Reduced Input Clauses:
% 0.47/0.56
% 0.47/0.56 Most General Atoms: p(x0,x0) q(x1,x1) q(x2,f1(x0,x2)) q(f1(x2,x3),x0) s(x2,x3)
% 0.47/0.56
% 0.47/0.56 === Starting SPASS-SCL-FOL A Little Less Naive, considering 17 atoms initially, heuristics mode: resolution_1 ===
% 0.47/0.56
% 0.47/0.56 === Backtracking. Learning clause 28:4:3:[12.3,15.3]:TopTopTop: p(x0,x0),s(x0,f1(x0,f1(x1,x2))),p(x1,x1),s(x2,x2) ->
% 0.47/0.56 === Backtracking. Learning clause 29:4:5:[20.1,15.3]:TopTopTopTopTop: p(x0,x0),s(x1,x1) -> s(x2,f1(x0,x1)),q(f1(f1(x0,x1),x3),x4)
% 0.47/0.56 === Backtracking. Learning clause 30:4:4:[19.1,15.3]:TopTopTopTop: q(x0,f1(f1(x1,x2),x0)),p(x1,x1),s(x2,x2) -> s(x3,f1(x1,x2))
% 0.47/0.56 === Backtracking. Learning clause 31:2:2:[21.1,15.3,12.2]:TopTop: p(x0,x0),s(x1,x1) ->
% 0.47/0.56 === Backtracking. Learning clause 32:4:5:[20.3,16.3]:TopTopTopTopTop: s(x0,f1(x0,x1)),p(x2,x2),q(x3,x3) -> s(x4,x0)
% 0.47/0.56 === Backtracking. Learning clause 33:4:6:[23.3,16.3,32.1]:TopTopTopTopTopTop: p(x0,x0),q(x1,x1) -> s(f1(f1(x2,x3),x4),x2),s(x5,f1(x2,x3))
% 0.47/0.56 === Backtracking. Learning clause 34:3:4:[23.3,16.3,31.2]:TopTopTopTop: q(x0,x0),p(x1,x1) -> s(f1(x2,x3),x2)
% 0.47/0.56 === Backtracking. Learning clause 35:2:2:[14.3,16.3,31.2]:TopTop: q(x0,x0),p(x1,x1) ->
% 0.47/0.56 === Backtracking. Learning clause 36:3:4:[20.3,35.1]:TopTopTopTop: s(x0,f1(x0,x1)),p(x2,x2) -> s(x3,x0)
% 0.47/0.56 === Backtracking. Learning clause 37:2:3:[23.3,35.1,31.2]:TopTopTop: p(x0,x0) -> s(f1(x1,x2),x1)
% 0.47/0.56 === Backtracking. Learning clause 38:3:3:[4.3,31.2]:TopTopTop: q(x0,f1(x1,x0)),p(x2,x2) -> p(f1(x1,x0),f1(x1,x0))
% 0.47/0.56 === Backtracking. Learning clause 39:2:3:[14.2,31.2]:TopTopTop: p(x0,x0) -> q(f1(x0,x1),x2)
% 0.47/0.56 === Backtracking. Learning clause 40:2:2:[13.3,31.2]:TopTop: p(x0,x0),q(x1,f1(x0,x1)) ->
% 0.47/0.56 === Conflict found: 39:2:3:[14.2,31.2]:TopTopTop: p(x0,x0) -> q(f1(x0,x1),x2) {x0 -> a, x1 -> a, x2 -> f1(a,a)}
% 0.47/0.56 === Backtracking. Learning clause 41:1:1:[39.2,35.1]:Top: p(x0,x0) ->
% 0.47/0.56 === Backtracking. Learning clause 42:2:3:[7.3,41.1]:TopTopTop: q(x0,x0),q(x1,f1(x2,x1)) ->
% 0.47/0.56 === Backtracking. Learning clause 43:2:2:[9.3,41.1]:TopTop: q(x0,x0),s(x1,x1) ->
% 0.47/0.56 === Backtracking. Learning clause 44:2:2:[3.3,41.1]:TopTop: s(x0,f1(x0,x1)),s(x1,x1) ->
% 0.47/0.56 === Backtracking. Learning clause 45:2:3:[4.2,41.1]:TopTopTop: q(x0,f1(x1,x0)) -> s(f1(x1,x0),x2)
% 0.47/0.56 === Backtracking. Learning clause 46:2:4:[5.1,41.1]:TopTopTopTop: -> s(f1(x0,x1),x2),q(f1(x0,x1),x3)
% 0.47/0.56 === Backtracking. Learning clause 47:2:3:[6.2,41.1]:TopTopTop: s(x0,x0) -> s(f1(x1,x0),x2)
% 0.47/0.56 === Conflict found: 44:2:2:[3.3,41.1]:TopTop: s(x0,f1(x0,x1)),s(x1,x1) -> {x0 -> a, x1 -> f1(a,a)}
% 0.47/0.56 === Backtracking. Learning clause 48:2:3:[44.2,47.2]:TopTopTop: s(x0,f1(x0,f1(x1,x2))),s(x2,x2) ->
% 0.47/0.56 === Conflict found: 47:2:3:[6.2,41.1]:TopTopTop: s(x0,x0) -> s(f1(x1,x0),x2) {x0 -> a, x1 -> a, x2 -> f1(f1(a,a),a)}
% 0.47/0.56 === Backtracking. Learning clause 49:1:1:[47.2,44.1]:Top: s(x0,x0) ->
% 0.47/0.56 === Conflict found: 46:2:4:[5.1,41.1]:TopTopTopTop: -> s(f1(x0,x1),x2),q(f1(x0,x1),x3) {x0 -> a, x1 -> a, x2 -> a, x3 -> f1(a,f1(a,a))}
% 0.47/0.56 === Backtracking. Learning clause 50:2:4:[46.2,25.2]:TopTopTopTop: q(x0,x0) -> s(f1(x1,x2),x3)
% 0.47/0.56 === Conflict found: 50:2:4:[46.2,25.2]:TopTopTopTop: q(x0,x0) -> s(f1(x1,x2),x3) {x0 -> a, x1 -> a, x2 -> a, x3 -> f1(a,a)}
% 0.47/0.56 === Backtracking. Learning clause 51:1:1:[50.2,49.1]:Top: q(x0,x0) ->
% 0.47/0.56 === Conflict found: 46:2:4:[5.1,41.1]:TopTopTopTop: -> s(f1(x0,x1),x2),q(f1(x0,x1),x3) {x0 -> a, x1 -> a, x2 -> f1(a,a), x3 -> f1(a,a)}
% 0.47/0.56
% 0.47/0.56 SZS status Unsatisfiable
% 0.47/0.56
% 0.47/0.56 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.56
% 0.47/0.56 SPASS-SCL-FOL Statistics:
% 0.47/0.56 Number of learned clauses: 24
% 0.47/0.56 Number of propagations: 171
% 0.47/0.56 Number of decisions: 85
% 0.47/0.56 Number of resolutions: 31
% 0.47/0.56 Number of condensations: 10
% 0.47/0.56 Number of sub resolutions: 0
% 0.47/0.56 Number of input literals (deduplicated): 9
% 0.47/0.56 Number of grows: 0
% 0.47/0.56 Number of considered ground atoms: 17
% 0.47/0.56
% 0.47/0.56 Needed: 0:00:00.03
% 0.47/0.56
%------------------------------------------------------------------------------