TSTP Solution File: ARI595_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI595_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 : 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:34:04 EDT 2023
% Result : Theorem 2.64s 1.64s
% Output : CNFRefutation 2.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 5 unt; 2 typ; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 15 ( 7 ~; 5 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 37 ( 8 atm; 10 fun; 13 num; 6 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 1 usr; 4 con; 0-2 aty)
% Number of variables : 6 (; 5 !; 1 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > #nlpp
%Foreground sorts:
%Background operators:
tff(a,type,
a: $int ).
%Foreground operators:
tff(p,type,
p: $int > $o ).
tff(f_37,negated_conjecture,
~ ( ! [Za: $int] :
( ( $lesseq(a,Za)
& $lesseq(Za,$sum(a,2)) )
=> p(Za) )
=> ? [Xa: $int] : p($product(3,Xa)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exists_X_in_a_to_aplus2_div_3) ).
tff(c_3,plain,
! [Z_1a: $int] :
( p(Z_1a)
| ~ $lesseq(a,Z_1a)
| ~ $lesseq(Z_1a,$sum(a,2)) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_13,plain,
! [Z_7a: $int] :
( p(Z_7a)
| $less(Z_7a,a)
| $less($sum(2,a),Z_7a) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_3]) ).
tff(c_9,plain,
! [X_2a: $int] : ~ p($product(3,X_2a)),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_18,plain,
! [X_2a: $int] :
( $less($product(3,X_2a),a)
| $less($sum(2,a),$product(3,X_2a)) ),
inference(resolution,[status(thm)],[c_13,c_9]) ).
tff(c_22,plain,
~ $divides(3,a),
inference(quantifierElimination,[status(thm),theory('LIA')],[c_18]) ).
tff(c_23,plain,
~ $divides(3,$sum(1,a)),
inference(quantifierElimination,[status(thm),theory('LIA')],[c_18]) ).
tff(c_24,plain,
~ $divides(3,$sum(2,a)),
inference(quantifierElimination,[status(thm),theory('LIA')],[c_18]) ).
tff(c_25,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_22,c_23,c_24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI595_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.19/0.36 % Computer : n015.cluster.edu
% 0.19/0.36 % Model : x86_64 x86_64
% 0.19/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.36 % Memory : 8042.1875MB
% 0.19/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.36 % CPULimit : 300
% 0.19/0.36 % WCLimit : 300
% 0.19/0.36 % DateTime : Fri Aug 4 00:26:44 EDT 2023
% 0.19/0.36 % CPUTime :
% 2.64/1.64 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/1.65
% 2.64/1.65 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.81/1.68
% 2.81/1.68 Inference rules
% 2.81/1.68 ----------------------
% 2.81/1.68 #Ref : 0
% 2.81/1.68 #Sup : 1
% 2.81/1.68 #Fact : 0
% 2.81/1.68 #Define : 0
% 2.81/1.68 #Split : 0
% 2.81/1.68 #Chain : 0
% 2.81/1.68 #Close : 1
% 2.81/1.68
% 2.81/1.68 Ordering : LPO
% 2.81/1.68
% 2.81/1.68 Simplification rules
% 2.81/1.68 ----------------------
% 2.81/1.68 #Subsume : 0
% 2.81/1.68 #Demod : 0
% 2.81/1.68 #Tautology : 0
% 2.81/1.68 #SimpNegUnit : 0
% 2.81/1.68 #BackRed : 0
% 2.81/1.68
% 2.81/1.68 #Partial instantiations: 0
% 2.81/1.68 #Strategies tried : 1
% 2.81/1.68
% 2.81/1.68 Timing (in seconds)
% 2.81/1.68 ----------------------
% 2.81/1.68 Preprocessing : 0.45
% 2.81/1.68 Parsing : 0.25
% 2.81/1.68 CNF conversion : 0.02
% 2.81/1.68 Main loop : 0.15
% 2.81/1.68 Inferencing : 0.05
% 2.81/1.68 Reduction : 0.01
% 2.81/1.68 Demodulation : 0.01
% 2.81/1.68 BG Simplification : 0.02
% 2.81/1.68 Subsumption : 0.02
% 2.81/1.68 Abstraction : 0.01
% 2.81/1.68 MUC search : 0.00
% 2.81/1.68 Cooper : 0.04
% 2.81/1.68 Total : 0.65
% 2.81/1.68 Index Insertion : 0.00
% 2.81/1.68 Index Deletion : 0.00
% 2.81/1.68 Index Matching : 0.00
% 2.81/1.68 BG Taut test : 0.00
%------------------------------------------------------------------------------