%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1
% Problem : MGT006+1 : TPTP v9.2.1. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n018.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:28:43 PM UTC 2026
% Result : Theorem 1.23s 0.77s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT006+1 : TPTP v9.2.1. Released v2.0.0.
% 0.11/0.12 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.33 % Computer : n018.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Thu May 7 12:41:48 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.33 SPASS-SCL-FOL version:
% 0.18/0.43 SPASS-SCL-FOL 0.1 (595c0c7b1) [parallel mode]
% 1.23/0.77 Starting: ./SPASS-SCL-FOL --heuristics_normal -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.23/0.77 Starting: ./SPASS-SCL-FOL --heuristics_resolution_1 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.23/0.77 Starting: ./SPASS-SCL-FOL --heuristics_resolution_2 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.23/0.77 Starting: ./SPASS-SCL-FOL --heuristics_resolution_3 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.23/0.77 Starting: ./SPASS-SCL-FOL --heuristics_lmodel_grow -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.23/0.77 Execution resolution_2 ended with status: unsatisfiable
% 1.23/0.77 Used heuristic: resolution_2
% 1.23/0.77
% 1.23/0.77 Input Clauses:
% 1.23/0.77
% 1.23/0.77 Predicates: organization reproducibility reliability accountability greater reorganization_free ren1 ren2
% 1.23/0.77 Fol Constants: skc2 skc3 skc4 skc5 skc6 skc7 skc8
% 1.23/0.77 Fol Functions: skf1
% 1.23/0.77 Problem Properties:
% 1.23/0.77 This is a full first-order problem without equality.
% 1.23/0.77
% 1.23/0.77 After reduction: Problem Properties:
% 1.23/0.77 This is a full first-order problem without equality.
% 1.23/0.77
% 1.23/0.77
% 1.23/0.77 Reduced Input Clauses:
% 1.23/0.77
% 1.23/0.77 Most General Atoms: ren1(x2,x3,x4,x5) reliability(x2,x5,x3) accountability(x2,x7,x3) ren2(x9,x8,x5,x4,x7,x6) organization(x0,x2) reorganization_free(x0,x1,x2) reproducibility(x0,x4,x2) greater(x4,x3)
% 1.23/0.77
% 1.23/0.77 === Starting SPASS-SCL-FOL A Little Less Naive, considering 37 atoms initially, heuristics mode: resolution_2 ===
% 1.23/0.77
% 1.23/0.77 === Clause set with instances from active satisfied. Growing active. New size: 43
% 1.23/0.77 === Restarting.
% 1.23/0.77 === Backtracking. Learning clause 20:6:3:[10.1,11.1]:TopTopTop: organization(skc2,x0),reorganization_free(skc2,skc7,x0),reproducibility(skc2,x1,skc7),reproducibility(skc2,x2,x0),greater(x0,skc7) -> greater(x2,x1)
% 1.23/0.77 === Backtracking. Learning clause 21:1:0:[1.1,11.1]:: -> reproducibility(skc2,skf1(skc2,skc7),skc7)
% 1.23/0.77 === Clause set with instances from active satisfied. Growing active. New size: 49
% 1.23/0.77 === Restarting.
% 1.23/0.77 === Backtracking. Learning clause 22:6:3:[10.2,12.1]:TopTopTop: organization(skc2,x0),reorganization_free(skc2,x0,skc8),reproducibility(skc2,x1,x0),reproducibility(skc2,x2,skc8),greater(skc8,x0) -> greater(x2,x1)
% 1.23/0.77 === Conflict found: 22:6:3:[10.2,12.1]:TopTopTop: organization(skc2,x0),reorganization_free(skc2,x0,skc8),reproducibility(skc2,x1,x0),reproducibility(skc2,x2,skc8),greater(skc8,x0) -> greater(x2,x1) {x0 -> skc7, x1 -> skc2, x2 -> skc2}
% 1.23/0.77 === Backtracking. Learning clause 25:3:2:[13.0,23.0,18.0,24.3,22.1,11.1]:TopTop: reproducibility(skc2,x0,skc7),reproducibility(skc2,x1,skc8) -> greater(x1,x0)
% 1.23/0.77 === Clause set with instances from active satisfied. Growing active. New size: 49
% 1.23/0.77 === Restarting.
% 1.23/0.77 === Clause set with instances from active satisfied. Growing active. New size: 50
% 1.23/0.77 === Restarting.
% 1.23/0.77 === Backtracking. Learning clause 27:7:7:[11.0,26.0,9.3,14.1]:TopTopTopTopTopTopTop: organization(x0,x1),reliability(x0,x2,x1),accountability(skc2,x3,skc7),accountability(x0,x4,x1),reproducibility(skc2,x5,skc7),reproducibility(x0,x6,x1) -> ren2(x6,x5,x2,skc3,x4,x3)
% 1.23/0.77 === Clause set with instances from active satisfied. Growing active. New size: 114
% 1.23/0.77 === Clause set with instances from active satisfied. Growing active. New size: 116
% 1.23/0.77 === Restarting.
% 1.23/0.77 === Backtracking. Learning clause 29:7:7:[12.0,28.1,9.4,15.1]:TopTopTopTopTopTopTop: organization(x0,x1),reliability(x0,x2,x1),accountability(x0,x3,x1),accountability(skc2,x4,skc8),reproducibility(x0,x5,x1),reproducibility(skc2,x6,skc8) -> ren2(x6,x5,skc4,x2,x4,x3)
% 1.23/0.77 === Conflict found: 27:7:7:[11.0,26.0,9.3,14.1]:TopTopTopTopTopTopTop: organization(x0,x1),reliability(x0,x2,x1),accountability(skc2,x3,skc7),accountability(x0,x4,x1),reproducibility(skc2,x5,skc7),reproducibility(x0,x6,x1) -> ren2(x6,x5,x2,skc3,x4,x3) {x0 -> skc2, x1 -> skc8, x2 -> skc4, x3 -> skc2, x4 -> skc2, x5 -> skc2, x6 -> skc2}
% 1.23/0.77 === Backtracking. Learning clause 31:5:4:[12.0,30.0,27.2,15.1]:TopTopTopTop: accountability(skc2,x0,skc7),accountability(skc2,x1,skc8),reproducibility(skc2,x2,skc7),reproducibility(skc2,x3,skc8) -> ren2(x3,x2,skc4,skc3,x1,x0)
% 1.23/0.77 === Clause set with instances from active satisfied. Growing active. New size: 118
% 1.23/0.77 === Restarting.
% 1.23/0.77 === Backtracking. Learning clause 33:7:7:[11.0,32.0,9.5,16.1]:TopTopTopTopTopTopTop: organization(x0,x1),reliability(skc2,x2,skc7),reliability(x0,x3,x1),accountability(x0,x4,x1),reproducibility(skc2,x5,skc7),reproducibility(x0,x6,x1) -> ren2(x6,x5,x3,x2,x4,skc5)
% 1.23/0.77 === Conflict found: 27:7:7:[11.0,26.0,9.3,14.1]:TopTopTopTopTopTopTop: organization(x0,x1),reliability(x0,x2,x1),accountability(skc2,x3,skc7),accountability(x0,x4,x1),reproducibility(skc2,x5,skc7),reproducibility(x0,x6,x1) -> ren2(x6,x5,x2,skc3,x4,x3) {x0 -> skc2, x1 -> skc2, x2 -> skc2, x3 -> skc5, x4 -> skc2, x5 -> skc2, x6 -> skc2}
% 1.23/0.77 === Backtracking. Learning clause 34:6:6:[27.3,16.1]:TopTopTopTopTopTop: organization(x0,x1),reliability(x0,x2,x1),accountability(x0,x3,x1),reproducibility(skc2,x4,skc7),reproducibility(x0,x5,x1) -> ren2(x5,x4,x2,skc3,x3,skc5)
% 1.23/0.77 === Conflict found: 31:5:4:[12.0,30.0,27.2,15.1]:TopTopTopTop: accountability(skc2,x0,skc7),accountability(skc2,x1,skc8),reproducibility(skc2,x2,skc7),reproducibility(skc2,x3,skc8) -> ren2(x3,x2,skc4,skc3,x1,x0) {x0 -> skc5, x1 -> skc2, x2 -> skc2, x3 -> skc2}
% 1.23/0.77 === Backtracking. Learning clause 35:4:3:[31.1,16.1]:TopTopTop: accountability(skc2,x0,skc8),reproducibility(skc2,x1,skc7),reproducibility(skc2,x2,skc8) -> ren2(x2,x1,skc4,skc3,x0,skc5)
% 1.23/0.77 === Clause set with instances from active satisfied. Growing active. New size: 125
% 1.23/0.77 === Restarting.
% 1.23/0.77 === Backtracking. Learning clause 37:7:7:[12.0,36.1,9.6,17.1]:TopTopTopTopTopTopTop: organization(x0,x1),reliability(x0,x2,x1),reliability(skc2,x3,skc8),accountability(x0,x4,x1),reproducibility(x0,x5,x1),reproducibility(skc2,x6,skc8) -> ren2(x6,x5,x3,x2,skc6,x4)
% 1.23/0.77 === Conflict found: 27:7:7:[11.0,26.0,9.3,14.1]:TopTopTopTopTopTopTop: organization(x0,x1),reliability(x0,x2,x1),accountability(skc2,x3,skc7),accountability(x0,x4,x1),reproducibility(skc2,x5,skc7),reproducibility(x0,x6,x1) -> ren2(x6,x5,x2,skc3,x4,x3) {x0 -> skc2, x1 -> skc8, x2 -> skc2, x3 -> skc5, x4 -> skc6, x5 -> skc2, x6 -> skc2}
% 1.23/0.77 === Backtracking. Learning clause 39:4:3:[12.0,38.0,27.4,17.1,16.1]:TopTopTop: reliability(skc2,x0,skc8),reproducibility(skc2,x1,skc7),reproducibility(skc2,x2,skc8) -> ren2(x2,x1,x0,skc3,skc6,skc5)
% 1.23/0.77 === Conflict found: 35:4:3:[31.1,16.1]:TopTopTop: accountability(skc2,x0,skc8),reproducibility(skc2,x1,skc7),reproducibility(skc2,x2,skc8) -> ren2(x2,x1,skc4,skc3,x0,skc5) {x0 -> skc6, x1 -> skc2, x2 -> skc2}
% 1.23/0.77 === Backtracking. Learning clause 40:3:2:[35.1,17.1]:TopTop: reproducibility(skc2,x0,skc7),reproducibility(skc2,x1,skc8) -> ren2(x1,x0,skc4,skc3,skc6,skc5)
% 1.23/0.77 === Clause set with instances from active satisfied. Growing active. New size: 127
% 1.23/0.77 === Restarting.
% 1.23/0.77 === Backtracking. Learning clause 41:2:2:[4.1,18.1]:TopTop: greater(x0,x1) -> ren1(skc8,skc7,x0,x1)
% 1.23/0.77 === Clause set with instances from active satisfied. Growing active. New size: 191
% 1.23/0.77 === Backtracking. Learning clause 42:3:6:[2.1,5.3]:TopTopTopTopTopTop: ren2(x0,x1,x2,x3,x4,x5),greater(x0,x1) -> greater(x2,x3)
% 1.23/0.77
% 1.23/0.77 SZS status Unsatisfiable
% 1.23/0.77
% 1.23/0.77 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.23/0.77
% 1.23/0.77 SPASS-SCL-FOL Statistics:
% 1.23/0.77 Number of learned clauses: 15
% 1.23/0.77 Number of propagations: 359
% 1.23/0.77 Number of decisions: 542
% 1.23/0.77 Number of resolutions: 30
% 1.23/0.77 Number of condensations: 0
% 1.23/0.77 Number of sub resolutions: 8
% 1.23/0.77 Number of input literals (deduplicated): 19
% 1.23/0.77 Number of grows: 10
% 1.23/0.77 Number of considered ground atoms: 191
% 1.23/0.77
% 1.23/0.77 Needed: 0:00:00.25
% 1.23/0.77
%------------------------------------------------------------------------------