%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : SYN036+2 : TPTP v9.2.1. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n014.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:08 PM UTC 2026
% Result : Theorem 0.82s 0.67s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN036+2 : TPTP v9.2.1. Released v2.0.0.
% 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.34 % Computer : n014.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Thu May 7 13:40:07 EDT 2026
% 0.17/0.34 % CPUTime :
% 0.17/0.34 SPASS-SCL-FOL version:
% 0.19/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 0.82/0.67 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.82/0.67 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.82/0.67 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.82/0.67 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.82/0.67 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.82/0.67 Execution resolution_1 ended with status: unsatisfiable
% 0.82/0.67 Used heuristic: resolution_1
% 0.82/0.67
% 0.82/0.67 Input Clauses:
% 0.82/0.67
% 0.82/0.67 Predicates: big_p big_q ren1 ren2 ren3 ren4 ren5 ren6
% 0.82/0.67 Fol Constants: skc1 skc2 skc3 skc4 skc6 skc8 skc9 skc10 skc11 skc12 skc14 skc16
% 0.82/0.67 Fol Functions: skf5 skf7 skf13 skf15
% 0.82/0.67 Problem Properties:
% 0.82/0.67 This is a full first-order problem without equality.
% 0.82/0.67
% 0.82/0.67 After reduction: Problem Properties:
% 0.82/0.67 This is a full first-order problem without equality.
% 0.82/0.67
% 0.82/0.67
% 0.82/0.67 Reduced Input Clauses:
% 0.82/0.67
% 0.82/0.67 Most General Atoms: ren1(x0,x1) big_p(x1) ren2 ren3 ren4(x0,x1) big_q(x1) ren5 ren6
% 0.82/0.67
% 0.82/0.67 === Starting SPASS-SCL-FOL A Little Less Naive, considering 39 atoms initially, heuristics mode: resolution_1 ===
% 0.82/0.67
% 0.82/0.67 === Backtracking. Learning clause 27:4:2:[5.2,17.3]:TopTop: ren2,ren5,big_p(x0) -> big_p(x1)
% 0.82/0.67 === Backtracking. Learning clause 28:3:1:[15.3,23.1,17.3,17.3]:Top: ren5,big_p(x0) -> ren6
% 0.82/0.67 === Backtracking. Learning clause 29:3:0:[16.3,23.1,5.2,5.2,28.2,25.2]:: ren2,ren5,ren3 ->
% 0.82/0.67 === Backtracking. Learning clause 30:3:0:[20.2,5.2]:: ren2 -> big_p(skc12),ren5
% 0.82/0.67 === Backtracking. Learning clause 31:3:1:[5.2,6.3]:Top: ren2,big_p(skc1) -> big_p(x0)
% 0.82/0.67 === Clause set with instances from active satisfied. Growing active. New size: 95
% 0.82/0.67 === Clause set with instances from active satisfied. Growing active. New size: 159
% 0.82/0.67 === Clause set with instances from active satisfied. Growing active. New size: 223
% 0.82/0.67 === Backtracking. Learning clause 32:4:1:[13.1,24.1]:Top: big_q(skc16) -> big_q(x0),ren5,ren6
% 0.82/0.67 === Backtracking. Learning clause 34:3:2:[28.0,33.3,14.1,24.1,32.1,19.2]:TopTop: big_q(x0),big_p(x1) -> ren6
% 0.82/0.67 === Conflict found: 34:3:2:[28.0,33.3,14.1,24.1,32.1,19.2]:TopTop: big_q(x0),big_p(x1) -> ren6 {x0 -> skc2, x1 -> skc12}
% 0.82/0.67 === Backtracking. Learning clause 36:3:0:[28.0,35.3,34.1,6.3,30.2]:: big_p(skc1),ren2 -> ren6
% 0.82/0.67 === Backtracking. Learning clause 37:2:0:[1.2,2.3,10.3,10.3,36.1,30.2,25.2,29.2]:: ren2,ren3 ->
% 0.82/0.67 === Backtracking. Learning clause 38:2:0:[3.3,11.1,31.3,37.2]:: big_p(skc1),ren2 ->
% 0.82/0.67 === Backtracking. Learning clause 40:2:0:[37.1,39.1,4.2,27.3,11.1,30.3]:: ren2 -> big_p(skc12)
% 0.82/0.67 === Backtracking. Learning clause 41:1:0:[16.3,21.2,5.2,5.2,26.2,37.2,27.2,38.1,40.2]:: ren2 ->
% 0.82/0.67 === Backtracking. Learning clause 42:3:2:[1.2,2.3,12.1,12.1,41.1,25.1,28.3]:TopTop: ren5,big_p(x0) -> big_p(x1)
% 0.82/0.67 === Conflict found: 34:3:2:[28.0,33.3,14.1,24.1,32.1,19.2]:TopTop: big_q(x0),big_p(x1) -> ren6 {x0 -> skc1, x1 -> skc1}
% 0.82/0.67 === Backtracking. Learning clause 44:3:1:[42.0,43.3,34.1,20.2,25.2]:Top: big_p(x0),ren3 -> big_p(skc12)
% 0.82/0.67 === Backtracking. Learning clause 45:2:1:[2.3,1.2,12.1,12.1,41.1,44.2]:Top: big_p(x0) -> big_p(skc12)
% 0.82/0.67 === Backtracking. Learning clause 46:1:1:[15.1,16.1]:Top: -> ren4(x0,x0)
% 0.82/0.67 === Backtracking. Learning clause 48:2:1:[26.0,47.1,8.1,34.1,3.2,9.2,41.1]:Top: big_p(x0) -> ren6
% 0.82/0.67 === Backtracking. Learning clause 49:1:0:[4.2,48.1,9.2,41.1,48.1,25.2]:: ren3 ->
% 0.82/0.67 === Backtracking. Learning clause 50:3:2:[3.1,42.3]:TopTop: big_p(x0),ren5 -> ren1(x1,x0)
% 0.82/0.67 === Backtracking. Learning clause 52:2:1:[41.0,51.2,7.2,42.3,17.3]:Top: ren5,big_p(x0) ->
% 0.82/0.67 === Backtracking. Learning clause 55:2:1:[49.0,53.2,41.0,54.3,1.1,12.1,7.2]:Top: big_p(skc8),big_q(x0) ->
% 0.82/0.67 === Backtracking. Learning clause 57:1:1:[49.0,56.1,16.3,21.2,55.2,55.2,2.3,12.1,52.1,26.2,41.1]:Top: big_p(x0) ->
% 0.82/0.67 === Backtracking. Learning clause 58:4:2:[14.3,13.2,22.3,22.3]:TopTop: big_q(x0),ren6,ren5 -> big_q(x1)
% 0.82/0.67 === Backtracking. Learning clause 59:3:1:[18.3,57.1,58.4]:Top: big_q(x0),ren6,ren5 ->
% 0.82/0.67 === Conflict found: 58:4:2:[14.3,13.2,22.3,22.3]:TopTop: big_q(x0),ren6,ren5 -> big_q(x1) {x0 -> skc4, x1 -> skf7(skc1)}
% 0.82/0.67 === Backtracking. Learning clause 62:2:0:[52.1,60.2,41.0,61.3,58.1,8.1,59.1]:: ren6,ren5 ->
% 0.82/0.67 === Backtracking. Learning clause 64:2:1:[59.2,63.2,15.3,21.2,20.2,57.1]:Top: big_q(x0),ren6 ->
% 0.82/0.67
% 0.82/0.67 SZS status Unsatisfiable
% 0.82/0.67
% 0.82/0.67 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.82/0.67
% 0.82/0.67 SPASS-SCL-FOL Statistics:
% 0.82/0.67 Number of learned clauses: 26
% 0.82/0.67 Number of propagations: 1073
% 0.82/0.67 Number of decisions: 88
% 0.82/0.67 Number of resolutions: 89
% 0.82/0.67 Number of condensations: 10
% 0.82/0.67 Number of sub resolutions: 12
% 0.82/0.67 Number of input literals (deduplicated): 24
% 0.82/0.67 Number of grows: 3
% 0.82/0.67 Number of considered ground atoms: 223
% 0.82/0.67
% 0.82/0.67 Needed: 0:00:00.13
% 0.82/0.67
%------------------------------------------------------------------------------