TSTP Solution File: ARI575_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI575_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 : n022.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.40s 1.52s
% Output : CNFRefutation 2.40s
% 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 : 38 ( 15 equ)
% Maximal formula atoms : 15 ( 7 avg)
% Number of connectives : 48 ( 15 ~; 12 |; 19 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 87 ( 20 atm; 20 fun; 35 num; 12 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 0 usr; 6 con; 0-2 aty)
% Number of variables : 12 (; 6 !; 6 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_42,negated_conjecture,
~ ! [Xa: $int,Ya: $int,Za: $int] :
( ( $less(3,Xa)
& $less(Xa,Ya)
& $less(Ya,Za)
& $less($sum($sum(Xa,$product(2,Ya)),$product(3,Za)),35) )
<=> ( ( Xa = 4 )
& ( Ya = 5 )
& ( Za = 6 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ineq_sys_has_1_int_sol) ).
tff(f_1028,plain,
? [Xa: $int,Ya: $int,Za: $int] :
( ( $less(3,Xa)
& $less(Xa,Ya)
& $less(Ya,Za)
& $less($sum($sum($product(2,Ya),Xa),$product(3,Za)),35)
& ( ( Xa != 4 )
| ( Ya != 5 )
| ( Za != 6 ) ) )
| ( ( Xa = 4 )
& ( Ya = 5 )
& ( Za = 6 )
& ( ~ $less(3,Xa)
| ~ $less(Xa,Ya)
| ~ $less(Ya,Za)
| ~ $less($sum($sum($product(2,Ya),Xa),$product(3,Za)),35) ) ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(f_1031,plain,
! [Xa: $int,Ya: $int,Za: $int] :
( ? [Xa: $int,Ya: $int,Za: $int] :
( ( $less(3,Xa)
& $less(Xa,Ya)
& $less(Ya,Za)
& $less($sum($sum($product(2,Ya),Xa),$product(3,Za)),35)
& ( ( Xa != 4 )
| ( Ya != 5 )
| ( Za != 6 ) ) )
| ( ( Xa = 4 )
& ( Ya = 5 )
& ( Za = 6 )
& ( ~ $less(3,Xa)
| ~ $less(Xa,Ya)
| ~ $less(Ya,Za)
| ~ $less($sum($sum($product(2,Ya),Xa),$product(3,Za)),35) ) ) )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],]) ).
tff(f_1032,plain,
$false,
inference(equivalence,[status(thm)],[f_1028,f_1031]) ).
tff(c_2,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_1032]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ARI575_1 : TPTP v8.1.2. Released v5.1.0.
% 0.13/0.13 % 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.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri Aug 4 00:11:03 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.40/1.52 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.40/1.52
% 2.40/1.52 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.40/1.55
% 2.40/1.55 Inference rules
% 2.40/1.55 ----------------------
% 2.40/1.55 #Ref : 0
% 2.40/1.55 #Sup : 0
% 2.40/1.55 #Fact : 0
% 2.40/1.55 #Define : 0
% 2.40/1.55 #Split : 0
% 2.40/1.55 #Chain : 0
% 2.40/1.55 #Close : 0
% 2.40/1.55
% 2.40/1.55 Ordering : LPO
% 2.40/1.55
% 2.40/1.55 Simplification rules
% 2.40/1.55 ----------------------
% 2.40/1.55 #Subsume : 0
% 2.40/1.55 #Demod : 0
% 2.40/1.55 #Tautology : 0
% 2.40/1.55 #SimpNegUnit : 0
% 2.40/1.55 #BackRed : 0
% 2.40/1.55
% 2.40/1.55 #Partial instantiations: 0
% 2.40/1.55 #Strategies tried : 1
% 2.40/1.55
% 2.40/1.55 Timing (in seconds)
% 2.40/1.55 ----------------------
% 2.40/1.56 Preprocessing : 0.47
% 2.40/1.56 Parsing : 0.25
% 2.40/1.56 CNF conversion : 0.02
% 2.40/1.56 Main loop : 0.02
% 2.40/1.56 Inferencing : 0.00
% 2.40/1.56 Reduction : 0.00
% 2.40/1.56 Demodulation : 0.00
% 2.40/1.56 BG Simplification : 0.00
% 2.40/1.56 Subsumption : 0.02
% 2.40/1.56 Abstraction : 0.00
% 2.40/1.56 MUC search : 0.00
% 2.40/1.56 Cooper : 0.06
% 2.40/1.56 Total : 0.55
% 2.40/1.56 Index Insertion : 0.00
% 2.40/1.56 Index Deletion : 0.00
% 2.40/1.56 Index Matching : 0.00
% 2.40/1.56 BG Taut test : 0.00
%------------------------------------------------------------------------------