TSTP Solution File: MGT059+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : MGT059+1 : TPTP v8.1.2. Released v2.4.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 : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Aug 22 10:49:45 EDT 2023
% Result : Theorem 3.45s 1.88s
% Output : CNFRefutation 3.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 19
% Syntax : Number of formulae : 30 ( 8 unt; 17 typ; 0 def)
% Number of atoms : 35 ( 13 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 34 ( 12 ~; 4 |; 10 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 9 >; 8 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 7 (; 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ smaller_or_equal > smaller > positional_advantage > is_aligned > has_immunity > greater_or_equal > greater > organization > hazard_of_mortality > #nlpp > very_low > mod2 > mod1 > low > high > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(hazard_of_mortality,type,
hazard_of_mortality: ( $i * $i ) > $i ).
tff(greater,type,
greater: ( $i * $i ) > $o ).
tff(high,type,
high: $i ).
tff(mod2,type,
mod2: $i ).
tff(organization,type,
organization: $i > $o ).
tff(positional_advantage,type,
positional_advantage: ( $i * $i ) > $o ).
tff(very_low,type,
very_low: $i ).
tff(is_aligned,type,
is_aligned: ( $i * $i ) > $o ).
tff(low,type,
low: $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(has_immunity,type,
has_immunity: ( $i * $i ) > $o ).
tff(mod1,type,
mod1: $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_177,negated_conjecture,
~ ! [X,T0,T] :
( ( organization(X)
& has_immunity(X,T0)
& has_immunity(X,T) )
=> ( hazard_of_mortality(X,T0) = hazard_of_mortality(X,T) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_2) ).
tff(f_160,axiom,
! [X,T] :
( organization(X)
=> ( ( has_immunity(X,T)
=> ( hazard_of_mortality(X,T) = very_low ) )
& ( ~ has_immunity(X,T)
=> ( ( ( is_aligned(X,T)
& positional_advantage(X,T) )
=> ( hazard_of_mortality(X,T) = low ) )
& ( ( ~ is_aligned(X,T)
& positional_advantage(X,T) )
=> ( hazard_of_mortality(X,T) = mod1 ) )
& ( ( is_aligned(X,T)
& ~ positional_advantage(X,T) )
=> ( hazard_of_mortality(X,T) = mod2 ) )
& ( ( ~ is_aligned(X,T)
& ~ positional_advantage(X,T) )
=> ( hazard_of_mortality(X,T) = high ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption_17) ).
tff(c_40,plain,
organization('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_177]) ).
tff(c_38,plain,
has_immunity('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_177]) ).
tff(c_100,plain,
! [X_36,T_37] :
( ( hazard_of_mortality(X_36,T_37) = very_low )
| ~ has_immunity(X_36,T_37)
| ~ organization(X_36) ),
inference(cnfTransformation,[status(thm)],[f_160]) ).
tff(c_106,plain,
( ( hazard_of_mortality('#skF_1','#skF_2') = very_low )
| ~ organization('#skF_1') ),
inference(resolution,[status(thm)],[c_38,c_100]) ).
tff(c_112,plain,
hazard_of_mortality('#skF_1','#skF_2') = very_low,
inference(demodulation,[status(thm),theory(equality)],[c_40,c_106]) ).
tff(c_36,plain,
has_immunity('#skF_1','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_177]) ).
tff(c_103,plain,
( ( hazard_of_mortality('#skF_1','#skF_3') = very_low )
| ~ organization('#skF_1') ),
inference(resolution,[status(thm)],[c_36,c_100]) ).
tff(c_109,plain,
hazard_of_mortality('#skF_1','#skF_3') = very_low,
inference(demodulation,[status(thm),theory(equality)],[c_40,c_103]) ).
tff(c_34,plain,
hazard_of_mortality('#skF_1','#skF_2') != hazard_of_mortality('#skF_1','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_177]) ).
tff(c_113,plain,
hazard_of_mortality('#skF_1','#skF_2') != very_low,
inference(demodulation,[status(thm),theory(equality)],[c_109,c_34]) ).
tff(c_123,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_112,c_113]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : MGT059+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.14 % 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.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 19:59:06 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.45/1.88 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.45/1.88
% 3.45/1.88 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.45/1.91
% 3.45/1.91 Inference rules
% 3.45/1.91 ----------------------
% 3.45/1.91 #Ref : 0
% 3.45/1.91 #Sup : 14
% 3.45/1.91 #Fact : 2
% 3.45/1.91 #Define : 0
% 3.45/1.91 #Split : 0
% 3.45/1.91 #Chain : 0
% 3.45/1.91 #Close : 0
% 3.45/1.91
% 3.45/1.91 Ordering : KBO
% 3.45/1.91
% 3.45/1.91 Simplification rules
% 3.45/1.91 ----------------------
% 3.45/1.91 #Subsume : 0
% 3.45/1.91 #Demod : 4
% 3.45/1.91 #Tautology : 13
% 3.45/1.91 #SimpNegUnit : 0
% 3.45/1.91 #BackRed : 1
% 3.45/1.91
% 3.45/1.91 #Partial instantiations: 0
% 3.45/1.91 #Strategies tried : 1
% 3.45/1.91
% 3.45/1.91 Timing (in seconds)
% 3.45/1.91 ----------------------
% 3.45/1.91 Preprocessing : 0.53
% 3.45/1.91 Parsing : 0.26
% 3.45/1.91 CNF conversion : 0.03
% 3.45/1.91 Main loop : 0.20
% 3.45/1.91 Inferencing : 0.08
% 3.45/1.91 Reduction : 0.05
% 3.45/1.91 Demodulation : 0.04
% 3.45/1.91 BG Simplification : 0.02
% 3.45/1.91 Subsumption : 0.04
% 3.45/1.91 Abstraction : 0.01
% 3.45/1.91 MUC search : 0.00
% 3.45/1.92 Cooper : 0.00
% 3.45/1.92 Total : 0.77
% 3.45/1.92 Index Insertion : 0.00
% 3.45/1.92 Index Deletion : 0.00
% 3.45/1.92 Index Matching : 0.00
% 3.45/1.92 BG Taut test : 0.00
%------------------------------------------------------------------------------