TSTP Solution File: ARI620_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI620_1 : 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 : n022.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 2.75s 1.62s
% Output : CNFRefutation 2.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 6 unt; 2 typ; 0 def)
% Number of atoms : 27 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 20 ( 6 ~; 10 |; 2 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 48 ( 7 atm; 8 fun; 28 num; 5 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 1 usr; 4 con; 0-2 aty)
% Number of variables : 5 (; 4 !; 1 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
%$ pow2 > #nlpp > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': $int > $int ).
tff(pow2,type,
pow2: $int > $o ).
tff(f_41,negated_conjecture,
~ ( ! [Xa: $int] :
( pow2(Xa)
<=> ( ( Xa = 1 )
| ( $lesseq(2,Xa)
& ? [Ya: $int] :
( ( $product(2,Ya) = Xa )
& pow2(Ya) ) ) ) )
=> pow2(8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pow_of_2_8) ).
tff(c_20,plain,
~ pow2(8),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_12,plain,
pow2(1),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_8,plain,
! [Y_4a: $int] :
( ~ pow2(Y_4a)
| pow2($product(2,Y_4a))
| ~ $lesseq(2,$product(2,Y_4a)) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_38,plain,
! [Y_10a: $int] :
( ~ pow2(Y_10a)
| pow2($product(2,Y_10a))
| $less(Y_10a,1) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_8]) ).
tff(c_41,plain,
( pow2($product(2,1))
| $less(1,1) ),
inference(resolution,[status(thm)],[c_12,c_38]) ).
tff(c_43,plain,
pow2(2),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_41]) ).
tff(c_16,plain,
! [Y_4a: $int] :
( ~ pow2(Y_4a)
| pow2($product(2,Y_4a))
| $less(Y_4a,1) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_8]) ).
tff(c_52,plain,
( pow2($product(2,2))
| $less(2,1) ),
inference(resolution,[status(thm)],[c_43,c_16]) ).
tff(c_54,plain,
pow2(4),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_52]) ).
tff(c_69,plain,
( pow2($product(2,4))
| $less(4,1) ),
inference(resolution,[status(thm)],[c_54,c_16]) ).
tff(c_71,plain,
pow2(8),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_69]) ).
tff(c_78,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_20,c_71]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ARI620_1 : TPTP v8.1.2. Released v5.1.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.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Aug 4 00:09:48 EDT 2023
% 0.20/0.34 % CPUTime :
% 2.75/1.62 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.75/1.62
% 2.75/1.62 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.75/1.64
% 2.75/1.64 Inference rules
% 2.75/1.64 ----------------------
% 2.75/1.64 #Ref : 0
% 2.75/1.64 #Sup : 9
% 2.75/1.64 #Fact : 0
% 2.75/1.64 #Define : 0
% 2.75/1.64 #Split : 0
% 2.75/1.64 #Chain : 0
% 2.75/1.64 #Close : 0
% 2.75/1.64
% 2.75/1.64 Ordering : LPO
% 2.75/1.64
% 2.75/1.64 Simplification rules
% 2.75/1.64 ----------------------
% 2.75/1.64 #Subsume : 0
% 2.75/1.64 #Demod : 0
% 2.75/1.64 #Tautology : 4
% 2.75/1.64 #SimpNegUnit : 1
% 2.75/1.64 #BackRed : 0
% 2.75/1.64
% 2.75/1.64 #Partial instantiations: 0
% 2.75/1.64 #Strategies tried : 1
% 2.75/1.64
% 2.75/1.64 Timing (in seconds)
% 2.75/1.64 ----------------------
% 2.75/1.64 Preprocessing : 0.46
% 2.75/1.64 Parsing : 0.25
% 2.75/1.64 CNF conversion : 0.03
% 2.75/1.64 Main loop : 0.15
% 2.75/1.64 Inferencing : 0.06
% 2.75/1.64 Reduction : 0.03
% 2.75/1.64 Demodulation : 0.02
% 2.75/1.64 BG Simplification : 0.03
% 2.75/1.64 Subsumption : 0.04
% 2.75/1.64 Abstraction : 0.00
% 2.75/1.64 MUC search : 0.00
% 2.75/1.64 Cooper : 0.00
% 2.75/1.64 Total : 0.64
% 2.75/1.64 Index Insertion : 0.00
% 2.75/1.64 Index Deletion : 0.00
% 2.75/1.64 Index Matching : 0.00
% 2.75/1.64 BG Taut test : 0.00
%------------------------------------------------------------------------------