%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT112+1 : TPTP v9.3.0. Released v9.3.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:16 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.37s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 37 ( 33 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 46 ( 18 ~; 14 |; 12 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 24 ( 1 sgn 16 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
fof(ax_disability_block,axiom,
! [X1,X2,X3,X4,X5] :
( ( proh(X1)
& aee(X1,X2)
& aer(X1,X3)
& act(X1,X4)
& tgt(X1,X5) )
=> ~ ? [X6] :
( disability(X6)
& bearer(X6,X3)
& cnt(X6,X4,X5) ) ),
file('theBenchmark.p',ax_disability_block) ).
% FOF SIMPLE INFERENCE
fof(ax_disability_block_elimTB,axiom,
! [X1,X2,X3,X4,X5] :
( ( proh(X1)
& aee(X1,X2)
& aer(X1,X3)
& act(X1,X4)
& tgt(X1,X5) )
=> ~ ? [X6] :
( disability(X6)
& bearer(X6,X3)
& cnt(X6,X4,X5) ) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[ax_disability_block])]) ).
% FOF SIMPLE INFERENCE
fof(ax_disability_block_elimImpEquivPushNegMiniScope,axiom,
! [X1,X2,X3,X4,X5] :
( ~ proh(X1)
| ~ aee(X1,X2)
| ~ aer(X1,X3)
| ~ act(X1,X4)
| ~ tgt(X1,X5)
| ! [X6] :
( ~ disability(X6)
| ~ bearer(X6,X3)
| ~ cnt(X6,X4,X5) ) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ax_disability_block_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_1,plain,
( ~ proh(X0)
| ~ aee(X0,X1)
| ~ aer(X0,X2)
| ~ act(X0,X3)
| ~ tgt(X0,X4)
| ~ disability(X5)
| ~ bearer(X5,X2)
| ~ cnt(X5,X3,X4) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ax_disability_block_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(cnt_db,axiom,
cnt(db,read,museum_api),
file('theBenchmark.p',cnt_db) ).
% FOF SIMPLE INFERENCE
fof(cnt_db_elimTB,axiom,
cnt(db,read,museum_api),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[cnt_db])]) ).
% FOF SIMPLE INFERENCE
fof(cnt_db_elimImpEquivPushNegMiniScope,axiom,
cnt(db,read,museum_api),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[cnt_db_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_23,plain,
cnt(db,read,museum_api),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[cnt_db_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(aee_f2,axiom,
aee(f2,bibliothek),
file('theBenchmark.p',aee_f2) ).
% FOF SIMPLE INFERENCE
fof(aee_f2_elimTB,axiom,
aee(f2,bibliothek),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[aee_f2])]) ).
% FOF SIMPLE INFERENCE
fof(aee_f2_elimImpEquivPushNegMiniScope,axiom,
aee(f2,bibliothek),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[aee_f2_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_26,plain,
aee(f2,bibliothek),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[aee_f2_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(aer_f2,axiom,
aer(f2,museen),
file('theBenchmark.p',aer_f2) ).
% FOF SIMPLE INFERENCE
fof(aer_f2_elimTB,axiom,
aer(f2,museen),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[aer_f2])]) ).
% FOF SIMPLE INFERENCE
fof(aer_f2_elimImpEquivPushNegMiniScope,axiom,
aer(f2,museen),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[aer_f2_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_27,plain,
aer(f2,museen),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[aer_f2_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(act_f2,axiom,
act(f2,read),
file('theBenchmark.p',act_f2) ).
% FOF SIMPLE INFERENCE
fof(act_f2_elimTB,axiom,
act(f2,read),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[act_f2])]) ).
% FOF SIMPLE INFERENCE
fof(act_f2_elimImpEquivPushNegMiniScope,axiom,
act(f2,read),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[act_f2_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_28,plain,
act(f2,read),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[act_f2_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(tgt_f2,axiom,
tgt(f2,museum_api),
file('theBenchmark.p',tgt_f2) ).
% FOF SIMPLE INFERENCE
fof(tgt_f2_elimTB,axiom,
tgt(f2,museum_api),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[tgt_f2])]) ).
% FOF SIMPLE INFERENCE
fof(tgt_f2_elimImpEquivPushNegMiniScope,axiom,
tgt(f2,museum_api),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[tgt_f2_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_29,plain,
tgt(f2,museum_api),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[tgt_f2_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(bearer_db,axiom,
bearer(db,museen),
file('theBenchmark.p',bearer_db) ).
% FOF SIMPLE INFERENCE
fof(bearer_db_elimTB,axiom,
bearer(db,museen),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[bearer_db])]) ).
% FOF SIMPLE INFERENCE
fof(bearer_db_elimImpEquivPushNegMiniScope,axiom,
bearer(db,museen),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[bearer_db_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_19,plain,
bearer(db,museen),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[bearer_db_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(proh_f2,axiom,
proh(f2),
file('theBenchmark.p',proh_f2) ).
% FOF SIMPLE INFERENCE
fof(proh_f2_elimTB,axiom,
proh(f2),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[proh_f2])]) ).
% FOF SIMPLE INFERENCE
fof(proh_f2_elimImpEquivPushNegMiniScope,axiom,
proh(f2),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[proh_f2_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_25,plain,
proh(f2),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[proh_f2_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(disability_db,axiom,
disability(db),
file('theBenchmark.p',disability_db) ).
% FOF SIMPLE INFERENCE
fof(disability_db_elimTB,axiom,
disability(db),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[disability_db])]) ).
% FOF SIMPLE INFERENCE
fof(disability_db_elimImpEquivPushNegMiniScope,axiom,
disability(db),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[disability_db_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_15,plain,
disability(db),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[disability_db_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_30,plain,
$false,
inference(resolution,[status(thm)],[c_1,c_23,c_26,c_27,c_28,c_29,c_19,c_25,c_15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT112+1 : TPTP v9.3.0. Released v9.3.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 14:08:24 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running /export/starexec/sandbox2/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37
% 0.10/0.37 % Input Clauses:
% 0.10/0.37 % 1:8:6:INP:TopTopTopTopTopTop: proh(x0),aee(x0,x1),aer(x0,x2),act(x0,x3),tgt(x0,x4),disability(x5),bearer(x5,x2),cnt(x5,x3,x4) ->
% 0.10/0.37 % 2:1:0:INP:: -> agent(bibliothek)
% 0.10/0.37 % 3:1:0:INP:: -> agent(museen)
% 0.10/0.37 % 4:1:0:INP:: -> action(read)
% 0.10/0.37 % 5:1:0:INP:: -> target(museum_api)
% 0.10/0.37 % 6:1:0:INP:: -> position(l)
% 0.10/0.37 % 7:1:0:INP:: -> position(n)
% 0.10/0.37 % 8:1:0:INP:: -> position(im)
% 0.10/0.37 % 9:1:0:INP:: -> position(db)
% 0.10/0.37 % 10:1:0:INP:: -> legal_relator(rho1)
% 0.10/0.37 % 11:1:0:INP:: -> odrl_rel(rho1)
% 0.10/0.37 % 12:1:0:INP:: -> permission(l)
% 0.10/0.37 % 13:1:0:INP:: -> no_right(n)
% 0.10/0.37 % 14:1:0:INP:: -> immunity(im)
% 0.10/0.37 % 15:1:0:INP:: -> disability(db)
% 0.10/0.37 % 16:1:0:INP:: -> bearer(l,bibliothek)
% 0.10/0.37 % 17:1:0:INP:: -> bearer(n,museen)
% 0.10/0.37 % 18:1:0:INP:: -> bearer(im,bibliothek)
% 0.10/0.37 % 19:1:0:INP:: -> bearer(db,museen)
% 0.10/0.37 % 20:1:0:INP:: -> cnt(l,read,museum_api)
% 0.10/0.37 % 21:1:0:INP:: -> cnt(n,read,museum_api)
% 0.10/0.37 % 22:1:0:INP:: -> cnt(im,read,museum_api)
% 0.10/0.37 % 23:1:0:INP:: -> cnt(db,read,museum_api)
% 0.10/0.37 % 24:1:0:INP:: -> rule(f2)
% 0.10/0.37 % 25:1:0:INP:: -> proh(f2)
% 0.10/0.37 % 26:1:0:INP:: -> aee(f2,bibliothek)
% 0.10/0.37 % 27:1:0:INP:: -> aer(f2,museen)
% 0.10/0.37 % 28:1:0:INP:: -> act(f2,read)
% 0.10/0.37 % 29:1:0:INP:: -> tgt(f2,museum_api)
% 0.10/0.37
% 0.10/0.37 % Predicates: proh aee aer act tgt disability bearer cnt agent action target position legal_relator odrl_rel permission no_right immunity rule
% 0.10/0.37 % Fol Constants: bibliothek museen read museum_api l n im db rho1 f2
% 0.10/0.37 % Fol Functions:
% 0.10/0.37 % Problem Properties:
% 0.10/0.37 % This is a Bernays Schoenfinkel problem. The Problem is linear.
% 0.10/0.37
% 0.10/0.37
% 0.10/0.37 % Reduced Input Axiom Clauses:
% 0.10/0.37 % 1:8:6:INP:TopTopTopTopTopTop: proh(x0),aee(x0,x1),aer(x0,x2),act(x0,x3),tgt(x0,x4),disability(x5),bearer(x5,x2),cnt(x5,x3,x4) ->
% 0.10/0.37 % 2:1:0:INP:: -> agent(bibliothek)
% 0.10/0.37 % 3:1:0:INP:: -> agent(museen)
% 0.10/0.37 % 4:1:0:INP:: -> action(read)
% 0.10/0.37 % 5:1:0:INP:: -> target(museum_api)
% 0.10/0.37 % 6:1:0:INP:: -> position(l)
% 0.10/0.37 % 7:1:0:INP:: -> position(n)
% 0.10/0.37 % 8:1:0:INP:: -> position(im)
% 0.10/0.37 % 9:1:0:INP:: -> position(db)
% 0.10/0.37 % 10:1:0:INP:: -> legal_relator(rho1)
% 0.10/0.37 % 11:1:0:INP:: -> odrl_rel(rho1)
% 0.10/0.37 % 12:1:0:INP:: -> permission(l)
% 0.10/0.37 % 13:1:0:INP:: -> no_right(n)
% 0.10/0.37 % 14:1:0:INP:: -> immunity(im)
% 0.10/0.37 % 15:1:0:INP:: -> disability(db)
% 0.10/0.37 % 16:1:0:INP:: -> bearer(l,bibliothek)
% 0.10/0.37 % 17:1:0:INP:: -> bearer(n,museen)
% 0.10/0.37 % 18:1:0:INP:: -> bearer(im,bibliothek)
% 0.10/0.37 % 19:1:0:INP:: -> bearer(db,museen)
% 0.10/0.37 % 20:1:0:INP:: -> cnt(l,read,museum_api)
% 0.10/0.37 % 21:1:0:INP:: -> cnt(n,read,museum_api)
% 0.10/0.37 % 22:1:0:INP:: -> cnt(im,read,museum_api)
% 0.10/0.37 % 23:1:0:INP:: -> cnt(db,read,museum_api)
% 0.10/0.37 % 24:1:0:INP:: -> rule(f2)
% 0.10/0.37 % 25:1:0:INP:: -> proh(f2)
% 0.10/0.37 % 26:1:0:INP:: -> aee(f2,bibliothek)
% 0.10/0.37 % 27:1:0:INP:: -> aer(f2,museen)
% 0.10/0.37 % 28:1:0:INP:: -> act(f2,read)
% 0.10/0.37 % 29:1:0:INP:: -> tgt(f2,museum_api)
% 0.10/0.37
% 0.10/0.37 % Reduced Input Conjecture Clauses:
% 0.10/0.37
% 0.10/0.37
% 0.10/0.37 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 36 atoms initially. Used heuristic: lmodel_grow ===
% 0.10/0.37
% 0.10/0.37
% 0.10/0.37
% 0.10/0.37 % SZS status Unsatisfiable
% 0.10/0.37 % Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37
% 0.10/0.37 % SPASS-SCL-FOL Statistics:
% 0.10/0.37 % Number of learned clauses: 0
% 0.10/0.37 % Number of propagations: 11
% 0.10/0.37 % Number of decisions: 0
% 0.10/0.37 % Number of resolutions: 8
% 0.10/0.37 % Number of condensations: 0
% 0.10/0.37 % Number of sub resolutions: 0
% 0.10/0.37
% 0.10/0.37 % Solver is done. Empty clause found
% 0.10/0.37
% 0.10/0.37 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.10/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.37 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.10/0.37
% 0.10/0.37
% 0.10/0.37 % Needed: 0:00:00.00
% 0.10/0.37
% 0.10/0.37 % ###
% 0.10/0.37 % ### Pagesize: 8192
% 0.10/0.37 % ### Marksize: 0
% 0.10/0.37 % ### Memory demanded: 411 KBytes
% 0.10/0.37 % ### Memory freed: 411 KBytes
% 0.10/0.37 % ### Memory remaining: 0 Bytes
% 0.10/0.37 % ### Pages allocated: 171 Pages
% 0.10/0.37 % ###
%------------------------------------------------------------------------------