%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT004+1 : TPTP v9.3.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 8 06:20:03 AM UTC 2026
% Result : Theorem 0.35s 0.60s
% Output : Proof 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 43 ( 10 unt; 1 def)
% Number of atoms : 254 ( 0 equ)
% Maximal formula atoms : 23 ( 5 avg)
% Number of connectives : 330 ( 119 ~; 112 |; 86 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 209 ( 8 sgn 111 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
fof(a6_FOL,hypothesis,
! [X1,X6,X7,X8,X9,X12,X13,X14,X15] :
( ( organization(X1,X12)
& organization(X1,X13)
& reorganization(X1,X14,X15)
& reliability(X1,X6,X12)
& reliability(X1,X7,X13)
& accountability(X1,X8,X12)
& accountability(X1,X9,X13)
& ~ greater(X14,X12)
& greater(X13,X12)
& ~ greater(X13,X15) )
=> ( greater(X6,X7)
& greater(X8,X9) ) ),
file('theBenchmark.p',a6_FOL) ).
% FOF SIMPLE INFERENCE
fof(a6_FOL_elimTB,hypothesis,
! [X1,X2,X3,X4,X5,X6,X7,X8,X9] :
( ( organization(X1,X6)
& organization(X1,X7)
& reorganization(X1,X8,X9)
& reliability(X1,X2,X6)
& reliability(X1,X3,X7)
& accountability(X1,X4,X6)
& accountability(X1,X5,X7)
& ~ greater(X8,X6)
& greater(X7,X6)
& ~ greater(X7,X9) )
=> ( greater(X2,X3)
& greater(X4,X5) ) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[a6_FOL])]) ).
% FOF INTRODUCE RENAMING
fof(ren1_defn,definition,
! [X2,X3,X4,X5] :
( ren1(X2,X3,X4,X5)
=> ( greater(X2,X3)
& greater(X4,X5) ) ),
introduced(definition,[new_symbols(definition,[ren1])],[a6_FOL_elimTB]) ).
% FOF RENAMING INFERENCE
fof(a6_FOL_renObv,hypothesis,
! [X1,X2,X3,X4,X5,X6,X7,X8,X9] :
( ( organization(X1,X6)
& organization(X1,X7)
& reorganization(X1,X8,X9)
& reliability(X1,X2,X6)
& reliability(X1,X3,X7)
& accountability(X1,X4,X6)
& accountability(X1,X5,X7)
& ~ greater(X8,X6)
& greater(X7,X6)
& ~ greater(X7,X9) )
=> ren1(X2,X3,X4,X5) ),
inference(renaming,[status(esa)],[a6_FOL_elimTB,ren1_defn]) ).
% FOF SIMPLE INFERENCE
fof(a6_FOL_elimImpEquivPushNegMiniScope,hypothesis,
! [X1,X2,X3,X4,X5] :
( ! [X6,X7,X8,X9] :
( ~ organization(X1,X6)
| ~ organization(X1,X7)
| ~ reorganization(X1,X8,X9)
| ~ reliability(X1,X2,X6)
| ~ reliability(X1,X3,X7)
| ~ accountability(X1,X4,X6)
| ~ accountability(X1,X5,X7)
| greater(X8,X6)
| ~ greater(X7,X6)
| greater(X7,X9) )
| ren1(X2,X3,X4,X5) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[a6_FOL_renObv]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_6,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization(X0,X3,X4)
| ~ reliability(X0,X5,X1)
| ~ reliability(X0,X6,X2)
| ~ accountability(X0,X7,X1)
| ~ accountability(X0,X8,X2)
| ~ greater(X2,X1)
| greater(X3,X1)
| greater(X2,X4)
| ren1(X5,X6,X7,X8) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[a6_FOL_elimImpEquivPushNegMiniScope])]) ).
% FOF SIMPLE INFERENCE
fof(ren1_elimImpEquivPushNegMiniScope,plain,
! [X1,X2,X3,X4] :
( ~ ren1(X1,X2,X3,X4)
| ( greater(X1,X2)
& greater(X3,X4) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren1_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_4,plain,
( ~ ren1(X0,X1,X2,X3)
| greater(X0,X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren1_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_16,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization(X0,X3,X4)
| ~ reliability(X0,X5,X1)
| ~ reliability(X0,X6,X2)
| ~ accountability(X0,X7,X1)
| ~ accountability(X0,X8,X2)
| ~ greater(X2,X1)
| greater(X3,X1)
| greater(X2,X4)
| greater(X5,X6) ),
inference(resolution,[status(thm)],[c_6,c_4]) ).
% FILE RECORD
fof(mp2,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X4] : accountability(X1,X4,X2) ),
file('theBenchmark.p',mp2) ).
% FOF SIMPLE INFERENCE
fof(mp2_elimTB,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X3] : accountability(X1,X3,X2) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[mp2])]) ).
% FOF SIMPLE INFERENCE
fof(mp2_elimImpEquivPushNegMiniScope,axiom,
! [X1,X2] :
( ~ organization(X1,X2)
| ? [X3] : accountability(X1,X3,X2) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[mp2_elimTB]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(mp2_skol,axiom,
! [X1,X2] :
( ~ organization(X1,X2)
| accountability(X1,skf2(X1,X2),X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skf2]),skolemize(X3,skf2(X1,X2))],[mp2_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_2,plain,
( ~ organization(X0,X1)
| accountability(X0,skf2(X0,X1),X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[mp2_skol])]) ).
% FILE RECORD
fof(a1_FOL,hypothesis,
! [X1,X5,X6,X7,X8,X9,X10,X11,X12,X13] :
( ( organization(X1,X12)
& organization(X5,X13)
& reliability(X1,X6,X12)
& reliability(X5,X7,X13)
& accountability(X1,X8,X12)
& accountability(X5,X9,X13)
& survival_chance(X1,X10,X12)
& survival_chance(X5,X11,X13)
& greater(X7,X6)
& greater(X9,X8) )
=> greater(X11,X10) ),
file('theBenchmark.p',a1_FOL) ).
% FOF SIMPLE INFERENCE
fof(a1_FOL_elimTB,hypothesis,
! [X1,X2,X3,X4,X5,X6,X7,X8,X9,X10] :
( ( organization(X1,X9)
& organization(X2,X10)
& reliability(X1,X3,X9)
& reliability(X2,X4,X10)
& accountability(X1,X5,X9)
& accountability(X2,X6,X10)
& survival_chance(X1,X7,X9)
& survival_chance(X2,X8,X10)
& greater(X4,X3)
& greater(X6,X5) )
=> greater(X8,X7) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[a1_FOL])]) ).
% FOF SIMPLE INFERENCE
fof(a1_FOL_elimImpEquivPushNegMiniScope,hypothesis,
! [X1,X2,X3,X4,X5,X6,X7,X8] :
( ! [X9,X10] :
( ~ organization(X1,X9)
| ~ organization(X2,X10)
| ~ reliability(X1,X3,X9)
| ~ reliability(X2,X4,X10)
| ~ accountability(X1,X5,X9)
| ~ accountability(X2,X6,X10)
| ~ survival_chance(X1,X7,X9)
| ~ survival_chance(X2,X8,X10)
| ~ greater(X4,X3)
| ~ greater(X6,X5) )
| greater(X8,X7) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[a1_FOL_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_3,plain,
( ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ reliability(X0,X4,X1)
| ~ reliability(X2,X5,X3)
| ~ accountability(X0,X6,X1)
| ~ accountability(X2,X7,X3)
| ~ survival_chance(X0,X8,X1)
| ~ survival_chance(X2,X9,X3)
| ~ greater(X5,X4)
| ~ greater(X7,X6)
| greater(X9,X8) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[a1_FOL_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_5,plain,
( ~ ren1(X0,X1,X2,X3)
| greater(X2,X3) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren1_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(mp1,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X3] : reliability(X1,X3,X2) ),
file('theBenchmark.p',mp1) ).
% FOF SIMPLE INFERENCE
fof(mp1_elimTB,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X3] : reliability(X1,X3,X2) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[mp1])]) ).
% FOF SIMPLE INFERENCE
fof(mp1_elimImpEquivPushNegMiniScope,axiom,
! [X1,X2] :
( ~ organization(X1,X2)
| ? [X3] : reliability(X1,X3,X2) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[mp1_elimTB]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(mp1_skol,axiom,
! [X1,X2] :
( ~ organization(X1,X2)
| reliability(X1,skf1(X1,X2),X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skf1]),skolemize(X3,skf1(X1,X2))],[mp1_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_1,plain,
( ~ organization(X0,X1)
| reliability(X0,skf1(X0,X1),X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[mp1_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_17,plain,
( ~ reorganization(X0,X3,X4)
| ~ accountability(X0,X5,X1)
| ~ accountability(X0,X6,X2)
| ~ greater(X2,X1)
| ~ organization(X0,X1)
| ~ organization(X0,X2)
| greater(X5,X6)
| greater(X3,X1)
| greater(X2,X4) ),
inference(resolution,[status(thm)],[c_5,c_6,c_1,c_1]) ).
% CNF SPASS RESOLUTION.
cnf(c_18,plain,
( ~ organization(X0,X1)
| ~ reliability(X0,X4,X1)
| ~ reliability(X2,X5,X3)
| ~ accountability(X0,X6,X1)
| ~ survival_chance(X0,X7,X1)
| ~ survival_chance(X2,X8,X3)
| ~ greater(X5,X4)
| ~ reorganization(X2,X9,X10)
| ~ accountability(X2,X6,X11)
| ~ greater(X11,X3)
| ~ organization(X2,X11)
| ~ organization(X2,X3)
| greater(X8,X7)
| greater(X9,X3)
| greater(X11,X10) ),
inference(resolution,[status(thm)],[c_3,c_17,c_2]) ).
% CNF SPASS RESOLUTION.
cnf(c_19,plain,
( ~ organization(X0,X2)
| ~ reorganization(X0,X3,X4)
| ~ reliability(X0,X5,X1)
| ~ reliability(X0,X6,X2)
| ~ accountability(X0,X7,X2)
| ~ greater(X2,X1)
| ~ organization(X0,X1)
| ~ organization(X8,X9)
| ~ reliability(X8,X6,X9)
| ~ reliability(X10,X5,X11)
| ~ accountability(X8,X12,X9)
| ~ survival_chance(X8,X13,X9)
| ~ survival_chance(X10,X14,X11)
| ~ reorganization(X10,X15,X16)
| ~ accountability(X10,X12,X17)
| ~ greater(X17,X11)
| ~ organization(X10,X17)
| ~ organization(X10,X11)
| greater(X3,X1)
| greater(X2,X4)
| greater(X14,X13)
| greater(X15,X11)
| greater(X17,X16) ),
inference(resolution,[status(thm)],[c_16,c_2,c_18]) ).
% CNF SPASS RESOLUTION.
cnf(c_20,plain,
( ~ reorganization(X0,X1,X2)
| ~ greater(X3,X4)
| ~ accountability(X0,X5,X3)
| ~ survival_chance(X0,X6,X3)
| ~ survival_chance(X0,X7,X4)
| ~ organization(X0,X4)
| ~ organization(X0,X3)
| greater(X1,X4)
| greater(X3,X2)
| greater(X7,X6) ),
inference(resolution,[status(thm)],[c_19,c_1,c_1]) ).
% FILE RECORD
fof(t4_FOL,conjecture,
! [X1,X10,X11,X12,X13,X14,X15] :
( ( organization(X1,X12)
& organization(X1,X13)
& reorganization(X1,X14,X15)
& survival_chance(X1,X10,X12)
& survival_chance(X1,X11,X13)
& ~ greater(X14,X12)
& greater(X13,X12)
& ~ greater(X13,X15) )
=> greater(X10,X11) ),
file('theBenchmark.p',t4_FOL) ).
% NEGATING CONJECTURE
fof(t4_FOL_nc,negated_conjecture,
~ ! [X1,X10,X11,X12,X13,X14,X15] :
( ( organization(X1,X12)
& organization(X1,X13)
& reorganization(X1,X14,X15)
& survival_chance(X1,X10,X12)
& survival_chance(X1,X11,X13)
& ~ greater(X14,X12)
& greater(X13,X12)
& ~ greater(X13,X15) )
=> greater(X10,X11) ),
inference(negating_conjecture,[status(cth)],[t4_FOL]) ).
% FOF SIMPLE INFERENCE
fof(t4_FOL_nc_elimTB,negated_conjecture,
~ ! [X1,X2,X3,X4,X5,X6,X7] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization(X1,X6,X7)
& survival_chance(X1,X2,X4)
& survival_chance(X1,X3,X5)
& ~ greater(X6,X4)
& greater(X5,X4)
& ~ greater(X5,X7) )
=> greater(X2,X3) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[t4_FOL_nc])]) ).
% FOF SIMPLE INFERENCE
fof(t4_FOL_nc_elimImpEquivPushNegMiniScope,negated_conjecture,
? [X1,X2,X3] :
( ? [X4,X5,X6,X7] :
( organization(X1,X4)
& organization(X1,X5)
& reorganization(X1,X6,X7)
& survival_chance(X1,X2,X4)
& survival_chance(X1,X3,X5)
& ~ greater(X6,X4)
& greater(X5,X4)
& ~ greater(X5,X7) )
& ~ greater(X2,X3) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[t4_FOL_nc_elimTB]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(t4_FOL_nc_skol,negated_conjecture,
( organization(skc3,skc6)
& organization(skc3,skc7)
& reorganization(skc3,skc8,skc9)
& survival_chance(skc3,skc4,skc6)
& survival_chance(skc3,skc5,skc7)
& ~ greater(skc8,skc6)
& greater(skc7,skc6)
& ~ greater(skc7,skc9)
& ~ greater(skc4,skc5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skc3,skc4,skc5,skc6,skc7,skc8,skc9]),skolemize(X1,skc3),skolemize(X2,skc4),skolemize(X3,skc5),skolemize(X4,skc6),skolemize(X5,skc7),skolemize(X6,skc8),skolemize(X7,skc9)],[t4_FOL_nc_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_9,plain,
reorganization(skc3,skc8,skc9),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t4_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_10,plain,
survival_chance(skc3,skc4,skc6),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t4_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_11,plain,
survival_chance(skc3,skc5,skc7),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t4_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_12,plain,
~ greater(skc8,skc6),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t4_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_14,plain,
~ greater(skc7,skc9),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t4_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_15,plain,
~ greater(skc4,skc5),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t4_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_7,plain,
organization(skc3,skc6),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t4_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_8,plain,
organization(skc3,skc7),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t4_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_13,plain,
greater(skc7,skc6),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t4_FOL_nc_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_21,plain,
$false,
inference(resolution,[status(thm)],[c_20,c_2,c_9,c_10,c_11,c_12,c_14,c_15,c_7,c_8,c_13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT004+1 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 % Computer : n017.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 7 11:30:54 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.35/0.60
% 0.35/0.60 % Input Clauses:
% 0.35/0.60 % 1:2:2:INP:TopTop: organization(x0,x1) -> reliability(x0,skf1(x0,x1),x1)
% 0.35/0.60 % 2:2:2:INP:TopTop: organization(x0,x1) -> accountability(x0,skf2(x0,x1),x1)
% 0.35/0.60 % 3:11:10:INP:TopTopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x3),reliability(x0,x4,x1),reliability(x2,x5,x3),accountability(x0,x6,x1),accountability(x2,x7,x3),survival_chance(x0,x8,x1),survival_chance(x2,x9,x3),greater(x5,x4),greater(x7,x6) -> greater(x9,x8)
% 0.35/0.60 % 4:2:4:INP:TopTopTopTop: ren1(x0,x1,x2,x3) -> greater(x0,x1)
% 0.35/0.60 % 5:2:4:INP:TopTopTopTop: ren1(x0,x1,x2,x3) -> greater(x2,x3)
% 0.35/0.60 % 6:11:9:INP:TopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x0,x2),reorganization(x0,x3,x4),reliability(x0,x5,x1),reliability(x0,x6,x2),accountability(x0,x7,x1),accountability(x0,x8,x2),greater(x2,x1) -> greater(x3,x1),greater(x2,x4),ren1(x5,x6,x7,x8)
% 0.35/0.60 % 7:1:0:INP:: -> organization(skc3,skc6)
% 0.35/0.60 % 8:1:0:INP:: -> organization(skc3,skc7)
% 0.35/0.60 % 9:1:0:INP:: -> reorganization(skc3,skc8,skc9)
% 0.35/0.60 % 10:1:0:INP:: -> survival_chance(skc3,skc4,skc6)
% 0.35/0.60 % 11:1:0:INP:: -> survival_chance(skc3,skc5,skc7)
% 0.35/0.60 % 12:1:0:INP:: greater(skc8,skc6) ->
% 0.35/0.60 % 13:1:0:INP:: -> greater(skc7,skc6)
% 0.35/0.60 % 14:1:0:INP:: greater(skc7,skc9) ->
% 0.35/0.60 % 15:1:0:INP:: greater(skc4,skc5) ->
% 0.35/0.60
% 0.35/0.60 % Predicates: organization reliability accountability survival_chance greater reorganization ren1
% 0.35/0.60 % Fol Constants: skc3 skc4 skc5 skc6 skc7 skc8 skc9
% 0.35/0.60 % Fol Functions: skf1 skf2
% 0.35/0.60 % Problem Properties:
% 0.35/0.60 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.35/0.60
% 0.35/0.60
% 0.35/0.60 % Reduced Input Axiom Clauses:
% 0.35/0.60 % 1:2:2:INP:TopTop: organization(x0,x1) -> reliability(x0,skf1(x0,x1),x1)
% 0.35/0.60 % 2:2:2:INP:TopTop: organization(x0,x1) -> accountability(x0,skf2(x0,x1),x1)
% 0.35/0.60 % 4:2:4:INP:TopTopTopTop: ren1(x0,x1,x2,x3) -> greater(x0,x1)
% 0.35/0.60 % 5:2:4:INP:TopTopTopTop: ren1(x0,x1,x2,x3) -> greater(x2,x3)
% 0.35/0.60
% 0.35/0.60 % Reduced Input Conjecture Clauses:
% 0.35/0.60 % 3:11:10:INP:TopTopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x3),reliability(x0,x4,x1),reliability(x2,x5,x3),accountability(x0,x6,x1),accountability(x2,x7,x3),survival_chance(x0,x8,x1),survival_chance(x2,x9,x3),greater(x5,x4),greater(x7,x6) -> greater(x9,x8)
% 0.35/0.60 % 6:11:9:INP:TopTopTopTopTopTopTopTopTop: organization(x0,x1),organization(x0,x2),reorganization(x0,x3,x4),reliability(x0,x5,x1),reliability(x0,x6,x2),accountability(x0,x7,x1),accountability(x0,x8,x2),greater(x2,x1) -> greater(x3,x1),greater(x2,x4),ren1(x5,x6,x7,x8)
% 0.35/0.60 % 7:1:0:INP:: -> organization(skc3,skc6)
% 0.35/0.60 % 8:1:0:INP:: -> organization(skc3,skc7)
% 0.35/0.60 % 9:1:0:INP:: -> reorganization(skc3,skc8,skc9)
% 0.35/0.60 % 10:1:0:INP:: -> survival_chance(skc3,skc4,skc6)
% 0.35/0.60 % 11:1:0:INP:: -> survival_chance(skc3,skc5,skc7)
% 0.35/0.60 % 12:1:0:INP:: greater(skc8,skc6) ->
% 0.35/0.60 % 13:1:0:INP:: -> greater(skc7,skc6)
% 0.35/0.60 % 14:1:0:INP:: greater(skc7,skc9) ->
% 0.35/0.60 % 15:1:0:INP:: greater(skc4,skc5) ->
% 0.35/0.60
% 0.35/0.60
% 0.35/0.60 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 40 atoms initially. Used heuristic: lmodel_grow ===
% 0.35/0.60
% 0.35/0.60
% 0.35/0.60
% 0.35/0.60 % SZS status Theorem
% 0.35/0.60 % Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.35/0.60
% 0.35/0.60 % SPASS-SCL-FOL Statistics:
% 0.35/0.60 % Number of learned clauses: 5
% 0.35/0.60 % Number of propagations: 73
% 0.35/0.60 % Number of decisions: 38
% 0.35/0.60 % Number of resolutions: 20
% 0.35/0.60 % Number of condensations: 1
% 0.35/0.60 % Number of sub resolutions: 0
% 0.35/0.60
% 0.35/0.60 % Solver is done. Empty clause found
% 0.35/0.60
% 0.35/0.60 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.35/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 0.35/0.60 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.35/0.60
% 0.35/0.60
% 0.35/0.60 % Needed: 0:00:00.23
% 0.35/0.60
% 0.35/0.60 % ###
% 0.35/0.60 % ### Pagesize: 8192
% 0.35/0.60 % ### Marksize: 0
% 0.35/0.60 % ### Memory demanded: 2931 KBytes
% 0.35/0.60 % ### Memory freed: 2931 KBytes
% 0.35/0.60 % ### Memory remaining: 0 Bytes
% 0.35/0.60 % ### Pages allocated: 454 Pages
% 0.35/0.60 % ###
%------------------------------------------------------------------------------