TSTP Solution File: ARI588_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI588_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 : n017.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.14s 1.45s
% Output : CNFRefutation 2.14s
% 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 : 13 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 14 ( 6 ~; 4 |; 2 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 2 avg)
% Number arithmetic : 48 ( 10 atm; 20 fun; 10 num; 8 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 : 4 ( 0 usr; 2 con; 0-2 aty)
% Number of variables : 8 (; 5 !; 3 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_34,negated_conjecture,
~ ? [Xa: $int] :
! [Ya: $int] :
~ ( $less(Ya,$sum(Xa,$uminus(1)))
<=> $lesseq($sum(3,$uminus(Xa)),Ya) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',exists_X_complementary_halflines) ).
tff(f_311,plain,
! [Xa: $int] :
? [Ya: $int] :
( ( ~ $less(Ya,$sum(Xa,$uminus(1)))
| $lesseq($sum(3,$uminus(Xa)),Ya) )
& ( ~ $lesseq($sum(3,$uminus(Xa)),Ya)
| $less(Ya,$sum(Xa,$uminus(1))) ) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(f_314,plain,
! [Xa: $int,Ya: $int] :
( ! [Xa: $int] :
? [Ya: $int] :
( ( ~ $less(Ya,$sum(Xa,$uminus(1)))
| $lesseq($sum(3,$uminus(Xa)),Ya) )
& ( ~ $lesseq($sum(3,$uminus(Xa)),Ya)
| $less(Ya,$sum(Xa,$uminus(1))) ) )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],]) ).
tff(f_315,plain,
$false,
inference(equivalence,[status(thm)],[f_311,f_314]) ).
tff(c_2,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_315]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI588_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.14/0.35 % Computer : n017.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 : Thu Aug 3 23:39:21 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.14/1.45 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.14/1.45
% 2.14/1.45 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.14/1.48
% 2.14/1.48 Inference rules
% 2.14/1.48 ----------------------
% 2.14/1.48 #Ref : 0
% 2.14/1.48 #Sup : 0
% 2.14/1.48 #Fact : 0
% 2.14/1.48 #Define : 0
% 2.14/1.48 #Split : 0
% 2.14/1.48 #Chain : 0
% 2.14/1.48 #Close : 0
% 2.14/1.48
% 2.14/1.48 Ordering : LPO
% 2.14/1.48
% 2.14/1.48 Simplification rules
% 2.14/1.48 ----------------------
% 2.14/1.48 #Subsume : 0
% 2.14/1.48 #Demod : 0
% 2.14/1.48 #Tautology : 0
% 2.14/1.48 #SimpNegUnit : 0
% 2.14/1.48 #BackRed : 0
% 2.14/1.48
% 2.14/1.48 #Partial instantiations: 0
% 2.14/1.48 #Strategies tried : 1
% 2.14/1.48
% 2.14/1.48 Timing (in seconds)
% 2.14/1.48 ----------------------
% 2.14/1.49 Preprocessing : 0.41
% 2.14/1.49 Parsing : 0.22
% 2.14/1.49 CNF conversion : 0.01
% 2.14/1.49 Main loop : 0.02
% 2.14/1.49 Inferencing : 0.00
% 2.14/1.49 Reduction : 0.00
% 2.14/1.49 Demodulation : 0.00
% 2.14/1.49 BG Simplification : 0.00
% 2.14/1.49 Subsumption : 0.02
% 2.14/1.49 Abstraction : 0.00
% 2.14/1.49 MUC search : 0.00
% 2.14/1.49 Cooper : 0.05
% 2.14/1.49 Total : 0.48
% 2.14/1.49 Index Insertion : 0.00
% 2.14/1.49 Index Deletion : 0.00
% 2.14/1.49 Index Matching : 0.00
% 2.14/1.49 BG Taut test : 0.00
%------------------------------------------------------------------------------