TSTP Solution File: ARI646_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI646_1 : TPTP v8.1.2. Released v6.3.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 : n014.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:10 EDT 2023
% Result : Theorem 3.02s 1.80s
% Output : CNFRefutation 3.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 82 ( 35 unt; 1 typ; 0 def)
% Number of atoms : 193 ( 92 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 196 ( 84 ~; 110 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number arithmetic : 290 ( 89 atm; 0 fun; 201 num; 0 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 1 usr; 12 con; 0-0 aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
tff(a,type,
a: $int ).
%Foreground operators:
tff(f_53,negated_conjecture,
~ ( ( $greater(10,a)
& $lesseq(0,a) )
<=> ( ( a = 9 )
| ( a = 8 )
| ( a = 7 )
| ( a = 6 )
| ( a = 5 )
| ( a = 4 )
| ( a = 3 )
| ( a = 2 )
| ( a = 1 )
| ( a = 0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
tff(c_19,plain,
( ~ $lesseq(0,a)
| ~ $greater(10,a)
| ( a != 6 ) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_50,plain,
( $less(a,0)
| ~ $less(a,10)
| ( a != 6 ) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_19]) ).
tff(c_82,plain,
a != 6,
inference(splitLeft,[status(thm)],[c_50]) ).
tff(c_28,plain,
( ~ $lesseq(0,a)
| ~ $greater(10,a)
| ( a != 9 ) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_44,plain,
( $less(a,0)
| ~ $less(a,10)
| ( a != 9 ) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_28]) ).
tff(c_64,plain,
a != 9,
inference(splitLeft,[status(thm)],[c_44]) ).
tff(c_25,plain,
( ~ $lesseq(0,a)
| ~ $greater(10,a)
| ( a != 8 ) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_46,plain,
( $less(a,0)
| ~ $less(a,10)
| ( a != 8 ) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_25]) ).
tff(c_76,plain,
a != 8,
inference(splitLeft,[status(thm)],[c_46]) ).
tff(c_22,plain,
( ~ $lesseq(0,a)
| ~ $greater(10,a)
| ( a != 7 ) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_48,plain,
( $less(a,0)
| ~ $less(a,10)
| ( a != 7 ) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_22]) ).
tff(c_68,plain,
a != 7,
inference(splitLeft,[status(thm)],[c_48]) ).
tff(c_16,plain,
( ~ $lesseq(0,a)
| ~ $greater(10,a)
| ( a != 5 ) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_52,plain,
( $less(a,0)
| ~ $less(a,10)
| ( a != 5 ) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_16]) ).
tff(c_80,plain,
a != 5,
inference(splitLeft,[status(thm)],[c_52]) ).
tff(c_13,plain,
( ~ $lesseq(0,a)
| ~ $greater(10,a)
| ( a != 4 ) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_54,plain,
( $less(a,0)
| ~ $less(a,10)
| ( a != 4 ) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_13]) ).
tff(c_74,plain,
a != 4,
inference(splitLeft,[status(thm)],[c_54]) ).
tff(c_10,plain,
( ~ $lesseq(0,a)
| ~ $greater(10,a)
| ( a != 3 ) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_56,plain,
( $less(a,0)
| ~ $less(a,10)
| ( a != 3 ) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_10]) ).
tff(c_78,plain,
a != 3,
inference(splitLeft,[status(thm)],[c_56]) ).
tff(c_7,plain,
( ~ $lesseq(0,a)
| ~ $greater(10,a)
| ( a != 2 ) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_58,plain,
( $less(a,0)
| ~ $less(a,10)
| ( a != 2 ) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_7]) ).
tff(c_72,plain,
a != 2,
inference(splitLeft,[status(thm)],[c_58]) ).
tff(c_4,plain,
( ~ $lesseq(0,a)
| ~ $greater(10,a)
| ( a != 1 ) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_60,plain,
( $less(a,0)
| ~ $less(a,10)
| ( a != 1 ) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_4]) ).
tff(c_70,plain,
a != 1,
inference(splitLeft,[status(thm)],[c_60]) ).
tff(c_1,plain,
( ~ $lesseq(0,a)
| ~ $greater(10,a)
| ( a != 0 ) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_62,plain,
( $less(a,0)
| ~ $less(a,10)
| ( a != 0 ) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_1]) ).
tff(c_66,plain,
a != 0,
inference(splitLeft,[status(thm)],[c_62]) ).
tff(c_37,plain,
( ( a = 0 )
| ( a = 1 )
| ( a = 2 )
| ( a = 3 )
| ( a = 4 )
| ( a = 5 )
| ( a = 6 )
| ( a = 7 )
| ( a = 8 )
| ( a = 9 )
| $greater(10,a) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_39,plain,
( ( a = 0 )
| ( a = 1 )
| ( a = 2 )
| ( a = 3 )
| ( a = 4 )
| ( a = 5 )
| ( a = 6 )
| ( a = 7 )
| ( a = 8 )
| ( a = 9 )
| $less(a,10) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_37]) ).
tff(c_88,plain,
$less(a,10),
inference(negUnitSimplification,[status(thm)],[c_64,c_76,c_68,c_82,c_80,c_74,c_78,c_72,c_70,c_66,c_39]) ).
tff(c_33,plain,
( ( a = 0 )
| ( a = 1 )
| ( a = 2 )
| ( a = 3 )
| ( a = 4 )
| ( a = 5 )
| ( a = 6 )
| ( a = 7 )
| ( a = 8 )
| ( a = 9 )
| $lesseq(0,a) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_41,plain,
( ( a = 0 )
| ( a = 1 )
| ( a = 2 )
| ( a = 3 )
| ( a = 4 )
| ( a = 5 )
| ( a = 6 )
| ( a = 7 )
| ( a = 8 )
| ( a = 9 )
| ~ $less(a,0) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_33]) ).
tff(c_84,plain,
( ( a = 6 )
| ~ $less(a,0) ),
inference(negUnitSimplification,[status(thm)],[c_64,c_76,c_68,c_80,c_74,c_78,c_72,c_70,c_66,c_41]) ).
tff(c_86,plain,
~ $less(a,0),
inference(splitLeft,[status(thm)],[c_84]) ).
tff(c_89,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_88,c_86,c_82,c_80,c_78,c_76,c_74,c_72,c_70,c_68,c_66,c_64]) ).
tff(c_92,plain,
a = 6,
inference(splitRight,[status(thm)],[c_84]) ).
tff(c_94,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_82,c_92]) ).
tff(c_98,plain,
a = 6,
inference(splitRight,[status(thm)],[c_50]) ).
tff(c_97,plain,
( ~ $less(a,10)
| $less(a,0) ),
inference(splitRight,[status(thm)],[c_50]) ).
tff(c_108,plain,
( ~ $less(6,10)
| $less(6,0) ),
inference(demodulation,[status(thm),theory(equality)],[c_98,c_98,c_97]) ).
tff(c_110,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_108]) ).
tff(c_114,plain,
a = 5,
inference(splitRight,[status(thm)],[c_52]) ).
tff(c_113,plain,
( ~ $less(a,10)
| $less(a,0) ),
inference(splitRight,[status(thm)],[c_52]) ).
tff(c_123,plain,
( ~ $less(5,10)
| $less(5,0) ),
inference(demodulation,[status(thm),theory(equality)],[c_114,c_114,c_113]) ).
tff(c_125,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_123]) ).
tff(c_129,plain,
a = 3,
inference(splitRight,[status(thm)],[c_56]) ).
tff(c_128,plain,
( ~ $less(a,10)
| $less(a,0) ),
inference(splitRight,[status(thm)],[c_56]) ).
tff(c_140,plain,
( ~ $less(3,10)
| $less(3,0) ),
inference(demodulation,[status(thm),theory(equality)],[c_129,c_129,c_128]) ).
tff(c_142,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_140]) ).
tff(c_146,plain,
a = 8,
inference(splitRight,[status(thm)],[c_46]) ).
tff(c_145,plain,
( ~ $less(a,10)
| $less(a,0) ),
inference(splitRight,[status(thm)],[c_46]) ).
tff(c_153,plain,
( ~ $less(8,10)
| $less(8,0) ),
inference(demodulation,[status(thm),theory(equality)],[c_146,c_146,c_145]) ).
tff(c_155,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_153]) ).
tff(c_159,plain,
a = 4,
inference(splitRight,[status(thm)],[c_54]) ).
tff(c_158,plain,
( ~ $less(a,10)
| $less(a,0) ),
inference(splitRight,[status(thm)],[c_54]) ).
tff(c_165,plain,
( ~ $less(4,10)
| $less(4,0) ),
inference(demodulation,[status(thm),theory(equality)],[c_159,c_159,c_158]) ).
tff(c_167,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_165]) ).
tff(c_171,plain,
a = 2,
inference(splitRight,[status(thm)],[c_58]) ).
tff(c_170,plain,
( ~ $less(a,10)
| $less(a,0) ),
inference(splitRight,[status(thm)],[c_58]) ).
tff(c_179,plain,
( ~ $less(2,10)
| $less(2,0) ),
inference(demodulation,[status(thm),theory(equality)],[c_171,c_171,c_170]) ).
tff(c_181,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_179]) ).
tff(c_185,plain,
a = 1,
inference(splitRight,[status(thm)],[c_60]) ).
tff(c_184,plain,
( ~ $less(a,10)
| $less(a,0) ),
inference(splitRight,[status(thm)],[c_60]) ).
tff(c_189,plain,
( ~ $less(1,10)
| $less(1,0) ),
inference(demodulation,[status(thm),theory(equality)],[c_185,c_185,c_184]) ).
tff(c_191,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_189]) ).
tff(c_195,plain,
a = 7,
inference(splitRight,[status(thm)],[c_48]) ).
tff(c_194,plain,
( ~ $less(a,10)
| $less(a,0) ),
inference(splitRight,[status(thm)],[c_48]) ).
tff(c_198,plain,
( ~ $less(7,10)
| $less(7,0) ),
inference(demodulation,[status(thm),theory(equality)],[c_195,c_195,c_194]) ).
tff(c_200,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_198]) ).
tff(c_204,plain,
a = 0,
inference(splitRight,[status(thm)],[c_62]) ).
tff(c_203,plain,
( ~ $less(a,10)
| $less(a,0) ),
inference(splitRight,[status(thm)],[c_62]) ).
tff(c_206,plain,
( ~ $less(0,10)
| $less(0,0) ),
inference(demodulation,[status(thm),theory(equality)],[c_204,c_204,c_203]) ).
tff(c_208,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_206]) ).
tff(c_212,plain,
a = 9,
inference(splitRight,[status(thm)],[c_44]) ).
tff(c_211,plain,
( ~ $less(a,10)
| $less(a,0) ),
inference(splitRight,[status(thm)],[c_44]) ).
tff(c_213,plain,
( ~ $less(9,10)
| $less(9,0) ),
inference(demodulation,[status(thm),theory(equality)],[c_212,c_212,c_211]) ).
tff(c_215,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_213]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI646_1 : TPTP v8.1.2. Released v6.3.0.
% 0.00/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 : n014.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri Aug 4 00:05:18 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.02/1.80 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.02/1.81
% 3.02/1.81 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.20/1.85
% 3.20/1.85 Inference rules
% 3.20/1.85 ----------------------
% 3.20/1.85 #Ref : 0
% 3.20/1.85 #Sup : 0
% 3.20/1.85 #Fact : 0
% 3.20/1.85 #Define : 0
% 3.20/1.85 #Split : 12
% 3.20/1.85 #Chain : 0
% 3.20/1.85 #Close : 1
% 3.20/1.85
% 3.20/1.85 Ordering : LPO
% 3.20/1.85
% 3.20/1.85 Simplification rules
% 3.20/1.85 ----------------------
% 3.20/1.85 #Subsume : 0
% 3.20/1.85 #Demod : 69
% 3.20/1.85 #Tautology : 59
% 3.20/1.85 #SimpNegUnit : 3
% 3.20/1.85 #BackRed : 0
% 3.20/1.85
% 3.20/1.85 #Partial instantiations: 0
% 3.20/1.85 #Strategies tried : 1
% 3.20/1.85
% 3.20/1.85 Timing (in seconds)
% 3.20/1.85 ----------------------
% 3.20/1.85 Preprocessing : 0.48
% 3.20/1.85 Parsing : 0.25
% 3.20/1.85 CNF conversion : 0.02
% 3.20/1.85 Main loop : 0.29
% 3.20/1.85 Inferencing : 0.00
% 3.20/1.85 Reduction : 0.07
% 3.20/1.85 Demodulation : 0.05
% 3.20/1.85 BG Simplification : 0.06
% 3.20/1.85 Subsumption : 0.08
% 3.20/1.85 Abstraction : 0.00
% 3.20/1.85 MUC search : 0.03
% 3.20/1.85 Cooper : 0.08
% 3.20/1.85 Total : 0.84
% 3.20/1.85 Index Insertion : 0.00
% 3.20/1.85 Index Deletion : 0.00
% 3.20/1.85 Index Matching : 0.00
% 3.20/1.85 BG Taut test : 0.00
%------------------------------------------------------------------------------