TSTP Solution File: ARI180_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI180_1 : TPTP v8.1.2. Released v5.0.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 : 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:33:19 EDT 2023
% Result : Theorem 2.76s 1.66s
% Output : CNFRefutation 2.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 12 unt; 4 typ; 0 def)
% Number of atoms : 17 ( 16 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 8 ( 5 ~; 1 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 16 ( 0 atm; 5 fun; 9 num; 2 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 2 (; 2 !; 0 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > f
%Foreground sorts:
%Background operators:
tff('#skE_1',type,
'#skE_1': $int ).
tff('#skF_2',type,
'#skF_2': $int ).
tff('#skF_1',type,
'#skF_1': $int ).
%Foreground operators:
tff(f,type,
f: $int > $int ).
tff(f_35,negated_conjecture,
~ ! [Ua: $int,Va: $int] :
( ( ( $sum(Ua,Va) = f(Ua) )
& ( $difference(Va,f(Ua)) = 0 ) )
=> ( Va = f(0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(c_16,plain,
f(0) != '#skF_2',
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_21,plain,
f(0) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_16]) ).
tff(c_25,plain,
'#skF_2' != '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_21,c_16]) ).
tff(c_4,plain,
$difference('#skF_2',f('#skF_1')) = 0,
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_32,plain,
f('#skF_1') = '#skF_2',
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_4]) ).
tff(c_24,plain,
f(0) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_16]) ).
tff(c_38,plain,
( ( '#skF_2' = '#skE_1' )
| ( '#skF_1' != 0 ) ),
inference(superposition,[status(thm),theory(equality)],[c_32,c_24]) ).
tff(c_49,plain,
'#skF_1' != 0,
inference(negUnitSimplification,[status(thm)],[c_25,c_38]) ).
tff(c_15,plain,
f('#skF_1') = '#skF_2',
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_4]) ).
tff(c_55,plain,
f('#skF_1') = $sum('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_83,plain,
$sum('#skF_1','#skF_2') = '#skF_2',
inference(superposition,[status(thm),theory(equality)],[c_15,c_55]) ).
tff(c_85,plain,
'#skF_1' = 0,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_83]) ).
tff(c_86,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_49,c_85]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ARI180_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.13 % 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.33 % Computer : n022.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Fri Aug 4 00:09:33 EDT 2023
% 0.14/0.33 % CPUTime :
% 2.76/1.66 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.76/1.66
% 2.76/1.66 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.76/1.69
% 2.76/1.69 Inference rules
% 2.76/1.69 ----------------------
% 2.76/1.69 #Ref : 0
% 2.76/1.69 #Sup : 12
% 2.76/1.69 #Fact : 0
% 2.76/1.69 #Define : 1
% 2.76/1.69 #Split : 0
% 2.76/1.69 #Chain : 0
% 2.76/1.69 #Close : 0
% 2.76/1.69
% 2.76/1.69 Ordering : LPO
% 2.76/1.69
% 2.76/1.69 Simplification rules
% 2.76/1.69 ----------------------
% 2.76/1.69 #Subsume : 3
% 2.76/1.69 #Demod : 1
% 2.76/1.69 #Tautology : 6
% 2.76/1.69 #SimpNegUnit : 3
% 2.76/1.69 #BackRed : 0
% 2.76/1.69
% 2.76/1.69 #Partial instantiations: 0
% 2.76/1.69 #Strategies tried : 1
% 2.76/1.69
% 2.76/1.69 Timing (in seconds)
% 2.76/1.69 ----------------------
% 2.76/1.70 Preprocessing : 0.46
% 2.76/1.70 Parsing : 0.25
% 2.76/1.70 CNF conversion : 0.02
% 2.76/1.70 Main loop : 0.14
% 2.76/1.70 Inferencing : 0.04
% 2.76/1.70 Reduction : 0.03
% 2.76/1.70 Demodulation : 0.02
% 2.76/1.70 BG Simplification : 0.02
% 2.76/1.70 Subsumption : 0.03
% 2.76/1.70 Abstraction : 0.01
% 2.76/1.70 MUC search : 0.00
% 2.76/1.70 Cooper : 0.01
% 2.76/1.70 Total : 0.66
% 2.76/1.70 Index Insertion : 0.00
% 2.76/1.70 Index Deletion : 0.00
% 2.76/1.70 Index Matching : 0.00
% 2.76/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------