TSTP Solution File: NUM889_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM889_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 : n016.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:53:01 EDT 2023
% Result : Theorem 2.11s 1.46s
% Output : CNFRefutation 2.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 5 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 6 ( 3 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 4 ( 3 ~; 0 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number arithmetic : 10 ( 0 atm; 6 fun; 0 num; 4 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 : 1 ( 0 usr; 0 con; 1-1 aty)
% Number of variables : 4 (; 2 !; 2 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_30,negated_conjecture,
~ ! [Xa: $int] : ( $uminus($uminus(Xa)) = Xa ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',uminus_uminus) ).
tff(f_70,plain,
? [Xa: $int] : ( $uminus($uminus(Xa)) != Xa ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(f_73,plain,
! [Xa: $int] :
( ? [Xa: $int] : ( $uminus($uminus(Xa)) != Xa )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],]) ).
tff(f_74,plain,
$false,
inference(equivalence,[status(thm)],[f_70,f_73]) ).
tff(c_2,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_74]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM889_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 : n016.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 : Thu Aug 3 14:56:07 EDT 2023
% 0.13/0.36 % CPUTime :
% 2.11/1.46 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.11/1.46
% 2.11/1.46 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.11/1.49
% 2.11/1.49 Inference rules
% 2.11/1.49 ----------------------
% 2.11/1.49 #Ref : 0
% 2.11/1.49 #Sup : 0
% 2.11/1.49 #Fact : 0
% 2.11/1.49 #Define : 0
% 2.11/1.49 #Split : 0
% 2.11/1.49 #Chain : 0
% 2.11/1.49 #Close : 0
% 2.11/1.49
% 2.11/1.49 Ordering : LPO
% 2.11/1.49
% 2.11/1.49 Simplification rules
% 2.11/1.49 ----------------------
% 2.11/1.49 #Subsume : 0
% 2.11/1.49 #Demod : 0
% 2.11/1.49 #Tautology : 0
% 2.11/1.49 #SimpNegUnit : 0
% 2.11/1.49 #BackRed : 0
% 2.11/1.49
% 2.11/1.49 #Partial instantiations: 0
% 2.11/1.49 #Strategies tried : 1
% 2.11/1.49
% 2.11/1.49 Timing (in seconds)
% 2.11/1.49 ----------------------
% 2.11/1.50 Preprocessing : 0.42
% 2.11/1.50 Parsing : 0.25
% 2.11/1.50 CNF conversion : 0.01
% 2.11/1.50 Main loop : 0.02
% 2.11/1.50 Inferencing : 0.00
% 2.11/1.50 Reduction : 0.00
% 2.11/1.50 Demodulation : 0.00
% 2.11/1.50 BG Simplification : 0.00
% 2.11/1.50 Subsumption : 0.02
% 2.11/1.50 Abstraction : 0.00
% 2.11/1.50 MUC search : 0.00
% 2.11/1.50 Cooper : 0.02
% 2.11/1.50 Total : 0.49
% 2.11/1.50 Index Insertion : 0.00
% 2.11/1.50 Index Deletion : 0.00
% 2.11/1.50 Index Matching : 0.00
% 2.11/1.50 BG Taut test : 0.00
%------------------------------------------------------------------------------