TSTP Solution File: ARI535_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI535_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 : n025.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:57 EDT 2023
% Result : Theorem 2.59s 1.68s
% Output : CNFRefutation 2.75s
% 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 ( 1 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 5 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 26 ( 0 atm; 7 fun; 14 num; 5 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 3 ( 1 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 0 usr; 1 con; 0-2 aty)
% Number of variables : 5 (; 3 !; 2 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p,type,
p: ( $int * $int * $int ) > $o ).
tff(f_32,negated_conjecture,
~ ? [Xa: $int,Ya: $int] :
( p(2,Ya,$sum(2,Ya))
=> p(Xa,2,$product(Xa,2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a) ).
tff(c_19,plain,
! [Y_9a: $int] : p(2,Y_9a,$sum(2,Y_9a)),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_4,plain,
! [X_1a: $int] : ~ p(X_1a,2,$product(X_1a,2)),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_9,plain,
! [X_1a: $int] : ~ p(X_1a,2,$product(2,X_1a)),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_4]) ).
tff(c_24,plain,
$sum(2,2) != $product(2,2),
inference(resolution,[status(thm)],[c_19,c_9]) ).
tff(c_27,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI535_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 : n025.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.36 % DateTime : Fri Aug 4 00:25:05 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.59/1.68 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.59/1.68
% 2.59/1.68 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.75/1.71
% 2.75/1.71 Inference rules
% 2.75/1.71 ----------------------
% 2.75/1.71 #Ref : 0
% 2.75/1.71 #Sup : 1
% 2.75/1.72 #Fact : 0
% 2.75/1.72 #Define : 0
% 2.75/1.72 #Split : 0
% 2.75/1.72 #Chain : 0
% 2.75/1.72 #Close : 0
% 2.75/1.72
% 2.75/1.72 Ordering : LPO
% 2.75/1.72
% 2.75/1.72 Simplification rules
% 2.75/1.72 ----------------------
% 2.75/1.72 #Subsume : 0
% 2.75/1.72 #Demod : 0
% 2.75/1.72 #Tautology : 0
% 2.75/1.72 #SimpNegUnit : 0
% 2.75/1.72 #BackRed : 0
% 2.75/1.72
% 2.75/1.72 #Partial instantiations: 0
% 2.75/1.72 #Strategies tried : 1
% 2.75/1.72
% 2.75/1.72 Timing (in seconds)
% 2.75/1.72 ----------------------
% 2.75/1.72 Preprocessing : 0.48
% 2.75/1.72 Parsing : 0.26
% 2.75/1.72 CNF conversion : 0.02
% 2.75/1.72 Main loop : 0.09
% 2.75/1.72 Inferencing : 0.03
% 2.75/1.72 Reduction : 0.02
% 2.75/1.72 Demodulation : 0.02
% 2.75/1.72 BG Simplification : 0.02
% 2.75/1.72 Subsumption : 0.02
% 2.75/1.72 Abstraction : 0.01
% 2.75/1.72 MUC search : 0.00
% 2.75/1.72 Cooper : 0.00
% 2.75/1.72 Total : 0.62
% 2.75/1.72 Index Insertion : 0.00
% 2.75/1.72 Index Deletion : 0.00
% 2.75/1.72 Index Matching : 0.00
% 2.75/1.72 BG Taut test : 0.00
%------------------------------------------------------------------------------