TSTP Solution File: ARI621_2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI621_2 : TPTP v8.1.2. Released v5.1.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 : n019.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:34:08 EDT 2023
% Result : Theorem 3.32s 1.93s
% Output : CNFRefutation 3.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 8 unt; 2 typ; 0 def)
% Number of atoms : 49 ( 24 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 35 ( 9 ~; 22 |; 2 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 76 ( 3 atm; 6 fun; 61 num; 6 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 1 usr; 6 con; 0-2 aty)
% Number of variables : 6 (; 5 !; 1 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
%$ pow2 > #nlpp > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(pow2,type,
pow2: $rat > $o ).
tff('#skF_1',type,
'#skF_1': $rat > $rat ).
tff(f_42,negated_conjecture,
~ ( ! [Xa: $rat] :
( pow2(Xa)
<=> ( ( Xa = 1 )
| ( $lesseq(2,Xa)
& ? [Ya: $rat] :
( ( $product(2,Ya) = Xa )
& pow2(Ya) ) ) ) )
=> ~ pow2(12) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_pow_of_2_10) ).
tff(c_2,plain,
pow2(12),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_28,plain,
! [X_9a: $rat] :
( ( $product(2,'#skF_1'(X_9a)) = X_9a )
| ~ pow2(X_9a)
| ( X_9a = 1 ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_35,plain,
( ( $product(2,'#skF_1'(12)) = 12 )
| ( 12 = 1 ) ),
inference(resolution,[status(thm)],[c_2,c_28]) ).
tff(c_36,plain,
'#skF_1'(12) = 6,
inference(backgroundSimplification,[status(thm),theory('LRA')],[c_35]) ).
tff(c_3,plain,
! [X_1a: $rat] :
( pow2('#skF_1'(X_1a))
| ~ pow2(X_1a)
| ( X_1a = 1 ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_165,plain,
( pow2(6)
| ~ pow2(12)
| ( 12 = 1 ) ),
inference(superposition,[status(thm),theory(equality)],[c_36,c_3]) ).
tff(c_169,plain,
( pow2(6)
| ( 12 = 1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_165]) ).
tff(c_170,plain,
pow2(6),
inference(backgroundSimplification,[status(thm),theory('LRA')],[c_169]) ).
tff(c_4,plain,
! [X_1a: $rat] :
( ( $product(2,'#skF_1'(X_1a)) = X_1a )
| ~ pow2(X_1a)
| ( X_1a = 1 ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_182,plain,
( ( $product(2,'#skF_1'(6)) = 6 )
| ( 6 = 1 ) ),
inference(resolution,[status(thm)],[c_170,c_4]) ).
tff(c_183,plain,
'#skF_1'(6) = 3,
inference(backgroundSimplification,[status(thm),theory('LRA')],[c_182]) ).
tff(c_190,plain,
( pow2(3)
| ~ pow2(6)
| ( 6 = 1 ) ),
inference(superposition,[status(thm),theory(equality)],[c_183,c_3]) ).
tff(c_194,plain,
( pow2(3)
| ( 6 = 1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_170,c_190]) ).
tff(c_195,plain,
pow2(3),
inference(backgroundSimplification,[status(thm),theory('LRA')],[c_194]) ).
tff(c_217,plain,
( ( $product(2,'#skF_1'(3)) = 3 )
| ( 3 = 1 ) ),
inference(resolution,[status(thm)],[c_195,c_4]) ).
tff(c_218,plain,
'#skF_1'(3) = 3/2,
inference(backgroundSimplification,[status(thm),theory('LRA')],[c_217]) ).
tff(c_387,plain,
( pow2(3/2)
| ~ pow2(3)
| ( 3 = 1 ) ),
inference(superposition,[status(thm),theory(equality)],[c_218,c_3]) ).
tff(c_391,plain,
( pow2(3/2)
| ( 3 = 1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_195,c_387]) ).
tff(c_392,plain,
pow2(3/2),
inference(backgroundSimplification,[status(thm),theory('LRA')],[c_391]) ).
tff(c_5,plain,
! [X_1a: $rat] :
( ~ pow2(X_1a)
| ( X_1a = 1 )
| $lesseq(2,X_1a) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_406,plain,
( ( 3/2 = 1 )
| $lesseq(2,3/2) ),
inference(resolution,[status(thm)],[c_392,c_5]) ).
tff(c_408,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LRA')],[c_406]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : ARI621_2 : TPTP v8.1.2. Released v5.1.0.
% 0.00/0.15 % 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.16/0.36 % Computer : n019.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri Aug 4 00:10:01 EDT 2023
% 0.16/0.37 % CPUTime :
% 3.32/1.93 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.32/1.94
% 3.32/1.94 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.32/1.96
% 3.32/1.96 Inference rules
% 3.32/1.96 ----------------------
% 3.32/1.96 #Ref : 0
% 3.32/1.96 #Sup : 93
% 3.32/1.96 #Fact : 0
% 3.32/1.96 #Define : 0
% 3.32/1.96 #Split : 0
% 3.32/1.96 #Chain : 0
% 3.32/1.96 #Close : 0
% 3.32/1.96
% 3.32/1.96 Ordering : LPO
% 3.32/1.96
% 3.32/1.96 Simplification rules
% 3.32/1.96 ----------------------
% 3.32/1.96 #Subsume : 0
% 3.32/1.96 #Demod : 23
% 3.32/1.96 #Tautology : 54
% 3.32/1.96 #SimpNegUnit : 0
% 3.32/1.96 #BackRed : 0
% 3.32/1.96
% 3.32/1.96 #Partial instantiations: 0
% 3.32/1.96 #Strategies tried : 1
% 3.32/1.96
% 3.32/1.96 Timing (in seconds)
% 3.32/1.96 ----------------------
% 3.32/1.96 Preprocessing : 0.48
% 3.32/1.96 Parsing : 0.27
% 3.32/1.96 CNF conversion : 0.02
% 3.32/1.96 Main loop : 0.34
% 3.32/1.96 Inferencing : 0.13
% 3.32/1.96 Reduction : 0.09
% 3.32/1.96 Demodulation : 0.07
% 3.32/1.96 BG Simplification : 0.04
% 3.32/1.96 Subsumption : 0.07
% 3.32/1.96 Abstraction : 0.01
% 3.32/1.96 MUC search : 0.00
% 3.32/1.96 Cooper : 0.00
% 3.32/1.96 Total : 0.87
% 3.32/1.96 Index Insertion : 0.00
% 3.32/1.96 Index Deletion : 0.00
% 3.32/1.96 Index Matching : 0.00
% 3.32/1.96 BG Taut test : 0.00
%------------------------------------------------------------------------------