TSTP Solution File: ARI390_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI390_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/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 : n012.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:42 EDT 2023
% Result : Theorem 2.08s 1.61s
% Output : CNFRefutation 2.08s
% 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 : 4 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number arithmetic : 9 ( 3 atm; 0 fun; 0 num; 6 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 : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 6 (; 4 !; 2 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_30,negated_conjecture,
~ ? [Xa: $real,Ya: $real] : $greatereq(Xa,Ya),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',real_greatereq_problem_6) ).
tff(c_1,plain,
! [X_1a: $real,Y_2a: $real] : ~ $greatereq(X_1a,Y_2a),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_2,plain,
! [Y_2a: $real,X_1a: $real] : ~ $lesseq(Y_2a,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.13 % Problem : ARI390_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.14 % 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.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 4 00:06:37 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.08/1.61 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.08/1.61
% 2.08/1.61 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.08/1.64
% 2.08/1.64 Inference rules
% 2.08/1.64 ----------------------
% 2.08/1.64 #Ref : 0
% 2.08/1.64 #Sup : 0
% 2.08/1.64 #Fact : 0
% 2.08/1.64 #Define : 0
% 2.08/1.64 #Split : 0
% 2.08/1.64 #Chain : 0
% 2.08/1.64 #Close : 0
% 2.08/1.64
% 2.08/1.64 Ordering : LPO
% 2.08/1.64
% 2.08/1.64 Simplification rules
% 2.08/1.64 ----------------------
% 2.08/1.64 #Subsume : 0
% 2.08/1.64 #Demod : 0
% 2.08/1.64 #Tautology : 0
% 2.08/1.64 #SimpNegUnit : 0
% 2.08/1.64 #BackRed : 0
% 2.08/1.64
% 2.08/1.64 #Partial instantiations: 0
% 2.08/1.64 #Strategies tried : 1
% 2.08/1.64
% 2.08/1.64 Timing (in seconds)
% 2.08/1.64 ----------------------
% 2.08/1.65 Preprocessing : 0.47
% 2.08/1.65 Parsing : 0.22
% 2.08/1.65 CNF conversion : 0.02
% 2.08/1.65 Main loop : 0.03
% 2.08/1.65 Inferencing : 0.00
% 2.08/1.65 Reduction : 0.01
% 2.08/1.65 Demodulation : 0.00
% 2.08/1.65 BG Simplification : 0.01
% 2.08/1.65 Subsumption : 0.00
% 2.08/1.65 Abstraction : 0.00
% 2.08/1.65 MUC search : 0.00
% 2.08/1.65 Cooper : 0.00
% 2.08/1.65 Total : 0.55
% 2.08/1.65 Index Insertion : 0.00
% 2.08/1.65 Index Deletion : 0.00
% 2.08/1.65 Index Matching : 0.00
% 2.08/1.65 BG Taut test : 0.00
%------------------------------------------------------------------------------