TSTP Solution File: ARI585_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI585_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 : n012.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:03 EDT 2023
% Result : Theorem 1.95s 1.51s
% Output : CNFRefutation 2.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 5 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 15 ( 5 ~; 2 |; 6 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 42 ( 12 atm; 9 fun; 9 num; 12 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 0 usr; 3 con; 0-2 aty)
% Number of variables : 12 (; 7 !; 5 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_38,negated_conjecture,
~ ! [Xa: $int] :
? [Ya: $int] :
! [Za: $int] :
( ( $less($sum(Xa,5),Za)
& $less(Za,$sum(Xa,8)) )
=> ( $less(Ya,Za)
& $less(Za,$sum(Ya,4)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',interv_4_can_cover_interv_3) ).
tff(f_400,plain,
? [Xa: $int] :
! [Ya: $int] :
? [Za: $int] :
( $less($sum(Xa,5),Za)
& $less(Za,$sum(Xa,8))
& ( ~ $less(Ya,Za)
| ~ $less(Za,$sum(Ya,4)) ) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(f_403,plain,
! [Xa: $int,Ya: $int,Za: $int] :
( ? [Xa: $int] :
! [Ya: $int] :
? [Za: $int] :
( $less($sum(Xa,5),Za)
& $less(Za,$sum(Xa,8))
& ( ~ $less(Ya,Za)
| ~ $less(Za,$sum(Ya,4)) ) )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],]) ).
tff(f_404,plain,
$false,
inference(equivalence,[status(thm)],[f_400,f_403]) ).
tff(c_2,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_404]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI585_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/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.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 4 00:03:07 EDT 2023
% 0.13/0.35 % CPUTime :
% 1.95/1.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.95/1.52
% 1.95/1.52 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.26/1.55
% 2.26/1.55 Inference rules
% 2.26/1.55 ----------------------
% 2.26/1.55 #Ref : 0
% 2.26/1.55 #Sup : 0
% 2.26/1.55 #Fact : 0
% 2.26/1.55 #Define : 0
% 2.26/1.55 #Split : 0
% 2.26/1.55 #Chain : 0
% 2.26/1.55 #Close : 0
% 2.26/1.55
% 2.26/1.55 Ordering : LPO
% 2.26/1.55
% 2.26/1.55 Simplification rules
% 2.26/1.55 ----------------------
% 2.26/1.55 #Subsume : 0
% 2.26/1.55 #Demod : 0
% 2.26/1.55 #Tautology : 0
% 2.26/1.55 #SimpNegUnit : 0
% 2.26/1.55 #BackRed : 0
% 2.26/1.55
% 2.26/1.55 #Partial instantiations: 0
% 2.26/1.55 #Strategies tried : 1
% 2.26/1.55
% 2.26/1.55 Timing (in seconds)
% 2.26/1.55 ----------------------
% 2.26/1.56 Preprocessing : 0.45
% 2.26/1.56 Parsing : 0.25
% 2.26/1.56 CNF conversion : 0.02
% 2.26/1.56 Main loop : 0.03
% 2.26/1.56 Inferencing : 0.00
% 2.26/1.56 Reduction : 0.00
% 2.26/1.56 Demodulation : 0.00
% 2.26/1.56 BG Simplification : 0.00
% 2.26/1.56 Subsumption : 0.02
% 2.26/1.56 Abstraction : 0.00
% 2.26/1.56 MUC search : 0.00
% 2.26/1.56 Cooper : 0.05
% 2.26/1.56 Total : 0.53
% 2.26/1.56 Index Insertion : 0.00
% 2.26/1.56 Index Deletion : 0.00
% 2.26/1.56 Index Matching : 0.00
% 2.26/1.56 BG Taut test : 0.00
%------------------------------------------------------------------------------