TSTP Solution File: ARI544_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI544_1 : TPTP v8.1.2. Released v5.0.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 : n011.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:33:58 EDT 2023
% Result : Theorem 2.04s 1.56s
% Output : CNFRefutation 2.04s
% 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 : 9 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 7 ( 3 ~; 0 |; 2 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 19 ( 3 atm; 3 fun; 9 num; 4 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; 3 con; 0-2 aty)
% Number of variables : 4 (; 2 !; 2 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_32,negated_conjecture,
~ ! [Xa: $int] :
( ( $sum(2,3) = Xa )
=> $less(Xa,7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_combined_problem_8) ).
tff(f_112,plain,
? [Xa: $int] :
( ( $sum(2,3) = Xa )
& ~ $less(Xa,7) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(f_115,plain,
! [Xa: $int] :
( ? [Xa: $int] :
( ( $sum(2,3) = Xa )
& ~ $less(Xa,7) )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],]) ).
tff(f_116,plain,
$false,
inference(equivalence,[status(thm)],[f_112,f_115]) ).
tff(c_2,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_116]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : ARI544_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.15 % 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.15/0.36 % Computer : n011.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri Aug 4 00:09:36 EDT 2023
% 0.15/0.37 % CPUTime :
% 2.04/1.56 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.04/1.56
% 2.04/1.56 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.04/1.60
% 2.04/1.60 Inference rules
% 2.04/1.60 ----------------------
% 2.04/1.60 #Ref : 0
% 2.04/1.60 #Sup : 0
% 2.04/1.60 #Fact : 0
% 2.04/1.60 #Define : 0
% 2.04/1.60 #Split : 0
% 2.04/1.60 #Chain : 0
% 2.04/1.60 #Close : 0
% 2.04/1.60
% 2.04/1.60 Ordering : LPO
% 2.04/1.60
% 2.04/1.60 Simplification rules
% 2.04/1.60 ----------------------
% 2.04/1.60 #Subsume : 0
% 2.04/1.60 #Demod : 0
% 2.04/1.60 #Tautology : 0
% 2.04/1.60 #SimpNegUnit : 0
% 2.04/1.60 #BackRed : 0
% 2.04/1.60
% 2.04/1.60 #Partial instantiations: 0
% 2.04/1.60 #Strategies tried : 1
% 2.04/1.60
% 2.04/1.60 Timing (in seconds)
% 2.04/1.60 ----------------------
% 2.04/1.60 Preprocessing : 0.43
% 2.04/1.60 Parsing : 0.24
% 2.04/1.60 CNF conversion : 0.01
% 2.04/1.60 Main loop : 0.03
% 2.04/1.60 Inferencing : 0.00
% 2.04/1.60 Reduction : 0.00
% 2.04/1.60 Demodulation : 0.00
% 2.04/1.60 BG Simplification : 0.00
% 2.04/1.60 Subsumption : 0.02
% 2.04/1.60 Abstraction : 0.00
% 2.04/1.60 MUC search : 0.00
% 2.04/1.60 Cooper : 0.03
% 2.04/1.60 Total : 0.51
% 2.04/1.60 Index Insertion : 0.00
% 2.04/1.60 Index Deletion : 0.00
% 2.04/1.60 Index Matching : 0.00
% 2.04/1.60 BG Taut test : 0.00
%------------------------------------------------------------------------------