%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT111+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp
% Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n010.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:16 AM UTC 2026
% Result : Theorem 0.12s 0.36s
% Output : Proof 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 44 ( 13 unt; 2 def)
% Number of atoms : 135 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 142 ( 51 ~; 45 |; 41 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 96 ( 16 sgn 34 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
fof(conjecture,conjecture,
? [X6] :
( permission(X6)
& bearer(X6,portal)
& cnt(X6,modify_act,theater_ds) ),
file('theBenchmark.p',conjecture) ).
% NEGATING CONJECTURE
fof(conjecture_nc,negated_conjecture,
~ ? [X6] :
( permission(X6)
& bearer(X6,portal)
& cnt(X6,modify_act,theater_ds) ),
inference(negating_conjecture,[status(cth)],[conjecture]) ).
% FOF SIMPLE INFERENCE
fof(conjecture_nc_elimTB,negated_conjecture,
~ ? [X1] :
( permission(X1)
& bearer(X1,portal)
& cnt(X1,modify_act,theater_ds) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[conjecture_nc])]) ).
% FOF SIMPLE INFERENCE
fof(conjecture_nc_elimImpEquivPushNegMiniScope,negated_conjecture,
! [X1] :
( ~ permission(X1)
| ~ bearer(X1,portal)
| ~ cnt(X1,modify_act,theater_ds) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[conjecture_nc_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_14,plain,
( ~ permission(X0)
| ~ bearer(X0,portal)
| ~ cnt(X0,modify_act,theater_ds) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[conjecture_nc_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(open_world_closure,axiom,
! [X3,X4,X5] :
( ( agent(X3)
& action(X4)
& target(X5)
& ~ ? [X1,X2] :
( proh(X1)
& aee(X1,X3)
& act(X1,X4)
& activates(X2,X1) ) )
=> ? [X6] :
( permission(X6)
& bearer(X6,X3)
& cnt(X6,X4,X5) ) ),
file('theBenchmark.p',open_world_closure) ).
% FOF SIMPLE INFERENCE
fof(open_world_closure_elimTB,axiom,
! [X1,X2,X3] :
( ( agent(X1)
& action(X2)
& target(X3)
& ~ ? [X4,X5] :
( proh(X4)
& aee(X4,X1)
& act(X4,X2)
& activates(X5,X4) ) )
=> ? [X6] :
( permission(X6)
& bearer(X6,X1)
& cnt(X6,X2,X3) ) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[open_world_closure])]) ).
% FOF INTRODUCE RENAMING
fof(ren2_defn,definition,
! [X6,X1,X2,X3] :
( ren2(X6,X1,X2,X3)
=> ( permission(X6)
& bearer(X6,X1)
& cnt(X6,X2,X3) ) ),
introduced(definition,[new_symbols(definition,[ren2])],[open_world_closure_elimTB]) ).
% FOF SIMPLE INFERENCE
fof(ren2_elimImpEquivPushNegMiniScope,plain,
! [X1,X2,X3,X4] :
( ~ ren2(X1,X2,X3,X4)
| ( permission(X1)
& bearer(X1,X2)
& cnt(X1,X3,X4) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren2_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_12,plain,
( ~ ren2(X0,X1,X2,X3)
| cnt(X0,X2,X3) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren2_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_11,plain,
( ~ ren2(X0,X1,X2,X3)
| bearer(X0,X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren2_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_10,plain,
( ~ ren2(X0,X1,X2,X3)
| permission(X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren2_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(action_modify,axiom,
action(modify_act),
file('theBenchmark.p',action_modify) ).
% FOF SIMPLE INFERENCE
fof(action_modify_elimTB,axiom,
action(modify_act),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[action_modify])]) ).
% FOF SIMPLE INFERENCE
fof(action_modify_elimImpEquivPushNegMiniScope,axiom,
action(modify_act),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[action_modify_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_3,plain,
action(modify_act),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[action_modify_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(agent_portal,axiom,
agent(portal),
file('theBenchmark.p',agent_portal) ).
% FOF SIMPLE INFERENCE
fof(agent_portal_elimTB,axiom,
agent(portal),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[agent_portal])]) ).
% FOF SIMPLE INFERENCE
fof(agent_portal_elimImpEquivPushNegMiniScope,axiom,
agent(portal),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[agent_portal_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_1,plain,
agent(portal),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[agent_portal_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(no_proh_modify,axiom,
~ ? [X1,X2] :
( proh(X1)
& aee(X1,portal)
& act(X1,modify_act)
& activates(X2,X1) ),
file('theBenchmark.p',no_proh_modify) ).
% FOF SIMPLE INFERENCE
fof(no_proh_modify_elimTB,axiom,
~ ? [X1,X2] :
( proh(X1)
& aee(X1,portal)
& act(X1,modify_act)
& activates(X2,X1) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[no_proh_modify])]) ).
% FOF SIMPLE INFERENCE
fof(no_proh_modify_elimImpEquivPushNegMiniScope,axiom,
! [X1] :
( ~ proh(X1)
| ~ aee(X1,portal)
| ~ act(X1,modify_act)
| ! [X2] : ~ activates(X2,X1) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[no_proh_modify_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_5,plain,
( ~ proh(X0)
| ~ aee(X0,portal)
| ~ act(X0,modify_act)
| ~ activates(X1,X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[no_proh_modify_elimImpEquivPushNegMiniScope])]) ).
% FOF INTRODUCE RENAMING
fof(ren1_defn,definition,
! [X4,X1,X2,X5] :
( ren1(X4,X1,X2,X5)
=> ( proh(X4)
& aee(X4,X1)
& act(X4,X2)
& activates(X5,X4) ) ),
introduced(definition,[new_symbols(definition,[ren1])],[open_world_closure_elimTB]) ).
% FOF SIMPLE INFERENCE
fof(ren1_elimImpEquivPushNegMiniScope,plain,
! [X1,X2,X3,X4] :
( ~ ren1(X1,X2,X3,X4)
| ( proh(X1)
& aee(X1,X2)
& act(X1,X3)
& activates(X4,X1) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ren1_defn]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_8,plain,
( ~ ren1(X0,X1,X2,X3)
| act(X0,X2) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren1_elimImpEquivPushNegMiniScope])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_7,plain,
( ~ ren1(X0,X1,X2,X3)
| aee(X0,X1) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren1_elimImpEquivPushNegMiniScope])]) ).
% FOF RENAMING INFERENCE
fof(open_world_closure_renObv,axiom,
! [X1,X2,X3] :
( ( agent(X1)
& action(X2)
& target(X3)
& ~ ? [X4,X5] : ren1(X4,X1,X2,X5) )
=> ? [X6] : ren2(X6,X1,X2,X3) ),
inference(renaming,[status(esa)],[open_world_closure_elimTB,ren1_defn,ren2_defn]) ).
% FOF SIMPLE INFERENCE
fof(open_world_closure_elimImpEquivPushNegMiniScope,axiom,
! [X1,X2,X3] :
( ~ agent(X1)
| ~ action(X2)
| ~ target(X3)
| ? [X4,X5] : ren1(X4,X1,X2,X5)
| ? [X6] : ren2(X6,X1,X2,X3) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[open_world_closure_renObv]) ).
% FOF SKOLEM INFERENCE. WIP!!
fof(open_world_closure_skol,axiom,
! [X1,X2,X3] :
( ~ agent(X1)
| ~ action(X2)
| ~ target(X3)
| ren1(skf1(X1,X2),X1,X2,skf2(X1,X2))
| ren2(skf3(X1,X2,X3),X1,X2,X3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[skf1,skf2,skf3]),skolemize(X4,skf1(X1,X2)),skolemize(X5,skf2(X1,X2)),skolemize(X6,skf3(X1,X2,X3))],[open_world_closure_elimImpEquivPushNegMiniScope]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_13,plain,
( ~ agent(X0)
| ~ action(X1)
| ~ target(X2)
| ren1(skf1(X0,X1),X0,X1,skf2(X0,X1))
| ren2(skf3(X0,X1,X2),X0,X1,X2) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[open_world_closure_skol])]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_9,plain,
( ~ ren1(X0,X1,X2,X3)
| activates(X3,X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren1_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_15,plain,
( ~ agent(X0)
| ~ action(X1)
| ~ target(X2)
| ren2(skf3(X0,X1,X2),X0,X1,X2)
| activates(skf2(X0,X1),skf1(X0,X1)) ),
inference(resolution,[status(thm)],[c_13,c_9]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_6,plain,
( ~ ren1(X0,X1,X2,X3)
| proh(X0) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ren1_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_18,plain,
( ~ agent(X0)
| ~ action(X1)
| ~ target(X2)
| proh(skf1(X0,X1))
| ren2(skf3(X0,X1,X2),X0,X1,X2) ),
inference(resolution,[status(thm)],[c_6,c_13]) ).
% CNF SPASS RESOLUTION.
cnf(c_19,plain,
( ~ agent(portal)
| ~ action(modify_act)
| ~ target(X0)
| ren2(skf3(portal,modify_act,X0),portal,modify_act,X0) ),
inference(resolution,[status(thm)],[c_5,c_8,c_7,c_13,c_15,c_18]) ).
% CNF SPASS RESOLUTION.
cnf(c_20,plain,
( ~ action(modify_act)
| ~ target(X0)
| ren2(skf3(portal,modify_act,X0),portal,modify_act,X0) ),
inference(resolution,[status(thm)],[c_1,c_19]) ).
% CNF SPASS RESOLUTION.
cnf(c_21,plain,
( ~ target(X0)
| ren2(skf3(portal,modify_act,X0),portal,modify_act,X0) ),
inference(resolution,[status(thm)],[c_3,c_20]) ).
% FILE RECORD
fof(target_theater,axiom,
target(theater_ds),
file('theBenchmark.p',target_theater) ).
% FOF SIMPLE INFERENCE
fof(target_theater_elimTB,axiom,
target(theater_ds),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[target_theater])]) ).
% FOF SIMPLE INFERENCE
fof(target_theater_elimImpEquivPushNegMiniScope,axiom,
target(theater_ds),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[target_theater_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_4,plain,
target(theater_ds),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[target_theater_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_24,plain,
$false,
inference(resolution,[status(thm)],[c_14,c_12,c_11,c_10,c_21,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT111+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n010.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 7 14:06:26 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36
% 0.12/0.36 % Input Clauses:
% 0.12/0.36 % 1:1:0:INP:: -> agent(portal)
% 0.12/0.36 % 2:1:0:INP:: -> agent(ensemble)
% 0.12/0.36 % 3:1:0:INP:: -> action(modify_act)
% 0.12/0.36 % 4:1:0:INP:: -> target(theater_ds)
% 0.12/0.36 % 5:4:2:INP:TopTop: proh(x0),aee(x0,portal),act(x0,modify_act),activates(x1,x0) ->
% 0.12/0.36 % 6:2:4:INP:TopTopTopTop: ren1(x0,x1,x2,x3) -> proh(x0)
% 0.12/0.36 % 7:2:4:INP:TopTopTopTop: ren1(x0,x1,x2,x3) -> aee(x0,x1)
% 0.12/0.36 % 8:2:4:INP:TopTopTopTop: ren1(x0,x1,x2,x3) -> act(x0,x2)
% 0.12/0.36 % 9:2:4:INP:TopTopTopTop: ren1(x0,x1,x2,x3) -> activates(x3,x0)
% 0.12/0.36 % 10:2:4:INP:TopTopTopTop: ren2(x0,x1,x2,x3) -> permission(x0)
% 0.12/0.36 % 11:2:4:INP:TopTopTopTop: ren2(x0,x1,x2,x3) -> bearer(x0,x1)
% 0.12/0.36 % 12:2:4:INP:TopTopTopTop: ren2(x0,x1,x2,x3) -> cnt(x0,x2,x3)
% 0.12/0.36 % 13:5:3:INP:TopTopTop: agent(x0),action(x1),target(x2) -> ren1(skf1(x0,x1),x0,x1,skf2(x0,x1)),ren2(skf3(x0,x1,x2),x0,x1,x2)
% 0.12/0.36 % 14:3:1:INP:Top: permission(x0),bearer(x0,portal),cnt(x0,modify_act,theater_ds) ->
% 0.12/0.36
% 0.12/0.36 % Predicates: agent action target proh aee act activates permission bearer cnt ren1 ren2
% 0.12/0.36 % Fol Constants: portal ensemble modify_act theater_ds
% 0.12/0.36 % Fol Functions: skf1 skf2 skf3
% 0.12/0.36 % Problem Properties:
% 0.12/0.36 % This is a full first-order problem without equality. The Problem is non-linear.
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 % Reduced Input Axiom Clauses:
% 0.12/0.36 % 1:1:0:INP:: -> agent(portal)
% 0.12/0.36 % 2:1:0:INP:: -> agent(ensemble)
% 0.12/0.36 % 3:1:0:INP:: -> action(modify_act)
% 0.12/0.36 % 4:1:0:INP:: -> target(theater_ds)
% 0.12/0.36 % 5:4:2:INP:TopTop: proh(x0),aee(x0,portal),act(x0,modify_act),activates(x1,x0) ->
% 0.12/0.36 % 6:2:4:INP:TopTopTopTop: ren1(x0,x1,x2,x3) -> proh(x0)
% 0.12/0.36 % 7:2:4:INP:TopTopTopTop: ren1(x0,x1,x2,x3) -> aee(x0,x1)
% 0.12/0.36 % 8:2:4:INP:TopTopTopTop: ren1(x0,x1,x2,x3) -> act(x0,x2)
% 0.12/0.36 % 9:2:4:INP:TopTopTopTop: ren1(x0,x1,x2,x3) -> activates(x3,x0)
% 0.12/0.36 % 10:2:4:INP:TopTopTopTop: ren2(x0,x1,x2,x3) -> permission(x0)
% 0.12/0.36 % 11:2:4:INP:TopTopTopTop: ren2(x0,x1,x2,x3) -> bearer(x0,x1)
% 0.12/0.36 % 12:2:4:INP:TopTopTopTop: ren2(x0,x1,x2,x3) -> cnt(x0,x2,x3)
% 0.12/0.36 % 13:5:3:INP:TopTopTop: agent(x0),action(x1),target(x2) -> ren1(skf1(x0,x1),x0,x1,skf2(x0,x1)),ren2(skf3(x0,x1,x2),x0,x1,x2)
% 0.12/0.36
% 0.12/0.36 % Reduced Input Conjecture Clauses:
% 0.12/0.36 % 14:3:1:INP:Top: permission(x0),bearer(x0,portal),cnt(x0,modify_act,theater_ds) ->
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 29 atoms initially. Used heuristic: lmodel_grow ===
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 % SZS status Theorem
% 0.12/0.36 % Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36
% 0.12/0.36 % SPASS-SCL-FOL Statistics:
% 0.12/0.36 % Number of learned clauses: 6
% 0.12/0.36 % Number of propagations: 76
% 0.12/0.36 % Number of decisions: 42
% 0.12/0.36 % Number of resolutions: 17
% 0.12/0.36 % Number of condensations: 1
% 0.12/0.36 % Number of sub resolutions: 3
% 0.12/0.36
% 0.12/0.36 % Solver is done. Empty clause found
% 0.12/0.36
% 0.12/0.36 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.12/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.36 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 % Needed: 0:00:00.01
% 0.12/0.36
% 0.12/0.36 % ###
% 0.12/0.36 % ### Pagesize: 8192
% 0.12/0.36 % ### Marksize: 0
% 0.12/0.36 % ### Memory demanded: 846 KBytes
% 0.12/0.36 % ### Memory freed: 846 KBytes
% 0.12/0.36 % ### Memory remaining: 0 Bytes
% 0.12/0.36 % ### Pages allocated: 200 Pages
% 0.12/0.36 % ###
%------------------------------------------------------------------------------