TSTP Solution File: ARI573_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI573_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 : n023.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:01 EDT 2023
% Result : Theorem 2.70s 1.61s
% Output : CNFRefutation 2.98s
% 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 : 13 ( 3 ~; 0 |; 8 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 3 ( 2 avg)
% Number arithmetic : 78 ( 12 atm; 33 fun; 21 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 : 5 ( 0 usr; 2 con; 0-2 aty)
% Number of variables : 12 (; 6 !; 6 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_36,negated_conjecture,
~ ! [Xa: $int,Ya: $int,Za: $int] :
( ( $lesseq(1,$sum($product(Xa,2),$uminus(Ya)))
& $lesseq(1,$sum($product(Ya,2),$uminus(Za)))
& $lesseq(1,$sum($product(Za,2),$uminus(Xa))) )
=> $lesseq(2,$sum($sum(Xa,Ya),Za)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',impl_3_ineq) ).
tff(f_21404,plain,
? [Xa: $int,Ya: $int,Za: $int] :
( $lesseq(1,$sum($product(2,Xa),$uminus(Ya)))
& $lesseq(1,$sum($product(2,Ya),$uminus(Za)))
& $lesseq(1,$sum($product(2,Za),$uminus(Xa)))
& ~ $lesseq(2,$sum($sum(Ya,Xa),Za)) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(f_21407,plain,
! [Xa: $int,Ya: $int,Za: $int] :
( ? [Xa: $int,Ya: $int,Za: $int] :
( $lesseq(1,$sum($product(2,Xa),$uminus(Ya)))
& $lesseq(1,$sum($product(2,Ya),$uminus(Za)))
& $lesseq(1,$sum($product(2,Za),$uminus(Xa)))
& ~ $lesseq(2,$sum($sum(Ya,Xa),Za)) )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],]) ).
tff(f_21408,plain,
$false,
inference(equivalence,[status(thm)],[f_21404,f_21407]) ).
tff(c_2,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_21408]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ARI573_1 : TPTP v8.1.2. Released v5.1.0.
% 0.07/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 : n023.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:27:07 EDT 2023
% 0.21/0.35 % CPUTime :
% 2.70/1.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.87/1.61
% 2.87/1.61 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.98/1.65
% 2.98/1.65 Inference rules
% 2.98/1.65 ----------------------
% 2.98/1.65 #Ref : 0
% 2.98/1.65 #Sup : 0
% 2.98/1.65 #Fact : 0
% 2.98/1.65 #Define : 0
% 2.98/1.65 #Split : 0
% 2.98/1.65 #Chain : 0
% 2.98/1.65 #Close : 0
% 2.98/1.65
% 2.98/1.65 Ordering : LPO
% 2.98/1.65
% 2.98/1.65 Simplification rules
% 2.98/1.65 ----------------------
% 2.98/1.65 #Subsume : 0
% 2.98/1.65 #Demod : 0
% 2.98/1.65 #Tautology : 0
% 2.98/1.65 #SimpNegUnit : 0
% 2.98/1.65 #BackRed : 0
% 2.98/1.65
% 2.98/1.65 #Partial instantiations: 0
% 2.98/1.65 #Strategies tried : 1
% 2.98/1.65
% 2.98/1.65 Timing (in seconds)
% 2.98/1.65 ----------------------
% 2.98/1.65 Preprocessing : 0.54
% 2.98/1.65 Parsing : 0.25
% 2.98/1.65 CNF conversion : 0.02
% 2.98/1.65 Main loop : 0.03
% 2.98/1.65 Inferencing : 0.00
% 2.98/1.65 Reduction : 0.00
% 2.98/1.65 Demodulation : 0.00
% 2.98/1.65 BG Simplification : 0.00
% 2.98/1.65 Subsumption : 0.02
% 2.98/1.65 Abstraction : 0.00
% 2.98/1.65 MUC search : 0.00
% 2.98/1.65 Cooper : 0.12
% 2.98/1.65 Total : 0.62
% 2.98/1.65 Index Insertion : 0.00
% 2.98/1.65 Index Deletion : 0.00
% 2.98/1.66 Index Matching : 0.00
% 2.98/1.66 BG Taut test : 0.00
%------------------------------------------------------------------------------