TSTP Solution File: ARI581_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI581_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 : n027.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 2.19s 1.42s
% Output : CNFRefutation 2.19s
% 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 : 12 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 12 ( 5 ~; 2 |; 3 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 31 ( 9 atm; 3 fun; 9 num; 10 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 : 10 (; 7 !; 3 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_35,negated_conjecture,
~ ! [Xa: $int] :
( $less(5,Xa)
=> ? [Ya: $int] :
( $less(Ya,3)
& $less(7,$sum(Xa,Ya)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mix_quant_ineq_sys_solvable_2) ).
tff(f_250,plain,
! [Ya: $int] :
? [Xa: $int] :
( $less(5,Xa)
& ! [Ya: $int] :
( ~ $less(Ya,3)
| ~ $less(7,$sum(Xa,Ya)) ) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(f_253,plain,
! [Ya: $int,Xa: $int] :
( ! [Ya: $int] :
? [Xa: $int] :
( $less(5,Xa)
& ! [Ya: $int] :
( ~ $less(Ya,3)
| ~ $less(7,$sum(Xa,Ya)) ) )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],]) ).
tff(f_254,plain,
$false,
inference(equivalence,[status(thm)],[f_250,f_253]) ).
tff(c_2,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_254]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ARI581_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/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.17/0.34 % Computer : n027.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Fri Aug 4 00:33:39 EDT 2023
% 0.17/0.34 % CPUTime :
% 2.19/1.42 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.19/1.42
% 2.19/1.42 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.19/1.46
% 2.19/1.46 Inference rules
% 2.19/1.46 ----------------------
% 2.19/1.46 #Ref : 0
% 2.19/1.46 #Sup : 0
% 2.19/1.46 #Fact : 0
% 2.19/1.46 #Define : 0
% 2.19/1.46 #Split : 0
% 2.19/1.46 #Chain : 0
% 2.19/1.46 #Close : 0
% 2.19/1.46
% 2.19/1.46 Ordering : LPO
% 2.19/1.46
% 2.19/1.46 Simplification rules
% 2.19/1.46 ----------------------
% 2.19/1.46 #Subsume : 0
% 2.19/1.46 #Demod : 0
% 2.19/1.46 #Tautology : 0
% 2.19/1.46 #SimpNegUnit : 0
% 2.19/1.46 #BackRed : 0
% 2.19/1.46
% 2.19/1.46 #Partial instantiations: 0
% 2.19/1.46 #Strategies tried : 1
% 2.19/1.46
% 2.19/1.46 Timing (in seconds)
% 2.19/1.46 ----------------------
% 2.19/1.46 Preprocessing : 0.40
% 2.19/1.46 Parsing : 0.22
% 2.19/1.46 CNF conversion : 0.01
% 2.19/1.46 Main loop : 0.02
% 2.19/1.46 Inferencing : 0.00
% 2.19/1.46 Reduction : 0.00
% 2.19/1.46 Demodulation : 0.00
% 2.19/1.46 BG Simplification : 0.00
% 2.19/1.46 Subsumption : 0.02
% 2.19/1.46 Abstraction : 0.00
% 2.19/1.46 MUC search : 0.00
% 2.19/1.46 Cooper : 0.04
% 2.19/1.46 Total : 0.47
% 2.19/1.46 Index Insertion : 0.00
% 2.19/1.46 Index Deletion : 0.00
% 2.19/1.46 Index Matching : 0.00
% 2.19/1.46 BG Taut test : 0.00
%------------------------------------------------------------------------------