%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN312-1 : TPTP v9.2.1. Bugfixed v2.0.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n024.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:33 PM UTC 2026
% Result : Unsatisfiable 0.50s 0.44s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : SYN312-1 : TPTP v9.2.1. Bugfixed v2.0.0.
% 0.00/0.06 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.24 % Computer : n024.cluster.edu
% 0.06/0.24 % Model : x86_64 x86_64
% 0.06/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24 % Memory : 8042.1875MB
% 0.06/0.24 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24 % CPULimit : 300
% 0.06/0.24 % WCLimit : 300
% 0.06/0.24 % DateTime : Thu May 7 08:40:12 EDT 2026
% 0.06/0.24 % CPUTime :
% 0.06/0.24 SPASS-SCL-FOL version:
% 0.06/0.29 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.50/0.44 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.50/0.44 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.50/0.44 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.50/0.44 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.50/0.44 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.50/0.44 Execution resolution_1 ended with status: unsatisfiable
% 0.50/0.44 Used heuristic: resolution_1
% 0.50/0.44
% 0.50/0.44 Input Clauses:
% 0.50/0.44
% 0.50/0.44 Predicates: p
% 0.50/0.44 Fol Constants: a b c d
% 0.50/0.44 Fol Functions: f g
% 0.50/0.44 Problem Properties:
% 0.50/0.44 This is a full first-order problem without equality.
% 0.50/0.44
% 0.50/0.44 After reduction: Problem Properties:
% 0.50/0.44 This is a full first-order problem without equality.
% 0.50/0.44
% 0.50/0.44
% 0.50/0.44 Reduced Input Clauses:
% 0.50/0.44
% 0.50/0.44 Most General Atoms: p(x1,x0,x2)
% 0.50/0.44
% 0.50/0.44 === Starting SPASS-SCL-FOL A Little Less Naive, considering 17 atoms initially, heuristics mode: resolution_1 ===
% 0.50/0.44
% 0.50/0.44 === Backtracking. Learning clause 9:1:0:[3.1,7.1]:: -> p(d,f(b),c)
% 0.50/0.44 === Backtracking. Learning clause 10:1:0:[1.2,3.2,9.1,6.1,3.1]:: -> p(a,d,c)
% 0.50/0.44 === Backtracking. Learning clause 11:1:0:[2.1,7.1]:: -> p(c,d,f(b))
% 0.50/0.44 === Backtracking. Learning clause 12:2:3:[2.1,5.2]:TopTopTop: p(x0,x1,x2) -> p(x2,x1,g(x0))
% 0.50/0.44 === Backtracking. Learning clause 13:1:0:[4.2,8.1]:: p(f(g(a)),f(g(d)),g(c)) ->
% 0.50/0.44 === Backtracking. Learning clause 14:2:1:[1.3,8.1]:Top: p(f(g(a)),x0,f(g(c))),p(x0,f(g(d)),f(g(c))) ->
% 0.50/0.44 === Clause set with instances from active satisfied. Growing active. New size: 26
% 0.50/0.44 === Restarting.
% 0.50/0.44 === Backtracking. Learning clause 15:1:0:[3.2,1.2,10.1]:: -> p(a,a,c)
% 0.50/0.44 === Backtracking. Learning clause 16:2:3:[3.2,2.1]:TopTopTop: p(x0,x1,x2) -> p(x2,x0,x1)
% 0.50/0.44 === Backtracking. Learning clause 17:3:4:[3.2,1.2]:TopTopTopTop: p(x0,x1,x2),p(x3,x1,x2) -> p(x3,x0,x2)
% 0.50/0.44 === Clause set with instances from active satisfied. Growing active. New size: 30
% 0.50/0.44 === Restarting.
% 0.50/0.44 === Conflict found: 16:2:3:[3.2,2.1]:TopTopTop: p(x0,x1,x2) -> p(x2,x0,x1) {x0 -> a, x1 -> f(b), x2 -> c}
% 0.50/0.44 === Backtracking. Learning clause 18:1:0:[16.2,3.1,6.1]:: -> p(a,c,f(b))
% 0.50/0.44 === Conflict found: 14:2:1:[1.3,8.1]:Top: p(f(g(a)),x0,f(g(c))),p(x0,f(g(d)),f(g(c))) -> {x0 -> a}
% 0.50/0.44 === Backtracking. Learning clause 19:2:1:[14.1,3.2]:Top: p(x0,f(g(d)),f(g(c))),p(x0,f(g(a)),f(g(c))) ->
% 0.50/0.44 === Backtracking. Learning clause 20:1:0:[2.2,13.1,5.2]:: p(c,f(g(d)),f(g(a))) ->
% 0.50/0.44 === Backtracking. Learning clause 21:1:0:[2.2,13.1]:: p(g(c),f(g(d)),f(g(a))) ->
% 0.50/0.44 === Clause set with instances from active satisfied. Growing active. New size: 39
% 0.50/0.44 === Restarting.
% 0.50/0.44 === Backtracking. Learning clause 22:2:1:[1.2,11.1]:Top: p(x0,c,f(b)) -> p(x0,d,f(b))
% 0.50/0.44 === Conflict found: 17:3:4:[3.2,1.2]:TopTopTopTop: p(x0,x1,x2),p(x3,x1,x2) -> p(x3,x0,x2) {x0 -> f(g(d)), x1 -> a, x2 -> f(g(a)), x3 -> g(c)}
% 0.50/0.44 === Backtracking. Learning clause 23:2:1:[17.3,21.1,3.2]:Top: p(g(c),x0,f(g(a))),p(x0,f(g(d)),f(g(a))) ->
% 0.50/0.44 === Clause set with instances from active satisfied. Growing active. New size: 43
% 0.50/0.44 === Restarting.
% 0.50/0.44 === Conflict found: 17:3:4:[3.2,1.2]:TopTopTopTop: p(x0,x1,x2),p(x3,x1,x2) -> p(x3,x0,x2) {x0 -> a, x1 -> c, x2 -> f(b), x3 -> a}
% 0.50/0.44 === Backtracking. Learning clause 24:1:0:[17.1,18.1]:: -> p(a,a,f(b))
% 0.50/0.44 === Backtracking. Learning clause 25:1:0:[4.2,20.1]:: p(c,f(g(d)),g(a)) ->
% 0.50/0.44 === Clause set with instances from active satisfied. Growing active. New size: 45
% 0.50/0.44 === Restarting.
% 0.50/0.44 === Conflict found: 12:2:3:[2.1,5.2]:TopTopTop: p(x0,x1,x2) -> p(x2,x1,g(x0)) {x0 -> a, x1 -> f(g(d)), x2 -> c}
% 0.50/0.44 === Backtracking. Learning clause 26:1:0:[12.2,25.1]:: p(a,f(g(d)),c) ->
% 0.50/0.44 === Conflict found: 17:3:4:[3.2,1.2]:TopTopTopTop: p(x0,x1,x2),p(x3,x1,x2) -> p(x3,x0,x2) {x0 -> f(g(a)), x1 -> a, x2 -> f(g(c)), x3 -> a}
% 0.50/0.44 === Backtracking. Learning clause 27:3:4:[17.1,4.2]:TopTopTopTop: p(x0,x1,f(x2)),p(x3,x1,x2) -> p(x0,x3,f(x2))
% 0.50/0.44 === Clause set with instances from active satisfied. Growing active. New size: 51
% 0.50/0.44 === Restarting.
% 0.50/0.44 === Backtracking. Learning clause 28:2:3:[3.1,4.2,17.1,12.2,4.2]:TopTopTop: p(x0,x1,x2) -> p(x1,x1,f(g(x0)))
% 0.50/0.44 === Clause set with instances from active satisfied. Growing active. New size: 56
% 0.50/0.44 === Restarting.
% 0.50/0.44 === Conflict found: 16:2:3:[3.2,2.1]:TopTopTop: p(x0,x1,x2) -> p(x2,x0,x1) {x0 -> g(a), x1 -> a, x2 -> a}
% 0.50/0.44 === Backtracking. Learning clause 29:2:3:[16.1,16.2,17.1]:TopTopTop: p(x0,x1,x2) -> p(x1,x1,x0)
% 0.50/0.44 === Conflict found: 29:2:3:[16.1,16.2,17.1]:TopTopTop: p(x0,x1,x2) -> p(x1,x1,x0) {x0 -> a, x1 -> a, x2 -> c}
% 0.50/0.44 === Backtracking. Learning clause 30:1:0:[29.1,15.1]:: -> p(a,a,a)
% 0.50/0.44 === Backtracking. Learning clause 31:2:1:[1.3,25.1,12.2]:Top: p(c,x0,g(a)),p(a,f(g(d)),x0) ->
% 0.50/0.44 === Backtracking. Learning clause 32:2:3:[5.2,29.1,4.2,12.2]:TopTopTop: p(x0,x1,x2) -> p(x1,x1,g(x2))
% 0.50/0.44 === Conflict found: 19:2:1:[14.1,3.2]:Top: p(x0,f(g(d)),f(g(c))),p(x0,f(g(a)),f(g(c))) -> {x0 -> a}
% 0.50/0.44 === Backtracking. Learning clause 33:3:2:[19.1,4.2,27.3,12.2]:TopTop: p(x0,f(g(d)),g(c)),p(x0,x1,f(g(c))),p(c,x1,f(g(a))) ->
% 0.50/0.44 === Backtracking. Learning clause 34:1:0:[4.2,21.1]:: p(g(c),f(g(d)),g(a)) ->
% 0.50/0.44 === Clause set with instances from active satisfied. Growing active. New size: 72
% 0.50/0.44 === Restarting.
% 0.50/0.44 === Backtracking. Learning clause 35:1:0:[2.1,9.1]:: -> p(c,f(b),d)
% 0.50/0.44 === Clause set with instances from active satisfied. Growing active. New size: 75
% 0.50/0.44 === Restarting.
% 0.50/0.44 === Backtracking. Learning clause 36:2:1:[1.3,25.1]:Top: p(c,x0,g(a)),p(x0,f(g(d)),g(a)) ->
% 0.50/0.44 === Clause set with instances from active satisfied. Growing active. New size: 78
% 0.50/0.44 === Restarting.
% 0.50/0.44 === Backtracking. Learning clause 37:2:1:[1.2,35.1]:Top: p(x0,c,d) -> p(x0,f(b),d)
% 0.50/0.44 === Conflict found: 29:2:3:[16.1,16.2,17.1]:TopTopTop: p(x0,x1,x2) -> p(x1,x1,x0) {x0 -> f(b), x1 -> d, x2 -> c}
% 0.50/0.44 === Backtracking. Learning clause 38:1:0:[29.1,7.1]:: -> p(d,d,f(b))
% 0.50/0.44 === Clause set with instances from active satisfied. Growing active. New size: 81
% 0.50/0.44 === Restarting.
% 0.50/0.44 === Clause set with instances from active satisfied. Growing active. New size: 131
% 0.50/0.44 === Clause set with instances from active satisfied. Growing active. New size: 195
% 0.50/0.44 === Backtracking. Learning clause 39:2:3:[3.2,29.1]:TopTopTop: p(x0,x1,x2) -> p(x0,x0,x1)
% 0.50/0.44
% 0.50/0.44 SZS status Unsatisfiable
% 0.50/0.44
% 0.50/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.50/0.44
% 0.50/0.44 SPASS-SCL-FOL Statistics:
% 0.50/0.44 Number of learned clauses: 31
% 0.50/0.44 Number of propagations: 1004
% 0.50/0.44 Number of decisions: 307
% 0.50/0.44 Number of resolutions: 56
% 0.50/0.44 Number of condensations: 0
% 0.50/0.44 Number of sub resolutions: 0
% 0.50/0.44 Number of input literals (deduplicated): 6
% 0.50/0.44 Number of grows: 13
% 0.50/0.44 Number of considered ground atoms: 195
% 0.50/0.44
% 0.50/0.44 Needed: 0:00:00.09
% 0.50/0.44
%------------------------------------------------------------------------------