TSTP Solution File: MGT052+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : MGT052+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/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 : n032.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:43 EDT 2023
% Result : Theorem 2.79s 1.70s
% Output : CNFRefutation 3.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 11
% Syntax : Number of formulae : 17 ( 5 unt; 9 typ; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 15 ( 8 ~; 4 |; 1 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 7 >; 7 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 11 (; 11 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ dissimilar > smaller_or_equal > smaller > is_aligned > greater_or_equal > greater > organization > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(greater,type,
greater: ( $i * $i ) > $o ).
tff(dissimilar,type,
dissimilar: ( $i * $i * $i ) > $o ).
tff(organization,type,
organization: $i > $o ).
tff(is_aligned,type,
is_aligned: ( $i * $i ) > $o ).
tff(smaller,type,
smaller: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $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_143,negated_conjecture,
~ ! [X,T] : ~ dissimilar(X,T,T),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',background_assumption_1) ).
tff(f_132,axiom,
! [X,T0,T] :
( dissimilar(X,T0,T)
<=> ( organization(X)
& ~ ( is_aligned(X,T0)
<=> is_aligned(X,T) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_2) ).
tff(c_38,plain,
dissimilar('#skF_1','#skF_2','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_143]) ).
tff(c_110,plain,
! [X_43,T0_44,T_45] :
( is_aligned(X_43,T0_44)
| is_aligned(X_43,T_45)
| ~ dissimilar(X_43,T0_44,T_45) ),
inference(cnfTransformation,[status(thm)],[f_132]) ).
tff(c_114,plain,
is_aligned('#skF_1','#skF_2'),
inference(resolution,[status(thm)],[c_38,c_110]) ).
tff(c_115,plain,
! [X_46,T_47,T0_48] :
( ~ is_aligned(X_46,T_47)
| ~ is_aligned(X_46,T0_48)
| ~ dissimilar(X_46,T0_48,T_47) ),
inference(cnfTransformation,[status(thm)],[f_132]) ).
tff(c_118,plain,
~ is_aligned('#skF_1','#skF_2'),
inference(resolution,[status(thm)],[c_38,c_115]) ).
tff(c_122,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_114,c_118]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT052+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % 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.12/0.33 % Computer : n032.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Aug 3 20:35:36 EDT 2023
% 0.12/0.33 % CPUTime :
% 2.79/1.70 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.79/1.70
% 2.79/1.70 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.00/1.72
% 3.00/1.72 Inference rules
% 3.00/1.72 ----------------------
% 3.00/1.73 #Ref : 0
% 3.00/1.73 #Sup : 13
% 3.00/1.73 #Fact : 2
% 3.00/1.73 #Define : 0
% 3.00/1.73 #Split : 0
% 3.00/1.73 #Chain : 0
% 3.00/1.73 #Close : 0
% 3.00/1.73
% 3.00/1.73 Ordering : KBO
% 3.00/1.73
% 3.00/1.73 Simplification rules
% 3.00/1.73 ----------------------
% 3.00/1.73 #Subsume : 0
% 3.00/1.73 #Demod : 1
% 3.00/1.73 #Tautology : 11
% 3.00/1.73 #SimpNegUnit : 0
% 3.00/1.73 #BackRed : 0
% 3.00/1.73
% 3.00/1.73 #Partial instantiations: 0
% 3.00/1.73 #Strategies tried : 1
% 3.00/1.73
% 3.00/1.73 Timing (in seconds)
% 3.00/1.73 ----------------------
% 3.00/1.73 Preprocessing : 0.47
% 3.00/1.73 Parsing : 0.25
% 3.00/1.73 CNF conversion : 0.03
% 3.00/1.73 Main loop : 0.23
% 3.00/1.73 Inferencing : 0.10
% 3.00/1.73 Reduction : 0.05
% 3.00/1.73 Demodulation : 0.04
% 3.00/1.73 BG Simplification : 0.02
% 3.00/1.73 Subsumption : 0.05
% 3.00/1.73 Abstraction : 0.01
% 3.00/1.73 MUC search : 0.00
% 3.00/1.73 Cooper : 0.00
% 3.00/1.73 Total : 0.74
% 3.00/1.73 Index Insertion : 0.00
% 3.00/1.73 Index Deletion : 0.00
% 3.00/1.73 Index Matching : 0.00
% 3.00/1.73 BG Taut test : 0.00
%------------------------------------------------------------------------------