TSTP Solution File: ARI629_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI629_1 : TPTP v8.1.2. Released v6.3.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:34:09 EDT 2023
% Result : Theorem 26.85s 10.93s
% Output : CNFRefutation 26.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 123 ( 85 unt; 4 typ; 0 def)
% Number of atoms : 166 ( 82 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 124 ( 77 ~; 40 |; 1 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 347 ( 67 atm; 145 fun; 96 num; 39 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 4 usr; 7 con; 0-2 aty)
% Number of variables : 39 (; 39 !; 0 ?; 39 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
tff('#skE_1',type,
'#skE_1': $real ).
tff(x,type,
x: $real ).
tff('#skE_2',type,
'#skE_2': $real ).
tff(y,type,
y: $real ).
%Foreground operators:
tff(f_81,axiom,
! [A: $real,B: $real] : ( $product(A,B) = $product(B,A) ),
file('/export/starexec/sandbox/solver/bin/lemmas/mult_lemmas_real.p',mult_comm) ).
tff(f_83,axiom,
! [A: $real,B: $real,C: $real] : ( $product(A,$sum(B,C)) = $sum($product(A,B),$product(A,C)) ),
file('/export/starexec/sandbox/solver/bin/lemmas/mult_lemmas_real.p',mult_dist) ).
tff(f_31,negated_conjecture,
~ $greatereq($product($sum(1,$product(y,y)),x),$sum(1,$product(y,y))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conclusion) ).
tff(f_69,axiom,
! [X: $real,Y: $real,Z: $real] :
( ( Y != 0 )
=> ( ( Z = $quotient(X,Y) )
<=> ( X = $product(Y,Z) ) ) ),
file('/export/starexec/sandbox/solver/bin/lemmas/mult_lemmas_real.p',nonzero_eq_divide_eq) ).
tff(f_89,axiom,
! [A: $real,B: $real] : ( $uminus($product(A,B)) = $product($uminus(A),B) ),
file('/export/starexec/sandbox/solver/bin/lemmas/mult_lemmas_real.p',minus_mult_left) ).
tff(f_163,axiom,
! [A: $real,B: $real] :
( $less(0,A)
=> ( $less(1,$quotient(B,A))
<=> $less(A,B) ) ),
file('/export/starexec/sandbox/solver/bin/lemmas/mult_lemmas_real.p',less_divide_eq_1_pos) ).
tff(f_29,hypothesis,
$greater(x,1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',hypothesis) ).
tff(f_106,axiom,
! [A: $real,B: $real] :
( ( $less(0,A)
& $less(0,B) )
=> $less(0,$product(A,B)) ),
file('/export/starexec/sandbox/solver/bin/lemmas/mult_lemmas_real.p',mult_nonneg_nonneg) ).
tff(f_97,axiom,
! [C: $real,B: $real] :
( ( $product(C,B) = C )
<=> ( ( C = 0 )
| ( B = 1 ) ) ),
file('/export/starexec/sandbox/solver/bin/lemmas/mult_lemmas_real.p',mult_cancel_right1) ).
tff(c_26,plain,
! [B_22: $real,A_23: $real] : ( $product(B_22,A_23) = $product(A_23,B_22) ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_92,plain,
! [A_27: $real,B_28: $real,C_29: $real] : ( $product(A_27,$sum(B_28,C_29)) = $sum($product(A_27,B_28),$product(A_27,C_29)) ),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_4,plain,
~ $greatereq($product($sum(1,$product(y,y)),x),$sum(1,$product(y,y))),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_81,plain,
~ $lesseq($sum(1,$product(y,y)),$product($sum(1,$product(y,y)),x)),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_4]) ).
tff(c_107,plain,
~ $lesseq($sum(1,$product(y,y)),$sum($product(1,x),$product(x,$product(y,y)))),
inference(demodulation,[status(thm),theory(equality)],[c_26,c_92,c_26,c_81]) ).
tff(c_109,plain,
~ $lesseq($sum(1,$product(y,y)),$sum(x,$product(x,$product(y,y)))),
inference(backgroundSimplification,[status(thm),theory('LFA')],[c_107]) ).
tff(c_125,plain,
$product(y,y) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_109]) ).
tff(c_13,plain,
! [Y_10: $real,Z_11: $real] :
( ( $quotient($product(Y_10,Z_11),Y_10) = Z_11 )
| ( Y_10 = 0 ) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_214,plain,
( ( $quotient('#skE_1',y) = y )
| ( y = 0 ) ),
inference(superposition,[status(thm),theory(equality)],[c_125,c_13]) ).
tff(c_32319,plain,
y = 0,
inference(splitLeft,[status(thm)],[c_214]) ).
tff(c_117,plain,
$product(y,y) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_109]) ).
tff(c_86,plain,
! [A_32: $real,B_33: $real,X_110: $real] :
( ( $uminus($product(A_32,B_33)) = $product(X_110,B_33) )
| ( X_110 != $uminus(A_32) ) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_31747,plain,
! [A_14385: $real] :
( ( $uminus($product(A_14385,y)) = '#skE_1' )
| ( y != $uminus(A_14385) ) ),
inference(superposition,[status(thm),theory(equality)],[c_86,c_125]) ).
tff(c_31790,plain,
( ( $uminus('#skE_1') = '#skE_1' )
| ( $uminus(y) != y ) ),
inference(superposition,[status(thm),theory(equality)],[c_117,c_31747]) ).
tff(c_31791,plain,
( ( $uminus('#skE_1') = '#skE_1' )
| ( $uminus(y) != y ) ),
inference(backgroundSimplification,[status(thm),theory('LFA')],[c_31790]) ).
tff(c_31804,plain,
$uminus(y) != y,
inference(splitLeft,[status(thm)],[c_31791]) ).
tff(c_32324,plain,
$uminus(0) != 0,
inference(demodulation,[status(thm),theory(equality)],[c_32319,c_32319,c_31804]) ).
tff(c_32333,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LFA')],[c_32324]) ).
tff(c_32335,plain,
y != 0,
inference(splitRight,[status(thm)],[c_214]) ).
tff(c_111,plain,
$product(y,y) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_109]) ).
tff(c_110,plain,
~ $lesseq($sum(1,$product(y,y)),$sum(x,$product(x,$product(y,y)))),
inference(backgroundSimplification,[status(thm),theory('LFA')],[c_107]) ).
tff(c_114,plain,
~ $lesseq($sum(1,'#skE_1'),$sum(x,$product(x,'#skE_1'))),
inference(demodulation,[status(thm),theory(equality)],[c_111,c_111,c_110]) ).
tff(c_122,plain,
~ $lesseq($sum(1,'#skE_1'),$sum(x,$product('#skE_1',x))),
inference(demodulation,[status(thm),theory(equality)],[c_26,c_114]) ).
tff(c_31805,plain,
$product('#skE_1',x) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_122]) ).
tff(c_31904,plain,
( ( $quotient('#skE_2','#skE_1') = x )
| ( '#skE_1' = 0 ) ),
inference(superposition,[status(thm),theory(equality)],[c_31805,c_13]) ).
tff(c_32440,plain,
'#skE_1' = 0,
inference(splitLeft,[status(thm)],[c_31904]) ).
tff(c_32337,plain,
$quotient('#skE_1',y) = y,
inference(splitRight,[status(thm)],[c_214]) ).
tff(c_32443,plain,
$quotient(0,y) = y,
inference(demodulation,[status(thm),theory(equality)],[c_32440,c_32337]) ).
tff(c_32444,plain,
y = 0,
inference(backgroundSimplification,[status(thm),theory('LFA')],[c_32443]) ).
tff(c_32475,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_32335,c_32444]) ).
tff(c_32482,plain,
$quotient('#skE_2','#skE_1') = x,
inference(splitRight,[status(thm)],[c_31904]) ).
tff(c_76,plain,
! [B_92: $real,A_91: $real] :
( ~ $less(1,$quotient(B_92,A_91))
| ~ $less(0,A_91)
| $less(A_91,B_92) ),
inference(cnfTransformation,[status(thm)],[f_163]) ).
tff(c_78,plain,
! [B_95: $real,A_96: $real] :
( ~ $less(1,$quotient(B_95,A_96))
| ~ $less(0,A_96)
| ~ $lesseq(B_95,A_96) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_76]) ).
tff(c_32580,plain,
( ~ $less(1,x)
| ~ $less(0,'#skE_1')
| ~ $lesseq('#skE_2','#skE_1') ),
inference(superposition,[status(thm),theory(equality)],[c_32482,c_78]) ).
tff(c_33680,plain,
~ $lesseq('#skE_2','#skE_1'),
inference(splitLeft,[status(thm)],[c_32580]) ).
tff(c_263,plain,
$product('#skE_1',x) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_122]) ).
tff(c_262,plain,
~ $lesseq($sum(1,'#skE_1'),$sum(x,$product('#skE_1',x))),
inference(demodulation,[status(thm),theory(equality)],[c_26,c_114]) ).
tff(c_265,plain,
~ $lesseq($sum(1,'#skE_1'),$sum(x,'#skE_2')),
inference(demodulation,[status(thm),theory(equality)],[c_263,c_262]) ).
tff(c_1,plain,
$greater(x,1),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_2,plain,
~ $lesseq(x,1),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_1]) ).
tff(c_33681,plain,
$false,
inference(close,[status(thm),theory('LFA')],[c_33680,c_265,c_2]) ).
tff(c_33682,plain,
( ~ $less(0,'#skE_1')
| ~ $less(1,x) ),
inference(splitRight,[status(thm)],[c_32580]) ).
tff(c_33685,plain,
~ $less(1,x),
inference(splitLeft,[status(thm)],[c_33682]) ).
tff(c_33686,plain,
$false,
inference(close,[status(thm),theory('LFA')],[c_33685,c_2]) ).
tff(c_33687,plain,
~ $less(0,'#skE_1'),
inference(splitRight,[status(thm)],[c_33682]) ).
tff(c_652,plain,
$product($uminus(y),y) = $uminus('#skE_1'),
inference(superposition,[status(thm),theory(equality)],[c_125,c_86]) ).
tff(c_5934,plain,
$product(y,$uminus(y)) = $uminus('#skE_1'),
inference(superposition,[status(thm),theory(equality)],[c_26,c_652]) ).
tff(c_6154,plain,
$product($uminus(y),$uminus(y)) = $uminus($uminus('#skE_1')),
inference(superposition,[status(thm),theory(equality)],[c_5934,c_86]) ).
tff(c_29250,plain,
$product($uminus(y),$uminus(y)) = '#skE_1',
inference(backgroundSimplification,[status(thm),theory('LFA')],[c_6154]) ).
tff(c_43,plain,
! [A_40: $real,B_41: $real] :
( $less(0,$product(A_40,B_41))
| ~ $less(0,A_40)
| ~ $less(0,B_41) ),
inference(cnfTransformation,[status(thm)],[f_106]) ).
tff(c_45,plain,
! [A_42: $real,B_43: $real] :
( ~ $lesseq($product(A_42,B_43),0)
| ~ $less(0,A_42)
| ~ $less(0,B_43) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_43]) ).
tff(c_29696,plain,
( ~ $lesseq('#skE_1',0)
| ~ $less(0,$uminus(y)) ),
inference(superposition,[status(thm),theory(equality)],[c_29250,c_45]) ).
tff(c_31231,plain,
~ $less(0,$uminus(y)),
inference(splitLeft,[status(thm)],[c_29696]) ).
tff(c_272,plain,
! [A_199: $real] :
( ( $uminus($product(A_199,y)) = '#skE_1' )
| ( y != $uminus(A_199) ) ),
inference(superposition,[status(thm),theory(equality)],[c_86,c_125]) ).
tff(c_315,plain,
( ( $uminus('#skE_1') = '#skE_1' )
| ( $uminus(y) != y ) ),
inference(superposition,[status(thm),theory(equality)],[c_117,c_272]) ).
tff(c_316,plain,
( ( $uminus('#skE_1') = '#skE_1' )
| ( $uminus(y) != y ) ),
inference(backgroundSimplification,[status(thm),theory('LFA')],[c_315]) ).
tff(c_329,plain,
$uminus(y) != y,
inference(splitLeft,[status(thm)],[c_316]) ).
tff(c_234,plain,
( ~ $lesseq('#skE_1',0)
| ~ $less(0,y) ),
inference(superposition,[status(thm),theory(equality)],[c_125,c_45]) ).
tff(c_269,plain,
~ $less(0,y),
inference(splitLeft,[status(thm)],[c_234]) ).
tff(c_31232,plain,
$false,
inference(close,[status(thm),theory('LFA')],[c_31231,c_329,c_269]) ).
tff(c_31233,plain,
~ $lesseq('#skE_1',0),
inference(splitRight,[status(thm)],[c_29696]) ).
tff(c_332,plain,
$product('#skE_1',x) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_122]) ).
tff(c_431,plain,
( ( $quotient('#skE_2','#skE_1') = x )
| ( '#skE_1' = 0 ) ),
inference(superposition,[status(thm),theory(equality)],[c_332,c_13]) ).
tff(c_1572,plain,
'#skE_1' = 0,
inference(splitLeft,[status(thm)],[c_431]) ).
tff(c_268,plain,
$product('#skE_1',x) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_122]) ).
tff(c_973,plain,
! [A_439: $real] :
( ( $uminus($product(A_439,x)) = '#skE_2' )
| ( '#skE_1' != $uminus(A_439) ) ),
inference(superposition,[status(thm),theory(equality)],[c_332,c_86]) ).
tff(c_1037,plain,
( ( $uminus('#skE_2') = '#skE_2' )
| ( $uminus('#skE_1') != '#skE_1' ) ),
inference(superposition,[status(thm),theory(equality)],[c_268,c_973]) ).
tff(c_1038,plain,
( ( $uminus('#skE_2') = '#skE_2' )
| ( $uminus('#skE_1') != '#skE_1' ) ),
inference(backgroundSimplification,[status(thm),theory('LFA')],[c_1037]) ).
tff(c_1056,plain,
$uminus('#skE_1') != '#skE_1',
inference(splitLeft,[status(thm)],[c_1038]) ).
tff(c_1592,plain,
$uminus(0) != 0,
inference(demodulation,[status(thm),theory(equality)],[c_1572,c_1572,c_1056]) ).
tff(c_1634,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LFA')],[c_1592]) ).
tff(c_1641,plain,
$quotient('#skE_2','#skE_1') = x,
inference(splitRight,[status(thm)],[c_431]) ).
tff(c_1739,plain,
( ~ $less(1,x)
| ~ $less(0,'#skE_1')
| ~ $lesseq('#skE_2','#skE_1') ),
inference(superposition,[status(thm),theory(equality)],[c_1641,c_78]) ).
tff(c_1752,plain,
~ $lesseq('#skE_2','#skE_1'),
inference(splitLeft,[status(thm)],[c_1739]) ).
tff(c_1753,plain,
$false,
inference(close,[status(thm),theory('LFA')],[c_1752,c_265,c_2]) ).
tff(c_1754,plain,
( ~ $less(0,'#skE_1')
| ~ $less(1,x) ),
inference(splitRight,[status(thm)],[c_1739]) ).
tff(c_1984,plain,
~ $less(1,x),
inference(splitLeft,[status(thm)],[c_1754]) ).
tff(c_1985,plain,
$false,
inference(close,[status(thm),theory('LFA')],[c_1984,c_2]) ).
tff(c_1986,plain,
~ $less(0,'#skE_1'),
inference(splitRight,[status(thm)],[c_1754]) ).
tff(c_451,plain,
( ~ $lesseq('#skE_2',0)
| ~ $less(0,'#skE_1')
| ~ $less(0,x) ),
inference(superposition,[status(thm),theory(equality)],[c_332,c_45]) ).
tff(c_845,plain,
~ $less(0,x),
inference(splitLeft,[status(thm)],[c_451]) ).
tff(c_846,plain,
$false,
inference(close,[status(thm),theory('LFA')],[c_845,c_2]) ).
tff(c_847,plain,
( ~ $less(0,'#skE_1')
| ~ $lesseq('#skE_2',0) ),
inference(splitRight,[status(thm)],[c_451]) ).
tff(c_850,plain,
~ $lesseq('#skE_2',0),
inference(splitLeft,[status(thm)],[c_847]) ).
tff(c_1989,plain,
$false,
inference(close,[status(thm),theory('LFA')],[c_1986,c_850,c_265,c_2]) ).
tff(c_1990,plain,
$uminus('#skE_2') = '#skE_2',
inference(splitRight,[status(thm)],[c_1038]) ).
tff(c_1992,plain,
$false,
inference(close,[status(thm),theory('LFA')],[c_1990,c_850]) ).
tff(c_1993,plain,
~ $less(0,'#skE_1'),
inference(splitRight,[status(thm)],[c_847]) ).
tff(c_31740,plain,
$false,
inference(close,[status(thm),theory('LFA')],[c_31233,c_1993]) ).
tff(c_31742,plain,
$uminus(y) = y,
inference(splitRight,[status(thm)],[c_316]) ).
tff(c_31741,plain,
$uminus('#skE_1') = '#skE_1',
inference(splitRight,[status(thm)],[c_316]) ).
tff(c_34,plain,
! [C_36: $real,B_37: $real] :
( ( $product(C_36,B_37) != C_36 )
| ( C_36 = 0 )
| ( B_37 = 1 ) ),
inference(cnfTransformation,[status(thm)],[f_97]) ).
tff(c_233,plain,
( ( '#skE_1' = 0 )
| ( y = 1 )
| ( y != '#skE_1' ) ),
inference(superposition,[status(thm),theory(equality)],[c_125,c_34]) ).
tff(c_260,plain,
y != '#skE_1',
inference(splitLeft,[status(thm)],[c_233]) ).
tff(c_31743,plain,
$false,
inference(close,[status(thm),theory('LFA')],[c_31742,c_31741,c_260]) ).
tff(c_31744,plain,
~ $lesseq('#skE_1',0),
inference(splitRight,[status(thm)],[c_234]) ).
tff(c_33690,plain,
$false,
inference(close,[status(thm),theory('LFA')],[c_33687,c_31744]) ).
tff(c_33691,plain,
$uminus('#skE_1') = '#skE_1',
inference(splitRight,[status(thm)],[c_31791]) ).
tff(c_33693,plain,
$false,
inference(close,[status(thm),theory('LFA')],[c_33691,c_31744]) ).
tff(c_33695,plain,
y = '#skE_1',
inference(splitRight,[status(thm)],[c_233]) ).
tff(c_33694,plain,
( ( y = 1 )
| ( '#skE_1' = 0 ) ),
inference(splitRight,[status(thm)],[c_233]) ).
tff(c_33702,plain,
( ( '#skE_1' = 1 )
| ( '#skE_1' = 0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_33695,c_33694]) ).
tff(c_33703,plain,
'#skE_1' = 0,
inference(splitLeft,[status(thm)],[c_33702]) ).
tff(c_33730,plain,
~ $lesseq($sum(1,0),$sum(x,$product(0,x))),
inference(demodulation,[status(thm),theory(equality)],[c_33703,c_33703,c_122]) ).
tff(c_33731,plain,
~ $lesseq(1,$sum(x,$product(0,x))),
inference(backgroundSimplification,[status(thm),theory('LFA')],[c_33730]) ).
tff(c_33732,plain,
$false,
inference(close,[status(thm),theory('LFA')],[c_33731,c_2]) ).
tff(c_33733,plain,
'#skE_1' = 1,
inference(splitRight,[status(thm)],[c_33702]) ).
tff(c_33754,plain,
~ $lesseq($sum(1,1),$sum(x,$product(1,x))),
inference(demodulation,[status(thm),theory(equality)],[c_33733,c_33733,c_122]) ).
tff(c_33755,plain,
~ $lesseq(2,$sum(x,x)),
inference(backgroundSimplification,[status(thm),theory('LFA')],[c_33754]) ).
tff(c_33756,plain,
$false,
inference(close,[status(thm),theory('LFA')],[c_33755,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ARI629_1 : TPTP v8.1.2. Released v6.3.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.14/0.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri Aug 4 00:05:41 EDT 2023
% 0.14/0.35 % CPUTime :
% 26.85/10.93 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 26.85/10.95
% 26.85/10.95 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 26.94/11.00
% 26.94/11.00 Inference rules
% 26.94/11.00 ----------------------
% 26.94/11.00 #Ref : 0
% 26.94/11.00 #Sup : 5417
% 26.94/11.00 #Fact : 0
% 26.94/11.00 #Define : 2
% 26.94/11.00 #Split : 90
% 26.94/11.00 #Chain : 0
% 26.94/11.00 #Close : 21
% 26.94/11.00
% 26.94/11.00 Ordering : LPO
% 26.94/11.00
% 26.94/11.00 Simplification rules
% 26.94/11.00 ----------------------
% 26.94/11.00 #Subsume : 1264
% 26.94/11.00 #Demod : 2718
% 26.94/11.00 #Tautology : 593
% 26.94/11.00 #SimpNegUnit : 670
% 26.94/11.00 #BackRed : 142
% 26.94/11.00
% 26.94/11.00 #Partial instantiations: 0
% 26.94/11.00 #Strategies tried : 1
% 26.94/11.00
% 26.94/11.00 Timing (in seconds)
% 26.94/11.00 ----------------------
% 26.94/11.00 Preprocessing : 0.69
% 26.94/11.00 Parsing : 0.32
% 26.94/11.00 CNF conversion : 0.03
% 26.94/11.00 Main loop : 9.22
% 26.94/11.00 Inferencing : 0.76
% 26.94/11.00 Reduction : 1.57
% 26.94/11.00 Demodulation : 1.17
% 26.94/11.00 BG Simplification : 0.36
% 26.94/11.00 Subsumption : 0.85
% 26.94/11.00 Abstraction : 0.25
% 26.94/11.00 MUC search : 3.59
% 26.94/11.00 Cooper : 0.00
% 26.94/11.00 Total : 9.99
% 26.94/11.00 Index Insertion : 0.00
% 26.94/11.00 Index Deletion : 0.00
% 26.94/11.00 Index Matching : 0.00
% 26.94/11.00 BG Taut test : 0.00
%------------------------------------------------------------------------------