%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : MGT049+1 : TPTP v9.3.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n013.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:00 AM UTC 2026
% Result : Theorem 3.93s 2.48s
% Output : CNFRefutation 4.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 25 ( 15 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 22 ( 10 ~; 5 |; 2 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 21 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ smaller_or_equal > smaller > greater_or_equal > greater > organization > position > external_ties > age > #nlpp > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(greater,type,
greater: ( $i * $i ) > $o ).
tff(organization,type,
organization: $i > $o ).
tff(position,type,
position: ( $i * $i ) > $i ).
tff(smaller,type,
smaller: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(age,type,
age: ( $i * $i ) > $i ).
tff(external_ties,type,
external_ties: ( $i * $i ) > $i ).
tff(greater_or_equal,type,
greater_or_equal: ( $i * $i ) > $o ).
tff(smaller_or_equal,type,
smaller_or_equal: ( $i * $i ) > $o ).
tff(f_146,negated_conjecture,
~ ! [X,T0,T] :
( ( organization(X)
& greater(age(X,T),age(X,T0)) )
=> ( position(X,T) = position(X,T0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_6) ).
tff(f_136,axiom,
! [X,T0,T] :
( organization(X)
=> ( external_ties(X,T) = external_ties(X,T0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_11) ).
tff(f_130,axiom,
! [X,T0,T] :
( organization(X)
=> ( ( greater(external_ties(X,T),external_ties(X,T0))
=> greater(position(X,T),position(X,T0)) )
& ( ( external_ties(X,T) = external_ties(X,T0) )
=> ( position(X,T) = position(X,T0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption_6) ).
tff(c_34,plain,
organization('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_146]) ).
tff(c_74,plain,
! [X_38,T_39,T0_40] :
( ( external_ties(X_38,T_39) = external_ties(X_38,T0_40) )
| ~ organization(X_38) ),
inference(cnfTransformation,[status(thm)],[f_136]) ).
tff(c_77,plain,
! [T_39,T0_40] : ( external_ties('#skF_1',T_39) = external_ties('#skF_1',T0_40) ),
inference(resolution,[status(thm)],[c_34,c_74]) ).
tff(c_288,plain,
! [X_58,T_59,T0_60] :
( ( position(X_58,T_59) = position(X_58,T0_60) )
| ( external_ties(X_58,T_59) != external_ties(X_58,T0_60) )
| ~ organization(X_58) ),
inference(cnfTransformation,[status(thm)],[f_130]) ).
tff(c_292,plain,
! [T_61,T0_62] :
( ( position('#skF_1',T_61) = position('#skF_1',T0_62) )
| ( external_ties('#skF_1',T_61) != external_ties('#skF_1',T0_62) ) ),
inference(resolution,[status(thm)],[c_34,c_288]) ).
tff(c_30,plain,
position('#skF_1','#skF_2') != position('#skF_1','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_146]) ).
tff(c_307,plain,
! [T_61] :
( ( position('#skF_1',T_61) != position('#skF_1','#skF_3') )
| ( external_ties('#skF_1',T_61) != external_ties('#skF_1','#skF_2') ) ),
inference(superposition,[status(thm),theory(equality)],[c_292,c_30]) ).
tff(c_325,plain,
external_ties('#skF_1','#skF_2') != external_ties('#skF_1','#skF_3'),
inference(reflexivity,[status(thm),theory(equality)],[c_307]) ).
tff(c_340,plain,
! [T_39] : ( external_ties('#skF_1',T_39) != external_ties('#skF_1','#skF_3') ),
inference(superposition,[status(thm),theory(equality)],[c_77,c_325]) ).
tff(c_346,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_340]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT049+1 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.04 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.10/0.35 % Computer : n013.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 7 13:15:50 UTC 2026
% 0.14/0.36 % CPUTime :
% 3.93/2.48 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.93/2.49
% 3.93/2.49 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------