TSTP Solution File: ARI398_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI398_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 : n004.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:43 EDT 2023
% Result : Theorem 2.33s 1.58s
% Output : CNFRefutation 2.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 4 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 4 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 12 ( 3 atm; 3 fun; 3 num; 3 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 : 2 ( 0 usr; 1 con; 0-1 aty)
% Number of variables : 3 (; 2 !; 1 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_30,negated_conjecture,
~ ? [Xa: $real] : $greatereq(Xa,$uminus(13/4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',real_greatereq_problem_14) ).
tff(c_1,plain,
! [X_1a: $real] : ~ $greatereq(X_1a,$uminus(13/4)),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_2,plain,
! [X_1a: $real] : ~ $lesseq($uminus(13/4),X_1a),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_1]) ).
tff(c_3,plain,
$false,
inference(quantifierElimination,[status(thm),theory('LFA')],[c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ARI398_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.13 % 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.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Aug 4 00:04:56 EDT 2023
% 0.12/0.34 % CPUTime :
% 2.33/1.58 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.52/1.59
% 2.52/1.59 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.52/1.63
% 2.52/1.63 Inference rules
% 2.52/1.63 ----------------------
% 2.52/1.63 #Ref : 0
% 2.52/1.63 #Sup : 0
% 2.52/1.63 #Fact : 0
% 2.52/1.63 #Define : 0
% 2.52/1.63 #Split : 0
% 2.52/1.63 #Chain : 0
% 2.52/1.63 #Close : 0
% 2.52/1.63
% 2.52/1.63 Ordering : LPO
% 2.52/1.63
% 2.52/1.63 Simplification rules
% 2.52/1.63 ----------------------
% 2.52/1.63 #Subsume : 0
% 2.52/1.63 #Demod : 0
% 2.52/1.63 #Tautology : 0
% 2.52/1.63 #SimpNegUnit : 0
% 2.52/1.63 #BackRed : 0
% 2.52/1.63
% 2.52/1.63 #Partial instantiations: 0
% 2.52/1.63 #Strategies tried : 1
% 2.52/1.63
% 2.52/1.63 Timing (in seconds)
% 2.52/1.63 ----------------------
% 2.52/1.63 Preprocessing : 0.51
% 2.52/1.63 Parsing : 0.24
% 2.52/1.63 CNF conversion : 0.02
% 2.52/1.63 Main loop : 0.05
% 2.52/1.63 Inferencing : 0.00
% 2.52/1.63 Reduction : 0.01
% 2.52/1.63 Demodulation : 0.01
% 2.52/1.63 BG Simplification : 0.01
% 2.52/1.63 Subsumption : 0.00
% 2.52/1.63 Abstraction : 0.00
% 2.52/1.63 MUC search : 0.00
% 2.52/1.63 Cooper : 0.00
% 2.52/1.63 Total : 0.62
% 2.52/1.63 Index Insertion : 0.00
% 2.52/1.63 Index Deletion : 0.00
% 2.52/1.63 Index Matching : 0.00
% 2.52/1.63 BG Taut test : 0.00
%------------------------------------------------------------------------------