%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : MGT116+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n019.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:03:09 AM UTC 2026
% Result : Theorem 2.03s 1.26s
% Output : CNFRefutation 2.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 16 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 29 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 24 ( 11 ~; 9 |; 3 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 15 ( 15 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ founds_rem > cnt > part_of > about_event > target > subjection > rule > position > legal_relator > event > action > #nlpp > decl > some_target > some_action > s > rho_r > f1 > e1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(e1,type,
e1: $i ).
tff(rho_r,type,
rho_r: $i ).
tff(subjection,type,
subjection: $i > $o ).
tff(rule,type,
rule: $i > $o ).
tff(s,type,
s: $i ).
tff(part_of,type,
part_of: ( $i * $i ) > $o ).
tff(cnt,type,
cnt: ( $i * $i * $i ) > $o ).
tff(about_event,type,
about_event: ( $i * $i ) > $o ).
tff(f1,type,
f1: $i ).
tff(founds_rem,type,
founds_rem: ( $i * $i * $i ) > $o ).
tff(position,type,
position: $i > $o ).
tff(event,type,
event: $i > $o ).
tff(target,type,
target: $i > $o ).
tff(some_action,type,
some_action: $i ).
tff(decl,type,
decl: $i > $i ).
tff(legal_relator,type,
legal_relator: $i > $o ).
tff(action,type,
action: $i > $o ).
tff(some_target,type,
some_target: $i ).
tff(f_50,negated_conjecture,
~ about_event(s,e1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture) ).
tff(f_45,axiom,
subjection(s),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subj_s) ).
tff(f_47,axiom,
part_of(s,rho_r),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partof_s) ).
tff(f_46,axiom,
cnt(s,decl(some_action),some_target),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cnt_s) ).
tff(f_48,axiom,
founds_rem(e1,rho_r,f1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',founds_rem1) ).
tff(f_37,axiom,
! [S,A,T,Rho,E,R] :
( ( subjection(S)
& cnt(S,decl(A),T)
& part_of(S,Rho)
& founds_rem(E,Rho,R) )
=> about_event(S,E) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_B3) ).
tff(c_24,plain,
~ about_event(s,e1),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_16,plain,
subjection(s),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_20,plain,
part_of(s,rho_r),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_18,plain,
cnt(s,decl(some_action),some_target),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_22,plain,
founds_rem(e1,rho_r,f1),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_25,plain,
! [T_12,E_8,Rho_11,R_10,S_7,A_9] :
( about_event(S_7,E_8)
| ~ founds_rem(E_8,Rho_11,R_10)
| ~ part_of(S_7,Rho_11)
| ~ cnt(S_7,decl(A_9),T_12)
| ~ subjection(S_7) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_29,plain,
! [S_13,A_14,T_15] :
( about_event(S_13,e1)
| ~ part_of(S_13,rho_r)
| ~ cnt(S_13,decl(A_14),T_15)
| ~ subjection(S_13) ),
inference(resolution,[status(thm)],[c_22,c_25]) ).
tff(c_32,plain,
( about_event(s,e1)
| ~ part_of(s,rho_r)
| ~ subjection(s) ),
inference(resolution,[status(thm)],[c_18,c_29]) ).
tff(c_35,plain,
about_event(s,e1),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_20,c_32]) ).
tff(c_37,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_24,c_35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT116+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.04 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.11/0.36 % Computer : n019.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 7 14:09:37 UTC 2026
% 0.11/0.37 % CPUTime :
% 2.03/1.26 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.03/1.26
% 2.03/1.26 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------