TSTP Solution File: ARI490_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI490_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 : n018.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:52 EDT 2023
% Result : Theorem 2.52s 1.66s
% Output : CNFRefutation 2.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 5 unt; 1 typ; 0 def)
% Number of atoms : 7 ( 3 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 4 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 15 ( 3 atm; 2 fun; 9 num; 1 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 1 usr; 5 con; 0-2 aty)
% Number of variables : 1 (; 1 !; 0 ?; 1 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
tff('#skF_1',type,
'#skF_1': $real ).
%Foreground operators:
tff(f_32,negated_conjecture,
~ ! [Xa: $real] :
( ( $sum(12/5,37/10) = Xa )
=> $less(Xa,7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',real_combined_problem_5) ).
tff(c_2,plain,
'#skF_1' = $sum(12/5,37/10),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_3,plain,
'#skF_1' = 61/10,
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_2]) ).
tff(c_1,plain,
~ $less('#skF_1',7),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_4,plain,
~ $less(61/10,7),
inference(demodulation,[status(thm),theory(equality)],[c_3,c_1]) ).
tff(c_5,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LFA')],[c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : ARI490_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.15 % 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.37 % Computer : n018.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Fri Aug 4 00:16:36 EDT 2023
% 0.14/0.37 % CPUTime :
% 2.52/1.66 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.52/1.67
% 2.52/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.52/1.70
% 2.52/1.70 Inference rules
% 2.52/1.70 ----------------------
% 2.52/1.70 #Ref : 0
% 2.52/1.70 #Sup : 0
% 2.52/1.70 #Fact : 0
% 2.52/1.70 #Define : 0
% 2.52/1.71 #Split : 0
% 2.52/1.71 #Chain : 0
% 2.52/1.71 #Close : 0
% 2.52/1.71
% 2.52/1.71 Ordering : LPO
% 2.52/1.71
% 2.52/1.71 Simplification rules
% 2.52/1.71 ----------------------
% 2.52/1.71 #Subsume : 1
% 2.52/1.71 #Demod : 1
% 2.52/1.71 #Tautology : 0
% 2.52/1.71 #SimpNegUnit : 0
% 2.52/1.71 #BackRed : 0
% 2.52/1.71
% 2.52/1.71 #Partial instantiations: 0
% 2.52/1.71 #Strategies tried : 1
% 2.52/1.71
% 2.52/1.71 Timing (in seconds)
% 2.52/1.71 ----------------------
% 2.52/1.71 Preprocessing : 0.49
% 2.52/1.71 Parsing : 0.24
% 2.52/1.71 CNF conversion : 0.02
% 2.52/1.71 Main loop : 0.02
% 2.52/1.71 Inferencing : 0.00
% 2.52/1.71 Reduction : 0.02
% 2.52/1.71 Demodulation : 0.01
% 2.52/1.71 BG Simplification : 0.01
% 2.52/1.71 Subsumption : 0.00
% 2.52/1.71 Abstraction : 0.00
% 2.52/1.71 MUC search : 0.00
% 2.52/1.71 Cooper : 0.00
% 2.52/1.71 Total : 0.57
% 2.52/1.71 Index Insertion : 0.00
% 2.52/1.71 Index Deletion : 0.00
% 2.52/1.71 Index Matching : 0.00
% 2.52/1.71 BG Taut test : 0.00
%------------------------------------------------------------------------------