TSTP Solution File: ARI622_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI622_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 : n002.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.00s 1.79s
% Output : CNFRefutation 3.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 7 unt; 2 typ; 0 def)
% Number of atoms : 35 ( 4 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 31 ( 12 ~; 13 |; 4 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 63 ( 7 atm; 14 fun; 32 num; 10 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 : 9 ( 1 usr; 5 con; 0-2 aty)
% Number of variables : 10 (; 7 !; 3 ?; 10 :)
% 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_46,negated_conjecture,
~ ( ! [Xa: $int] :
( pow2(Xa)
<=> ( ( Xa = 1 )
| ( $lesseq(2,Xa)
& ? [Ya: $int] :
( ( $product(2,Ya) = Xa )
& pow2(Ya) ) ) ) )
=> ? [Xa: $int,Ya: $int] :
( pow2(Xa)
& pow2(Ya)
& ( $sum(Xa,Ya) = 10 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_of_pows_of_2_eq_10) ).
tff(c_13,plain,
pow2(1),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_9,plain,
! [Y_4a: $int] :
( ~ pow2(Y_4a)
| pow2($product(2,Y_4a))
| ~ $lesseq(2,$product(2,Y_4a)) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_50,plain,
! [Y_16a: $int] :
( ~ pow2(Y_16a)
| pow2($product(2,Y_16a))
| $less(Y_16a,1) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_9]) ).
tff(c_53,plain,
( pow2($product(2,1))
| $less(1,1) ),
inference(resolution,[status(thm)],[c_13,c_50]) ).
tff(c_55,plain,
pow2(2),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_53]) ).
tff(c_1,plain,
! [Y_6a: $int,X_5a: $int] :
( ~ pow2(Y_6a)
| ~ pow2(X_5a)
| ( $sum(X_5a,Y_6a) != 10 ) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_24,plain,
! [Y_6a: $int] :
( ~ pow2(Y_6a)
| ~ pow2($sum(10,$uminus(Y_6a))) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_1]) ).
tff(c_69,plain,
~ pow2($sum(10,$uminus(2))),
inference(resolution,[status(thm)],[c_55,c_24]) ).
tff(c_71,plain,
~ pow2(8),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_69]) ).
tff(c_17,plain,
! [Y_4a: $int] :
( ~ pow2(Y_4a)
| pow2($product(2,Y_4a))
| $less(Y_4a,1) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_9]) ).
tff(c_66,plain,
( pow2($product(2,2))
| $less(2,1) ),
inference(resolution,[status(thm)],[c_55,c_17]) ).
tff(c_68,plain,
pow2(4),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_66]) ).
tff(c_88,plain,
( pow2($product(2,4))
| $less(4,1) ),
inference(resolution,[status(thm)],[c_68,c_17]) ).
tff(c_90,plain,
pow2(8),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_88]) ).
tff(c_113,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_71,c_90]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI622_1 : TPTP v8.1.2. Released v5.1.0.
% 0.00/0.14 % 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.15/0.35 % Computer : n002.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri Aug 4 00:27:01 EDT 2023
% 0.15/0.35 % CPUTime :
% 3.00/1.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.00/1.79
% 3.00/1.79 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.00/1.82
% 3.00/1.82 Inference rules
% 3.00/1.82 ----------------------
% 3.00/1.82 #Ref : 0
% 3.00/1.82 #Sup : 15
% 3.00/1.82 #Fact : 0
% 3.00/1.82 #Define : 0
% 3.00/1.82 #Split : 0
% 3.00/1.82 #Chain : 0
% 3.00/1.82 #Close : 0
% 3.00/1.82
% 3.00/1.82 Ordering : LPO
% 3.00/1.82
% 3.00/1.82 Simplification rules
% 3.00/1.82 ----------------------
% 3.00/1.82 #Subsume : 0
% 3.00/1.82 #Demod : 2
% 3.00/1.82 #Tautology : 7
% 3.00/1.82 #SimpNegUnit : 1
% 3.00/1.82 #BackRed : 0
% 3.00/1.82
% 3.00/1.82 #Partial instantiations: 0
% 3.00/1.82 #Strategies tried : 1
% 3.00/1.82
% 3.00/1.82 Timing (in seconds)
% 3.00/1.82 ----------------------
% 3.00/1.82 Preprocessing : 0.50
% 3.00/1.82 Parsing : 0.27
% 3.00/1.82 CNF conversion : 0.03
% 3.00/1.82 Main loop : 0.19
% 3.00/1.82 Inferencing : 0.07
% 3.00/1.82 Reduction : 0.04
% 3.00/1.82 Demodulation : 0.03
% 3.00/1.82 BG Simplification : 0.04
% 3.00/1.82 Subsumption : 0.05
% 3.00/1.82 Abstraction : 0.01
% 3.00/1.82 MUC search : 0.00
% 3.00/1.82 Cooper : 0.00
% 3.00/1.82 Total : 0.73
% 3.00/1.82 Index Insertion : 0.00
% 3.00/1.82 Index Deletion : 0.00
% 3.00/1.82 Index Matching : 0.00
% 3.00/1.83 BG Taut test : 0.00
%------------------------------------------------------------------------------