TSTP Solution File: NUM905_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM905_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 : n027.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:02 EDT 2023
% Result : Theorem 2.60s 1.87s
% Output : CNFRefutation 2.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 10 unt; 2 typ; 0 def)
% Number of atoms : 24 ( 21 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 10 ~; 6 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 26 ( 0 atm; 10 fun; 15 num; 1 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 : 4 ( 2 usr; 3 con; 0-1 aty)
% Number of variables : 1 (; 1 !; 0 ?; 1 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
tff('#skF_2',type,
'#skF_2': $rat ).
tff('#skF_1',type,
'#skF_1': $rat ).
%Foreground operators:
tff(f_32,negated_conjecture,
~ ! [Xa: $rat] :
( ( Xa = $uminus(Xa) )
<=> ( Xa = 0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rat_uminus_problem_9) ).
tff(c_4,plain,
( ( $uminus('#skF_2') = '#skF_2' )
| ( '#skF_1' = 0 ) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_6,plain,
'#skF_1' = 0,
inference(splitLeft,[status(thm)],[c_4]) ).
tff(c_3,plain,
( ( $uminus('#skF_2') = '#skF_2' )
| ( $uminus('#skF_1') != '#skF_1' ) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_7,plain,
( ( $uminus('#skF_2') = '#skF_2' )
| ( $uminus(0) != 0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_6,c_3]) ).
tff(c_8,plain,
$uminus('#skF_2') = '#skF_2',
inference(backgroundSimplification,[status(thm),theory('LRA')],[c_7]) ).
tff(c_2,plain,
( ( '#skF_2' != 0 )
| ( '#skF_1' = 0 ) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_5,plain,
'#skF_2' != 0,
inference(splitLeft,[status(thm)],[c_2]) ).
tff(c_9,plain,
$false,
inference(close,[status(thm),theory('LRA')],[c_8,c_5]) ).
tff(c_10,plain,
$uminus('#skF_2') = '#skF_2',
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_12,plain,
$false,
inference(close,[status(thm),theory('LRA')],[c_10,c_5]) ).
tff(c_13,plain,
'#skF_1' = 0,
inference(splitRight,[status(thm)],[c_2]) ).
tff(c_1,plain,
( ( '#skF_2' != 0 )
| ( $uminus('#skF_1') != '#skF_1' ) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_15,plain,
( ( '#skF_2' != 0 )
| ( $uminus(0) != 0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_13,c_13,c_1]) ).
tff(c_16,plain,
'#skF_2' != 0,
inference(backgroundSimplification,[status(thm),theory('LRA')],[c_15]) ).
tff(c_14,plain,
'#skF_2' = 0,
inference(splitRight,[status(thm)],[c_2]) ).
tff(c_17,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_16,c_14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM905_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.13/0.35 % Computer : n027.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 15:24:08 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.60/1.87 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.60/1.87
% 2.60/1.87 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.73/1.89
% 2.73/1.89 Inference rules
% 2.73/1.89 ----------------------
% 2.73/1.89 #Ref : 0
% 2.73/1.89 #Sup : 0
% 2.73/1.89 #Fact : 0
% 2.73/1.89 #Define : 0
% 2.73/1.89 #Split : 2
% 2.73/1.89 #Chain : 0
% 2.73/1.89 #Close : 2
% 2.73/1.89
% 2.73/1.89 Ordering : LPO
% 2.73/1.89
% 2.73/1.89 Simplification rules
% 2.73/1.89 ----------------------
% 2.73/1.89 #Subsume : 1
% 2.73/1.89 #Demod : 4
% 2.73/1.89 #Tautology : 0
% 2.73/1.89 #SimpNegUnit : 1
% 2.73/1.89 #BackRed : 0
% 2.73/1.89
% 2.73/1.89 #Partial instantiations: 0
% 2.73/1.89 #Strategies tried : 1
% 2.73/1.89
% 2.73/1.89 Timing (in seconds)
% 2.73/1.89 ----------------------
% 2.73/1.90 Preprocessing : 0.40
% 2.73/1.90 Parsing : 0.24
% 2.73/1.90 CNF conversion : 0.02
% 2.73/1.90 Main loop : 0.37
% 2.73/1.90 Inferencing : 0.00
% 2.73/1.90 Reduction : 0.02
% 2.73/1.90 Demodulation : 0.02
% 2.73/1.90 BG Simplification : 0.01
% 2.73/1.90 Subsumption : 0.03
% 2.73/1.90 Abstraction : 0.00
% 2.73/1.90 MUC search : 0.01
% 2.73/1.90 Cooper : 0.00
% 2.73/1.90 Total : 0.82
% 2.73/1.90 Index Insertion : 0.00
% 2.73/1.90 Index Deletion : 0.00
% 2.73/1.90 Index Matching : 0.00
% 2.73/1.90 BG Taut test : 0.00
%------------------------------------------------------------------------------