%------------------------------------------------------------------------------
% File : SPASS-SCL---0.1.1
% Problem : MGT116+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 : n014.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.08s 0.34s
% Output : Proof 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 22 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 28 ( 12 ~; 8 |; 6 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 24 ( 3 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% FILE RECORD
fof(ax_B3,axiom,
! [X1,X2,X3,X4,X5,X6] :
( ( subjection(X1)
& cnt(X1,decl(X2),X3)
& part_of(X1,X4)
& founds_rem(X5,X4,X6) )
=> about_event(X1,X5) ),
file('theBenchmark.p',ax_B3) ).
% FOF SIMPLE INFERENCE
fof(ax_B3_elimTB,axiom,
! [X1,X2,X3,X4,X5,X6] :
( ( subjection(X1)
& cnt(X1,decl(X2),X3)
& part_of(X1,X4)
& founds_rem(X5,X4,X6) )
=> about_event(X1,X5) ),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[ax_B3])]) ).
% FOF SIMPLE INFERENCE
fof(ax_B3_elimImpEquivPushNegMiniScope,axiom,
! [X1,X2,X3,X4,X5] :
( ~ subjection(X1)
| ~ cnt(X1,decl(X2),X3)
| ~ part_of(X1,X4)
| ! [X6] : ~ founds_rem(X5,X4,X6)
| about_event(X1,X5) ),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[ax_B3_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_1,plain,
( ~ subjection(X0)
| ~ cnt(X0,decl(X1),X2)
| ~ part_of(X0,X3)
| ~ founds_rem(X4,X3,X5)
| about_event(X0,X4) ),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[ax_B3_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(cnt_s,axiom,
cnt(s,decl(some_action),some_target),
file('theBenchmark.p',cnt_s) ).
% FOF SIMPLE INFERENCE
fof(cnt_s_elimTB,axiom,
cnt(s,decl(some_action),some_target),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[cnt_s])]) ).
% FOF SIMPLE INFERENCE
fof(cnt_s_elimImpEquivPushNegMiniScope,axiom,
cnt(s,decl(some_action),some_target),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[cnt_s_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_9,plain,
cnt(s,decl(some_action),some_target),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[cnt_s_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(founds_rem1,axiom,
founds_rem(e1,rho_r,f1),
file('theBenchmark.p',founds_rem1) ).
% FOF SIMPLE INFERENCE
fof(founds_rem1_elimTB,axiom,
founds_rem(e1,rho_r,f1),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[founds_rem1])]) ).
% FOF SIMPLE INFERENCE
fof(founds_rem1_elimImpEquivPushNegMiniScope,axiom,
founds_rem(e1,rho_r,f1),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[founds_rem1_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_11,plain,
founds_rem(e1,rho_r,f1),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[founds_rem1_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(conjecture,conjecture,
about_event(s,e1),
file('theBenchmark.p',conjecture) ).
% NEGATING CONJECTURE
fof(conjecture_nc,negated_conjecture,
~ about_event(s,e1),
inference(negating_conjecture,[status(cth)],[conjecture]) ).
% FOF SIMPLE INFERENCE
fof(conjecture_nc_elimTB,negated_conjecture,
~ about_event(s,e1),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[conjecture_nc])]) ).
% FOF SIMPLE INFERENCE
fof(conjecture_nc_elimImpEquivPushNegMiniScope,negated_conjecture,
~ about_event(s,e1),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[conjecture_nc_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_12,plain,
~ about_event(s,e1),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[conjecture_nc_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(partof_s,axiom,
part_of(s,rho_r),
file('theBenchmark.p',partof_s) ).
% FOF SIMPLE INFERENCE
fof(partof_s_elimTB,axiom,
part_of(s,rho_r),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[partof_s])]) ).
% FOF SIMPLE INFERENCE
fof(partof_s_elimImpEquivPushNegMiniScope,axiom,
part_of(s,rho_r),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[partof_s_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_10,plain,
part_of(s,rho_r),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[partof_s_elimImpEquivPushNegMiniScope])]) ).
% FILE RECORD
fof(subj_s,axiom,
subjection(s),
file('theBenchmark.p',subj_s) ).
% FOF SIMPLE INFERENCE
fof(subj_s_elimTB,axiom,
subjection(s),
inference(elimTB,[status(thm)],[inference(variable_rename,[status(thm)],[subj_s])]) ).
% FOF SIMPLE INFERENCE
fof(subj_s_elimImpEquivPushNegMiniScope,axiom,
subjection(s),
inference(elimImpEquivPushNegMiniScope,[status(thm)],[subj_s_elimTB]) ).
% FOF PUSH DISJ SPLITTING.
cnf(c_8,plain,
subjection(s),
inference(split_conjunct,[status(thm)],[inference(push_disj,[status(thm)],[subj_s_elimImpEquivPushNegMiniScope])]) ).
% CNF SPASS RESOLUTION.
cnf(c_13,plain,
$false,
inference(resolution,[status(thm)],[c_1,c_9,c_11,c_12,c_10,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT116+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n014.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Mon Sep 7 14:09:26 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.08/0.34 Running /export/starexec/sandbox/solver/bin/SPASS-SCL-FOL -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.34
% 0.08/0.34 % Input Clauses:
% 0.08/0.34 % 1:5:6:INP:TopTopTopTopTopTop: subjection(x0),cnt(x0,decl(x1),x2),part_of(x0,x3),founds_rem(x4,x3,x5) -> about_event(x0,x4)
% 0.08/0.34 % 2:1:0:INP:: -> position(s)
% 0.08/0.34 % 3:1:0:INP:: -> legal_relator(rho_r)
% 0.08/0.34 % 4:1:0:INP:: -> rule(f1)
% 0.08/0.34 % 5:1:0:INP:: -> event(e1)
% 0.08/0.34 % 6:1:0:INP:: -> action(some_action)
% 0.08/0.34 % 7:1:0:INP:: -> target(some_target)
% 0.08/0.34 % 8:1:0:INP:: -> subjection(s)
% 0.08/0.34 % 9:1:0:INP:: -> cnt(s,decl(some_action),some_target)
% 0.08/0.34 % 10:1:0:INP:: -> part_of(s,rho_r)
% 0.08/0.34 % 11:1:0:INP:: -> founds_rem(e1,rho_r,f1)
% 0.08/0.34 % 12:1:0:INP:: about_event(s,e1) ->
% 0.08/0.34
% 0.08/0.34 % Predicates: subjection cnt part_of founds_rem about_event position legal_relator rule event action target
% 0.08/0.34 % Fol Constants: s rho_r f1 e1 some_action some_target
% 0.08/0.34 % Fol Functions: decl
% 0.08/0.34 % Problem Properties:
% 0.08/0.34 % This is a full first-order problem without equality. The Problem is linear.
% 0.08/0.34
% 0.08/0.34
% 0.08/0.34 % Reduced Input Axiom Clauses:
% 0.08/0.34 % 1:5:6:INP:TopTopTopTopTopTop: subjection(x0),cnt(x0,decl(x1),x2),part_of(x0,x3),founds_rem(x4,x3,x5) -> about_event(x0,x4)
% 0.08/0.34 % 2:1:0:INP:: -> position(s)
% 0.08/0.34 % 3:1:0:INP:: -> legal_relator(rho_r)
% 0.08/0.34 % 4:1:0:INP:: -> rule(f1)
% 0.08/0.34 % 5:1:0:INP:: -> event(e1)
% 0.08/0.34 % 6:1:0:INP:: -> action(some_action)
% 0.08/0.34 % 7:1:0:INP:: -> target(some_target)
% 0.08/0.34 % 8:1:0:INP:: -> subjection(s)
% 0.08/0.34 % 9:1:0:INP:: -> cnt(s,decl(some_action),some_target)
% 0.08/0.34 % 10:1:0:INP:: -> part_of(s,rho_r)
% 0.08/0.34 % 11:1:0:INP:: -> founds_rem(e1,rho_r,f1)
% 0.08/0.34
% 0.08/0.34 % Reduced Input Conjecture Clauses:
% 0.08/0.34 % 12:1:0:INP:: about_event(s,e1) ->
% 0.08/0.34
% 0.08/0.34
% 0.08/0.34 % === Starting SPASS-SCL-FOL A Little Less Naive, considering 10 atoms initially. Used heuristic: lmodel_grow ===
% 0.08/0.34
% 0.08/0.34
% 0.08/0.34
% 0.08/0.34 % SZS status Theorem
% 0.08/0.34 % Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.34
% 0.08/0.34 % SPASS-SCL-FOL Statistics:
% 0.08/0.34 % Number of learned clauses: 0
% 0.08/0.34 % Number of propagations: 5
% 0.08/0.34 % Number of decisions: 0
% 0.08/0.34 % Number of resolutions: 5
% 0.08/0.34 % Number of condensations: 0
% 0.08/0.34 % Number of sub resolutions: 0
% 0.08/0.34
% 0.08/0.34 % Solver is done. Empty clause found
% 0.08/0.34
% 0.08/0.34 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.08/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.34 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.08/0.34
% 0.08/0.34
% 0.08/0.34 % Needed: 0:00:00.00
% 0.08/0.34
% 0.08/0.34 % ###
% 0.08/0.34 % ### Pagesize: 8192
% 0.08/0.34 % ### Marksize: 0
% 0.08/0.34 % ### Memory demanded: 304 KBytes
% 0.08/0.34 % ### Memory freed: 304 KBytes
% 0.08/0.34 % ### Memory remaining: 0 Bytes
% 0.08/0.34 % ### Pages allocated: 134 Pages
% 0.08/0.34 % ###
%------------------------------------------------------------------------------