TSTP Solution File: ARI598_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI598_1 : TPTP v8.1.2. Released v5.1.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:34:05 EDT 2023
% Result : Theorem 2.50s 1.62s
% Output : CNFRefutation 2.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 10 unt; 2 typ; 0 def)
% Number of atoms : 13 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 9 ( 7 ~; 0 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 37 ( 0 atm; 15 fun; 17 num; 5 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 1 usr; 4 con; 0-2 aty)
% Number of variables : 5 (; 4 !; 1 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > #nlpp
%Foreground sorts:
%Background operators:
tff(a,type,
a: $int ).
%Foreground operators:
tff(p,type,
p: $int > $o ).
tff(f_34,negated_conjecture,
~ ( ( p(a)
& p($sum($product(3,a),1)) )
=> ? [Xa: $int] : p($product(2,Xa)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_or_3aplus1_even) ).
tff(c_4,plain,
p($sum($product(3,a),1)),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_35,plain,
p($sum(1,$product(3,a))),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_4]) ).
tff(c_19,plain,
! [X_1a: $int] : ~ p($product(2,X_1a)),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_40,plain,
! [X_1a: $int] : ( $product(2,X_1a) != $sum(1,$product(3,a)) ),
inference(resolution,[status(thm)],[c_35,c_19]) ).
tff(c_42,plain,
~ $divides(2,$sum(1,$product(3,a))),
inference(quantifierElimination,[status(thm),theory('LIA')],[c_40]) ).
tff(c_11,plain,
p(a),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_27,plain,
! [X_10a: $int] : ~ p($product(2,X_10a)),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_32,plain,
! [X_10a: $int] : ( a != $product(2,X_10a) ),
inference(resolution,[status(thm)],[c_11,c_27]) ).
tff(c_34,plain,
~ $divides(2,a),
inference(quantifierElimination,[status(thm),theory('LIA')],[c_32]) ).
tff(c_43,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_42,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI598_1 : TPTP v8.1.2. Released v5.1.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.16/0.36 % Computer : n025.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri Aug 4 00:24:05 EDT 2023
% 0.16/0.36 % CPUTime :
% 2.50/1.62 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.74/1.62
% 2.74/1.62 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.74/1.65
% 2.74/1.65 Inference rules
% 2.74/1.65 ----------------------
% 2.74/1.65 #Ref : 0
% 2.74/1.65 #Sup : 2
% 2.74/1.65 #Fact : 0
% 2.74/1.65 #Define : 0
% 2.74/1.65 #Split : 0
% 2.74/1.65 #Chain : 0
% 2.74/1.65 #Close : 1
% 2.74/1.65
% 2.74/1.65 Ordering : LPO
% 2.79/1.65
% 2.79/1.65 Simplification rules
% 2.79/1.65 ----------------------
% 2.79/1.65 #Subsume : 0
% 2.79/1.65 #Demod : 0
% 2.79/1.65 #Tautology : 0
% 2.79/1.65 #SimpNegUnit : 0
% 2.79/1.65 #BackRed : 0
% 2.79/1.65
% 2.79/1.65 #Partial instantiations: 0
% 2.79/1.65 #Strategies tried : 1
% 2.79/1.65
% 2.79/1.65 Timing (in seconds)
% 2.79/1.65 ----------------------
% 2.79/1.66 Preprocessing : 0.44
% 2.79/1.66 Parsing : 0.25
% 2.79/1.66 CNF conversion : 0.02
% 2.79/1.66 Main loop : 0.16
% 2.79/1.66 Inferencing : 0.04
% 2.79/1.66 Reduction : 0.02
% 2.79/1.66 Demodulation : 0.02
% 2.79/1.66 BG Simplification : 0.02
% 2.79/1.66 Subsumption : 0.03
% 2.79/1.66 Abstraction : 0.01
% 2.79/1.66 MUC search : 0.00
% 2.79/1.66 Cooper : 0.04
% 2.79/1.66 Total : 0.65
% 2.79/1.66 Index Insertion : 0.00
% 2.79/1.66 Index Deletion : 0.00
% 2.79/1.66 Index Matching : 0.00
% 2.79/1.66 BG Taut test : 0.00
%------------------------------------------------------------------------------