TSTP Solution File: ARI187_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI187_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 : n001.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.32s 1.59s
% Output : CNFRefutation 2.32s
% 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 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 3 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 11 ( 0 atm; 3 fun; 8 num; 0 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 7 ( 0 usr; 5 con; 0-2 aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p,type,
p: $int > $o ).
tff(f_32,negated_conjecture,
~ ( p($sum($product(14,3),8))
=> p(50) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(c_4,plain,
p($sum(42,8)),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_6,plain,
p(50),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_4]) ).
tff(c_7,plain,
~ p(50),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_9,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : ARI187_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 : n001.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:42:56 EDT 2023
% 0.14/0.37 % CPUTime :
% 2.32/1.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.32/1.59
% 2.32/1.59 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.32/1.63
% 2.32/1.63 Inference rules
% 2.32/1.63 ----------------------
% 2.32/1.63 #Ref : 0
% 2.32/1.63 #Sup : 0
% 2.32/1.63 #Fact : 0
% 2.32/1.63 #Define : 0
% 2.32/1.63 #Split : 0
% 2.32/1.63 #Chain : 0
% 2.32/1.63 #Close : 0
% 2.32/1.63
% 2.32/1.63 Ordering : LPO
% 2.32/1.63
% 2.32/1.63 Simplification rules
% 2.32/1.63 ----------------------
% 2.32/1.63 #Subsume : 1
% 2.32/1.63 #Demod : 1
% 2.32/1.63 #Tautology : 0
% 2.32/1.63 #SimpNegUnit : 0
% 2.32/1.63 #BackRed : 0
% 2.32/1.63
% 2.32/1.63 #Partial instantiations: 0
% 2.32/1.63 #Strategies tried : 1
% 2.32/1.63
% 2.32/1.63 Timing (in seconds)
% 2.32/1.63 ----------------------
% 2.32/1.63 Preprocessing : 0.41
% 2.32/1.63 Parsing : 0.24
% 2.32/1.63 CNF conversion : 0.01
% 2.32/1.63 Main loop : 0.04
% 2.32/1.63 Inferencing : 0.00
% 2.32/1.63 Reduction : 0.02
% 2.32/1.63 Demodulation : 0.01
% 2.32/1.63 BG Simplification : 0.01
% 2.32/1.63 Subsumption : 0.02
% 2.32/1.63 Abstraction : 0.00
% 2.32/1.63 MUC search : 0.00
% 2.32/1.64 Cooper : 0.00
% 2.32/1.64 Total : 0.51
% 2.32/1.64 Index Insertion : 0.00
% 2.32/1.64 Index Deletion : 0.00
% 2.32/1.64 Index Matching : 0.00
% 2.32/1.64 BG Taut test : 0.00
%------------------------------------------------------------------------------