TSTP Solution File: ARI189_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI189_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 : n015.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:20 EDT 2023
% Result : Theorem 2.54s 1.58s
% Output : CNFRefutation 2.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 6 ( 4 unt; 1 typ; 0 def)
% Number of atoms : 6 ( 1 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 : 12 ( 0 atm; 3 fun; 6 num; 3 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 0 usr; 2 con; 0-2 aty)
% Number of variables : 3 (; 3 !; 0 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p,type,
p: $int > $o ).
tff(f_33,negated_conjecture,
~ ( ! [Ua: $int] : p($product(2,Ua))
=> p(10) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(c_12,plain,
! [U_5a: $int] : p($product(2,U_5a)),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_9,plain,
~ p(10),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_16,plain,
! [U_5a: $int] : ( $product(2,U_5a) != 10 ),
inference(resolution,[status(thm)],[c_12,c_9]) ).
tff(c_20,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI189_1 : TPTP v8.1.2. Released v5.0.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.15/0.35 % Computer : n015.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:28:14 EDT 2023
% 0.15/0.35 % CPUTime :
% 2.54/1.58 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.54/1.58
% 2.54/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.63/1.62
% 2.63/1.62 Inference rules
% 2.63/1.62 ----------------------
% 2.63/1.62 #Ref : 0
% 2.63/1.62 #Sup : 1
% 2.63/1.62 #Fact : 0
% 2.63/1.62 #Define : 0
% 2.63/1.62 #Split : 0
% 2.63/1.62 #Chain : 0
% 2.63/1.62 #Close : 0
% 2.63/1.62
% 2.63/1.62 Ordering : LPO
% 2.63/1.62
% 2.63/1.62 Simplification rules
% 2.63/1.62 ----------------------
% 2.63/1.62 #Subsume : 0
% 2.63/1.62 #Demod : 0
% 2.63/1.62 #Tautology : 0
% 2.63/1.62 #SimpNegUnit : 0
% 2.63/1.62 #BackRed : 0
% 2.63/1.62
% 2.63/1.62 #Partial instantiations: 0
% 2.63/1.62 #Strategies tried : 1
% 2.63/1.62
% 2.63/1.62 Timing (in seconds)
% 2.63/1.62 ----------------------
% 2.66/1.62 Preprocessing : 0.42
% 2.66/1.62 Parsing : 0.23
% 2.66/1.62 CNF conversion : 0.02
% 2.66/1.62 Main loop : 0.09
% 2.66/1.62 Inferencing : 0.03
% 2.66/1.62 Reduction : 0.02
% 2.66/1.62 Demodulation : 0.02
% 2.66/1.62 BG Simplification : 0.02
% 2.66/1.62 Subsumption : 0.02
% 2.66/1.62 Abstraction : 0.01
% 2.66/1.62 MUC search : 0.00
% 2.66/1.62 Cooper : 0.00
% 2.66/1.62 Total : 0.56
% 2.66/1.62 Index Insertion : 0.00
% 2.66/1.62 Index Deletion : 0.00
% 2.66/1.62 Index Matching : 0.00
% 2.66/1.62 BG Taut test : 0.00
%------------------------------------------------------------------------------