%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT003+1 : TPTP v9.3.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n003.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.15s 0.38s
% Output : Proof 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 39 ( 8 unt; 1 def)
% Number of atoms : 178 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 213 ( 74 ~; 69 |; 57 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 137 ( 5 sgn 80 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
fof(mp4,axiom,
! [X1,X2,X3] :
( reorganization_free(X1,X2,X3)
=> ( reorganization_free(X1,X2,X2)
& reorganization_free(X1,X3,X3) ) ),
file('theBenchmark.p',mp4) ).
% FOF SIMPLE INFERENCE
fof(mp4_elimTB,axiom,
! [X1,X2,X3] :
( reorganization_free(X1,X2,X3)
=> ( reorganization_free(X1,X2,X2)
& reorganization_free(X1,X3,X3) ) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[mp4])]) ).
% FOF INTRODUCE RENAMING
fof(ren1_defn,definition,
! [X1,X2,X3] :
( ren1(X1,X2,X3)
=> ( reorganization_free(X1,X2,X2)
& reorganization_free(X1,X3,X3) ) ),
introduced(definition,[new_symbols(definition,[ren1])],[mp4_elimTB]) ).
% FOF SIMPLE INFERENCE
fof(ren1_elimImpEquivPushNegMiniScope,plain,
! [X1,X2,X3] :
( ~ ren1(X1,X2,X3)
| ( reorganization_free(X1,X2,X2)
& reorganization_free(X1,X3,X3) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren1_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_2,plain,
( ~ ren1(X0,X1,X2)
| reorganization_free(X0,X2,X2) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren1_elimImpEquivPushNegMiniScope])]) ).
% FOF RENAMING INFERENCE
fof(mp4_renObv,axiom,
! [X1,X2,X3] :
( reorganization_free(X1,X2,X3)
=> ren1(X1,X2,X3) ),
inference(renaming,[status(esa)],[mp4_elimTB,ren1_defn]) ).
% FOF SIMPLE INFERENCE
fof(mp4_elimImpEquivPushNegMiniScope,axiom,
! [X1,X2,X3] :
( ~ reorganization_free(X1,X2,X3)
| ren1(X1,X2,X3) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[mp4_renObv]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_3,plain,
( ~ reorganization_free(X0,X1,X2)
| ren1(X0,X1,X2) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[mp4_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_1,plain,
( ~ ren1(X0,X1,X2)
| reorganization_free(X0,X1,X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren1_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(t1_FOL,hypothesis,
! [X1,X6,X2,X3,X7,X8,X9,X10] :
( ( organization(X1,X2)
& organization(X6,X3)
& reorganization_free(X1,X2,X2)
& reorganization_free(X6,X3,X3)
& inertia(X1,X7,X2)
& inertia(X6,X8,X3)
& survival_chance(X1,X9,X2)
& survival_chance(X6,X10,X3)
& greater(X8,X7) )
=> greater(X10,X9) ),
file('theBenchmark.p',t1_FOL) ).
% FOF SIMPLE INFERENCE
fof(t1_FOL_elimTB,hypothesis,
! [X1,X2,X3,X4,X5,X6,X7,X8] :
( ( organization(X1,X3)
& organization(X2,X4)
& reorganization_free(X1,X3,X3)
& reorganization_free(X2,X4,X4)
& inertia(X1,X5,X3)
& inertia(X2,X6,X4)
& survival_chance(X1,X7,X3)
& survival_chance(X2,X8,X4)
& greater(X6,X5) )
=> greater(X8,X7) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[t1_FOL])]) ).
% FOF SIMPLE INFERENCE
fof(t1_FOL_elimImpEquivPushNegMiniScope,hypothesis,
! [X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ organization(X1,X3)
| ~ organization(X2,X4)
| ~ reorganization_free(X1,X3,X3)
| ~ reorganization_free(X2,X4,X4)
| ~ inertia(X1,X5,X3)
| ~ inertia(X2,X6,X4)
| ~ survival_chance(X1,X7,X3)
| ~ survival_chance(X2,X8,X4)
| ~ greater(X6,X5)
| greater(X8,X7) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[t1_FOL_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_5,plain,
( ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ inertia(X0,X4,X1)
| ~ inertia(X2,X5,X3)
| ~ survival_chance(X0,X6,X1)
| ~ survival_chance(X2,X7,X3)
| ~ greater(X5,X4)
| greater(X7,X6) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t1_FOL_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(mp5,axiom,
! [X1,X4] :
( organization(X1,X4)
=> ? [X5] : inertia(X1,X5,X4) ),
file('theBenchmark.p',mp5) ).
% FOF SIMPLE INFERENCE
fof(mp5_elimTB,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X3] : inertia(X1,X3,X2) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[mp5])]) ).
% FOF SIMPLE INFERENCE
fof(mp5_elimImpEquivPushNegMiniScope,axiom,
! [X1,X2] :
( ~ organization(X1,X2)
| ? [X3] : inertia(X1,X3,X2) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[mp5_elimTB]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(mp5_skol,axiom,
! [X1,X2] :
( ~ organization(X1,X2)
| inertia(X1,skf1(X1,X2),X2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skf1]),skolemize(X3,skf1(X1,X2))],[mp5_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_4,plain,
( ~ organization(X0,X1)
| inertia(X0,skf1(X0,X1),X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[mp5_skol])]) ).
% FILE RECORD
fof(t2_FOL,hypothesis,
! [X1,X7,X8,X2,X3] :
( ( organization(X1,X2)
& organization(X1,X3)
& reorganization_free(X1,X2,X3)
& inertia(X1,X7,X2)
& inertia(X1,X8,X3)
& greater(X3,X2) )
=> greater(X8,X7) ),
file('theBenchmark.p',t2_FOL) ).
% FOF SIMPLE INFERENCE
fof(t2_FOL_elimTB,hypothesis,
! [X1,X2,X3,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& inertia(X1,X2,X4)
& inertia(X1,X3,X5)
& greater(X5,X4) )
=> greater(X3,X2) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[t2_FOL])]) ).
% FOF SIMPLE INFERENCE
fof(t2_FOL_elimImpEquivPushNegMiniScope,hypothesis,
! [X1,X2,X3] :
( ! [X4,X5] :
( ~ organization(X1,X4)
| ~ organization(X1,X5)
| ~ reorganization_free(X1,X4,X5)
| ~ inertia(X1,X2,X4)
| ~ inertia(X1,X3,X5)
| ~ greater(X5,X4) )
| greater(X3,X2) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[t2_FOL_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_6,plain,
( ~ organization(X0,X1)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X1,X2)
| ~ inertia(X0,X3,X1)
| ~ inertia(X0,X4,X2)
| ~ greater(X2,X1)
| greater(X4,X3) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t2_FOL_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_14,plain,
( ~ organization(X0,X1)
| ~ reorganization_free(X0,X1,X2)
| ~ inertia(X0,X3,X1)
| ~ greater(X2,X1)
| ~ organization(X0,X2)
| greater(skf1(X0,X2),X3) ),
inference(resolution,[status(thm)],[c_6,c_4]) ).
% CNF SPASS RESOLUTION.
cnf(c_15,plain,
( ~ organization(X0,X1)
| ~ reorganization_free(X0,X1,X1)
| ~ inertia(X0,X4,X1)
| ~ survival_chance(X0,X5,X1)
| ~ survival_chance(X2,X6,X3)
| ~ ren1(X2,X3,X7)
| ~ organization(X2,X8)
| ~ reorganization_free(X2,X8,X3)
| ~ inertia(X2,X4,X8)
| ~ greater(X3,X8)
| ~ organization(X2,X3)
| greater(X6,X5) ),
inference(resolution,[status(thm)],[c_5,c_1,c_4,c_14]) ).
% CNF SPASS RESOLUTION.
cnf(c_16,plain,
( ~ reorganization_free(X0,X1,X1)
| ~ survival_chance(X0,X2,X1)
| ~ survival_chance(X0,X3,X4)
| ~ ren1(X0,X4,X5)
| ~ reorganization_free(X0,X1,X4)
| ~ greater(X4,X1)
| ~ organization(X0,X4)
| ~ organization(X0,X1)
| greater(X3,X2) ),
inference(resolution,[status(thm)],[c_15,c_4]) ).
% CNF SPASS RESOLUTION.
cnf(c_17,plain,
( ~ survival_chance(X0,X1,X2)
| ~ survival_chance(X0,X3,X4)
| ~ reorganization_free(X0,X2,X4)
| ~ greater(X4,X2)
| ~ organization(X0,X4)
| ~ organization(X0,X2)
| ~ reorganization_free(X0,X4,X5)
| greater(X3,X1) ),
inference(resolution,[status(thm)],[c_1,c_3,c_16,c_3]) ).
% FILE RECORD
fof(t3_FOL,conjecture,
! [X1,X9,X10,X2,X3] :
( ( organization(X1,X2)
& organization(X1,X3)
& reorganization_free(X1,X2,X3)
& survival_chance(X1,X9,X2)
& survival_chance(X1,X10,X3)
& greater(X3,X2) )
=> greater(X10,X9) ),
file('theBenchmark.p',t3_FOL) ).
% NEGATING CONJECTURE
fof(t3_FOL_nc,negated_conjecture,
~ ! [X1,X9,X10,X2,X3] :
( ( organization(X1,X2)
& organization(X1,X3)
& reorganization_free(X1,X2,X3)
& survival_chance(X1,X9,X2)
& survival_chance(X1,X10,X3)
& greater(X3,X2) )
=> greater(X10,X9) ),
inference(negating_conjecture,[status(cth)],[t3_FOL]) ).
% FOF SIMPLE INFERENCE
fof(t3_FOL_nc_elimTB,negated_conjecture,
~ ! [X1,X2,X3,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& survival_chance(X1,X2,X4)
& survival_chance(X1,X3,X5)
& greater(X5,X4) )
=> greater(X3,X2) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[t3_FOL_nc])]) ).
% FOF SIMPLE INFERENCE
fof(t3_FOL_nc_elimImpEquivPushNegMiniScope,negated_conjecture,
? [X1,X2,X3] :
( ? [X4,X5] :
( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& survival_chance(X1,X2,X4)
& survival_chance(X1,X3,X5)
& greater(X5,X4) )
& ~ greater(X3,X2) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[t3_FOL_nc_elimTB]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(t3_FOL_nc_skol,negated_conjecture,
( organization(skc2,skc5)
& organization(skc2,skc6)
& reorganization_free(skc2,skc5,skc6)
& survival_chance(skc2,skc3,skc5)
& survival_chance(skc2,skc4,skc6)
& greater(skc6,skc5)
& ~ greater(skc4,skc3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skc2,skc3,skc4,skc5,skc6]),skolemize(X1,skc2),skolemize(X2,skc3),skolemize(X3,skc4),skolemize(X4,skc5),skolemize(X5,skc6)],[t3_FOL_nc_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_11,plain,
survival_chance(skc2,skc4,skc6),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t3_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_9,plain,
reorganization_free(skc2,skc5,skc6),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t3_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_10,plain,
survival_chance(skc2,skc3,skc5),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t3_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_13,plain,
~ greater(skc4,skc3),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t3_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_7,plain,
organization(skc2,skc5),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t3_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_8,plain,
organization(skc2,skc6),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t3_FOL_nc_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_12,plain,
greater(skc6,skc5),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[t3_FOL_nc_skol])]) ).
% CNF SPASS RESOLUTION.
cnf(c_18,plain,
$false,
inference(resolution,[status(thm)],[c_2,c_3,c_17,c_11,c_9,c_10,c_13,c_7,c_8,c_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT003+1 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n003.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 7 11:36:09 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.38
% 0.15/0.38 % Input Clauses:
% 0.15/0.38 % 1:2:3:INP:TopTopTop: ren1(x0,x1,x2) -> reorganization_free(x0,x1,x1)
% 0.15/0.38 % 2:2:3:INP:TopTopTop: ren1(x0,x1,x2) -> reorganization_free(x0,x2,x2)
% 0.15/0.38 % 3:2:3:INP:TopTopTop: reorganization_free(x0,x1,x2) -> ren1(x0,x1,x2)
% 0.15/0.38 % 4:2:2:INP:TopTop: organization(x0,x1) -> inertia(x0,skf1(x0,x1),x1)
% 0.15/0.38 % 5:10:8:INP:TopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x3),reorganization_free(x0,x1,x1),reorganization_free(x2,x3,x3),inertia(x0,x4,x1),inertia(x2,x5,x3),survival_chance(x0,x6,x1),survival_chance(x2,x7,x3),greater(x5,x4) -> greater(x7,x6)
% 0.15/0.38 % 6:7:5:INP:TopTopTopTopTop: organization(x0,x1),organization(x0,x2),reorganization_free(x0,x1,x2),inertia(x0,x3,x1),inertia(x0,x4,x2),greater(x2,x1) -> greater(x4,x3)
% 0.15/0.38 % 7:1:0:INP:: -> organization(skc2,skc5)
% 0.15/0.38 % 8:1:0:INP:: -> organization(skc2,skc6)
% 0.15/0.38 % 9:1:0:INP:: -> reorganization_free(skc2,skc5,skc6)
% 0.15/0.38 % 10:1:0:INP:: -> survival_chance(skc2,skc3,skc5)
% 0.15/0.38 % 11:1:0:INP:: -> survival_chance(skc2,skc4,skc6)
% 0.15/0.38 % 12:1:0:INP:: -> greater(skc6,skc5)
% 0.15/0.38 % 13:1:0:INP:: greater(skc4,skc3) ->
% 0.15/0.38
% 0.15/0.38 % Predicates: reorganization_free organization inertia survival_chance greater ren1
% 0.15/0.38 % Fol Constants: skc2 skc3 skc4 skc5 skc6
% 0.15/0.38 % Fol Functions: skf1
% 0.15/0.38 % Problem Properties:
% 0.15/0.38 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.15/0.38
% 0.15/0.38
% 0.15/0.38 % Reduced Input Axiom Clauses:
% 0.15/0.38 % 1:2:3:INP:TopTopTop: ren1(x0,x1,x2) -> reorganization_free(x0,x1,x1)
% 0.15/0.38 % 2:2:3:INP:TopTopTop: ren1(x0,x1,x2) -> reorganization_free(x0,x2,x2)
% 0.15/0.38 % 3:2:3:INP:TopTopTop: reorganization_free(x0,x1,x2) -> ren1(x0,x1,x2)
% 0.15/0.38 % 4:2:2:INP:TopTop: organization(x0,x1) -> inertia(x0,skf1(x0,x1),x1)
% 0.15/0.38
% 0.15/0.38 % Reduced Input Conjecture Clauses:
% 0.15/0.38 % 5:10:8:INP:TopTopTopTopTopTopTopTop: organization(x0,x1),organization(x2,x3),reorganization_free(x0,x1,x1),reorganization_free(x2,x3,x3),inertia(x0,x4,x1),inertia(x2,x5,x3),survival_chance(x0,x6,x1),survival_chance(x2,x7,x3),greater(x5,x4) -> greater(x7,x6)
% 0.15/0.38 % 6:7:5:INP:TopTopTopTopTop: organization(x0,x1),organization(x0,x2),reorganization_free(x0,x1,x2),inertia(x0,x3,x1),inertia(x0,x4,x2),greater(x2,x1) -> greater(x4,x3)
% 0.15/0.38 % 7:1:0:INP:: -> organization(skc2,skc5)
% 0.15/0.38 % 8:1:0:INP:: -> organization(skc2,skc6)
% 0.15/0.38 % 9:1:0:INP:: -> reorganization_free(skc2,skc5,skc6)
% 0.15/0.38 % 10:1:0:INP:: -> survival_chance(skc2,skc3,skc5)
% 0.15/0.38 % 11:1:0:INP:: -> survival_chance(skc2,skc4,skc6)
% 0.15/0.38 % 12:1:0:INP:: -> greater(skc6,skc5)
% 0.15/0.38 % 13:1:0:INP:: greater(skc4,skc3) ->
% 0.15/0.38
% 0.15/0.38
% 0.15/0.38 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 33 atoms initially. Used heuristic: lmodel_grow ===
% 0.15/0.38
% 0.15/0.38
% 0.15/0.38
% 0.15/0.38 % SZS status Theorem
% 0.15/0.38 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.38
% 0.15/0.38 % SPASS-SCL-FOL Statistics:
% 0.15/0.38 % Number of learned clauses: 4
% 0.15/0.38 % Number of propagations: 36
% 0.15/0.38 % Number of decisions: 19
% 0.15/0.38 % Number of resolutions: 17
% 0.15/0.38 % Number of condensations: 1
% 0.15/0.38 % Number of sub resolutions: 0
% 0.15/0.38
% 0.15/0.38 % Solver is done. Empty clause found
% 0.15/0.38
% 0.15/0.38 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.15/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.38 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.15/0.38
% 0.15/0.38
% 0.15/0.38 % Needed: 0:00:00.01
% 0.15/0.38
% 0.15/0.38 % ###
% 0.15/0.38 % ### Pagesize: 8192
% 0.15/0.38 % ### Marksize: 0
% 0.15/0.38 % ### Memory demanded: 573 KBytes
% 0.15/0.38 % ### Memory freed: 573 KBytes
% 0.15/0.38 % ### Memory remaining: 0 Bytes
% 0.15/0.38 % ### Pages allocated: 161 Pages
% 0.15/0.38 % ###
%------------------------------------------------------------------------------