TSTP Solution File: ARI594_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI594_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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/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:04 EDT 2023
% Result : Theorem 2.68s 1.68s
% Output : CNFRefutation 2.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 2 unt; 1 typ; 0 def)
% Number of atoms : 14 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 12 ( 4 ~; 5 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 30 ( 8 atm; 4 fun; 12 num; 6 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 : 4 ( 0 usr; 3 con; 0-2 aty)
% Number of variables : 6 (; 5 !; 1 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p,type,
p: $int > $o ).
tff(f_37,negated_conjecture,
~ ( ! [Za: $int] :
( ( $lesseq(5,Za)
& $lesseq(Za,7) )
=> p(Za) )
=> ? [Xa: $int] : p($product(3,Xa)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',exists_X_in_5_to_7_div_3) ).
tff(c_3,plain,
! [Z_1a: $int] :
( p(Z_1a)
| ~ $lesseq(5,Z_1a)
| ~ $lesseq(Z_1a,7) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_13,plain,
! [Z_7a: $int] :
( p(Z_7a)
| $less(Z_7a,5)
| $less(7,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),5)
| $less(7,$product(3,X_2a)) ),
inference(resolution,[status(thm)],[c_13,c_9]) ).
tff(c_20,plain,
$false,
inference(quantifierElimination,[status(thm),theory('LIA')],[c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ARI594_1 : TPTP v8.1.2. Released v5.1.0.
% 0.00/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Aug 4 00:20:35 EDT 2023
% 0.12/0.34 % CPUTime :
% 2.68/1.68 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.68/1.68
% 2.68/1.68 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.91/1.72
% 2.91/1.72 Inference rules
% 2.91/1.72 ----------------------
% 2.91/1.72 #Ref : 0
% 2.91/1.72 #Sup : 1
% 2.91/1.72 #Fact : 0
% 2.91/1.72 #Define : 0
% 2.91/1.72 #Split : 0
% 2.91/1.72 #Chain : 0
% 2.91/1.72 #Close : 0
% 2.91/1.72
% 2.91/1.72 Ordering : LPO
% 2.91/1.72
% 2.91/1.72 Simplification rules
% 2.91/1.72 ----------------------
% 2.91/1.72 #Subsume : 0
% 2.91/1.72 #Demod : 0
% 2.91/1.72 #Tautology : 0
% 2.91/1.72 #SimpNegUnit : 0
% 2.91/1.72 #BackRed : 0
% 2.91/1.72
% 2.91/1.72 #Partial instantiations: 0
% 2.91/1.72 #Strategies tried : 1
% 2.91/1.72
% 2.91/1.72 Timing (in seconds)
% 2.91/1.72 ----------------------
% 2.91/1.72 Preprocessing : 0.48
% 2.91/1.72 Parsing : 0.26
% 2.91/1.72 CNF conversion : 0.02
% 2.91/1.72 Main loop : 0.13
% 2.91/1.72 Inferencing : 0.05
% 2.91/1.72 Reduction : 0.01
% 2.91/1.72 Demodulation : 0.01
% 2.91/1.72 BG Simplification : 0.02
% 2.91/1.72 Subsumption : 0.02
% 2.91/1.72 Abstraction : 0.01
% 2.91/1.72 MUC search : 0.00
% 2.91/1.73 Cooper : 0.03
% 2.91/1.73 Total : 0.66
% 2.91/1.73 Index Insertion : 0.00
% 2.91/1.73 Index Deletion : 0.00
% 2.91/1.73 Index Matching : 0.00
% 2.91/1.73 BG Taut test : 0.00
%------------------------------------------------------------------------------