TSTP Solution File: DAT072_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT072_1 : TPTP v8.1.2. Released v6.1.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 : n019.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:37:06 EDT 2023
% Result : Timeout 289.54s 204.16s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 49
% Syntax : Number of formulae : 117 ( 27 unt; 47 typ; 0 def)
% Number of atoms : 142 ( 86 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 112 ( 40 ~; 63 |; 7 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 206 ( 54 atm; 76 fun; 51 num; 25 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 36 ( 16 >; 20 *; 0 +; 0 <<)
% Number of predicates : 8 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 48 ( 43 usr; 32 con; 0-3 aty)
% Number of variables : 37 (; 37 !; 0 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
%$ inRange > sorted > distinct > write > rev > read > max > #nlpp > init > #skF_11 > #skF_5 > #skF_4 > #skF_8 > #skF_1 > #skF_9 > #skF_6 > #skF_3 > #skF_10 > #skF_7 > #skF_2
%Foreground sorts:
tff(array,type,
array: $tType ).
%Background operators:
tff('#skE_7',type,
'#skE_7': $int ).
tff('#skE_21',type,
'#skE_21': $int ).
tff('#skE_11',type,
'#skE_11': $int ).
tff('#skE_25',type,
'#skE_25': $int ).
tff('#skE_23',type,
'#skE_23': $int ).
tff('#skE_12',type,
'#skE_12': $int ).
tff('#skE_2',type,
'#skE_2': $int ).
tff('#skE_1',type,
'#skE_1': $int ).
tff('#skE_20',type,
'#skE_20': $int ).
tff('#skE_6',type,
'#skE_6': $int ).
tff('#skE_13',type,
'#skE_13': $int ).
tff('#skE_26',type,
'#skE_26': $int ).
tff('#skE_10',type,
'#skE_10': $int ).
tff('#skE_24',type,
'#skE_24': $int ).
tff('#skE_5',type,
'#skE_5': $int ).
tff('#skE_15',type,
'#skE_15': $int ).
tff('#skE_8',type,
'#skE_8': $int ).
tff('#skE_4',type,
'#skE_4': $int ).
tff('#skF_12',type,
'#skF_12': $int ).
tff('#skE_22',type,
'#skE_22': $int ).
tff('#skE_16',type,
'#skE_16': $int ).
tff('#skE_17',type,
'#skE_17': $int ).
tff('#skE_3',type,
'#skE_3': $int ).
tff('#skE_9',type,
'#skE_9': $int ).
tff('#skE_18',type,
'#skE_18': $int ).
tff('#skE_19',type,
'#skE_19': $int ).
tff('#skE_14',type,
'#skE_14': $int ).
%Foreground operators:
tff(sorted,type,
sorted: ( array * $int ) > $o ).
tff('#skF_11',type,
'#skF_11': array ).
tff(rev,type,
rev: ( array * $int ) > array ).
tff('#skF_5',type,
'#skF_5': ( array * $int * $int ) > $int ).
tff(write,type,
write: ( array * $int * $int ) > array ).
tff(init,type,
init: $int > array ).
tff('#skF_4',type,
'#skF_4': ( array * $int ) > $int ).
tff('#skF_8',type,
'#skF_8': ( array * array * $int ) > $int ).
tff('#skF_1',type,
'#skF_1': ( array * array ) > $int ).
tff('#skF_9',type,
'#skF_9': array ).
tff('#skF_6',type,
'#skF_6': ( array * $int ) > $int ).
tff('#skF_3',type,
'#skF_3': ( array * $int ) > $int ).
tff('#skF_10',type,
'#skF_10': array ).
tff(max,type,
max: ( array * $int ) > $int ).
tff(inRange,type,
inRange: ( array * $int * $int ) > $o ).
tff('#skF_7',type,
'#skF_7': ( array * $int ) > $int ).
tff(read,type,
read: ( array * $int ) > $int ).
tff(distinct,type,
distinct: ( array * $int ) > $o ).
tff('#skF_2',type,
'#skF_2': ( array * $int * $int ) > $int ).
tff(f_147,negated_conjecture,
~ ! [A: array,B1: array,B2: array,Na: $int] :
( ( ! [Ia: $int] :
( ( $greatereq(Ia,0)
& $greater(Na,Ia)
& ( read(B1,Ia) = read(A,$difference(Na,$sum(Ia,1))) ) )
| ( ( $greater(0,Ia)
| $greatereq(Ia,Na) )
& ( read(B1,Ia) = read(A,Ia) ) ) )
& ! [Ia: $int] :
( ( $greatereq(Ia,0)
& $greater(Na,Ia)
& ( read(B2,Ia) = read(A,$difference(Na,$sum(Ia,1))) ) )
| ( ( $greater(0,Ia)
| $greatereq(Ia,Na) )
& ( read(B2,Ia) = read(A,Ia) ) ) ) )
=> ( B1 = B2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
tff(f_40,axiom,
! [A: array,B: array] :
( ! [Ia: $int] : ( read(A,Ia) = read(B,Ia) )
=> ( A = B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ext) ).
tff(c_72,plain,
'#skF_11' != '#skF_10',
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_87,plain,
! [I_47a: $int] :
( ( read('#skF_9',I_47a) = read('#skF_10',I_47a) )
| $greater('#skF_12',I_47a) ),
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_616034,plain,
! [I_52416: $int] :
( ( read('#skF_9',I_52416) = read('#skF_10',I_52416) )
| $less(I_52416,'#skF_12') ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_87]) ).
tff(c_76,plain,
! [I_48a: $int] :
( ( read('#skF_11',I_48a) = read('#skF_9',I_48a) )
| $greater('#skF_12',I_48a) ),
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_616038,plain,
! [I_52422: $int] :
( ( read('#skF_11',I_52422) = read('#skF_9',I_52422) )
| $less(I_52422,'#skF_12') ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_76]) ).
tff(c_616299,plain,
! [B_52620: array,A_52621: array] :
( ( B_52620 = A_52621 )
| ( read(B_52620,'#skF_1'(A_52621,B_52620)) != read(A_52621,'#skF_1'(A_52621,B_52620)) ) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_623800,plain,
! [A_54903: array] :
( ( A_54903 = '#skF_11' )
| ( read(A_54903,'#skF_1'(A_54903,'#skF_11')) != read('#skF_9','#skF_1'(A_54903,'#skF_11')) )
| $less('#skF_1'(A_54903,'#skF_11'),'#skF_12') ),
inference(superposition,[status(thm),theory(equality)],[c_616038,c_616299]) ).
tff(c_623920,plain,
! [A_54903: array] :
( ( A_54903 = '#skF_11' )
| ( read(A_54903,'#skF_1'(A_54903,'#skF_11')) != read('#skF_10','#skF_1'(A_54903,'#skF_11')) )
| $less('#skF_1'(A_54903,'#skF_11'),'#skF_12') ),
inference(superposition,[status(thm),theory(equality)],[c_616034,c_623800]) ).
tff(c_624437,plain,
( ( '#skF_11' = '#skF_10' )
| $less('#skF_1'('#skF_10','#skF_11'),'#skF_12') ),
inference(reflexivity,[status(thm),theory(equality)],[c_623920]) ).
tff(c_624442,plain,
$less('#skF_1'('#skF_10','#skF_11'),'#skF_12'),
inference(negUnitSimplification,[status(thm)],[c_72,c_624437]) ).
tff(c_624587,plain,
'#skF_1'('#skF_10','#skF_11') = '#skE_16',
inference(define,[status(thm),theory(equality)],[c_624442]) ).
tff(c_616065,plain,
! [B_52492: array,A_52493: array] :
( ( B_52492 = A_52493 )
| ( read(B_52492,'#skF_1'(A_52493,B_52492)) != read(A_52493,'#skF_1'(A_52493,B_52492)) ) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_624601,plain,
( ( '#skF_11' = '#skF_10' )
| ( read('#skF_11','#skE_16') != read('#skF_10','#skF_1'('#skF_10','#skF_11')) ) ),
inference(superposition,[status(thm),theory(equality)],[c_624587,c_616065]) ).
tff(c_624620,plain,
( ( '#skF_11' = '#skF_10' )
| ( read('#skF_11','#skE_16') != read('#skF_10','#skE_16') ) ),
inference(demodulation,[status(thm),theory(equality)],[c_624587,c_624601]) ).
tff(c_624624,plain,
read('#skF_11','#skE_16') != read('#skF_10','#skE_16'),
inference(negUnitSimplification,[status(thm)],[c_72,c_624620]) ).
tff(c_624630,plain,
read('#skF_10','#skE_16') = '#skE_18',
inference(define,[status(thm),theory(equality)],[c_624624]) ).
tff(c_624629,plain,
read('#skF_11','#skE_16') = '#skE_17',
inference(define,[status(thm),theory(equality)],[c_624624]) ).
tff(c_624628,plain,
read('#skF_11','#skE_16') != read('#skF_10','#skE_16'),
inference(negUnitSimplification,[status(thm)],[c_72,c_624620]) ).
tff(c_624641,plain,
'#skE_18' != '#skE_17',
inference(demodulation,[status(thm),theory(equality)],[c_624630,c_624629,c_624628]) ).
tff(c_78,plain,
! [I_48a: $int] :
( ( read('#skF_11',I_48a) = read('#skF_9',I_48a) )
| $greatereq(I_48a,0) ),
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_616037,plain,
! [I_52421: $int] :
( ( read('#skF_11',I_52421) = read('#skF_9',I_52421) )
| ~ $less(I_52421,0) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_78]) ).
tff(c_616392,plain,
! [A_52621: array] :
( ( A_52621 = '#skF_11' )
| ( read(A_52621,'#skF_1'(A_52621,'#skF_11')) != read('#skF_9','#skF_1'(A_52621,'#skF_11')) )
| ~ $less('#skF_1'(A_52621,'#skF_11'),0) ),
inference(superposition,[status(thm),theory(equality)],[c_616037,c_616299]) ).
tff(c_624597,plain,
( ( '#skF_11' = '#skF_10' )
| ( read('#skF_9','#skE_16') != read('#skF_10','#skF_1'('#skF_10','#skF_11')) )
| ~ $less('#skF_1'('#skF_10','#skF_11'),0) ),
inference(superposition,[status(thm),theory(equality)],[c_624587,c_616392]) ).
tff(c_624613,plain,
( ( '#skF_11' = '#skF_10' )
| ( read('#skF_9','#skE_16') != read('#skF_10','#skE_16') )
| ~ $less('#skE_16',0) ),
inference(demodulation,[status(thm),theory(equality)],[c_624587,c_624587,c_624597]) ).
tff(c_624617,plain,
( ( read('#skF_9','#skE_16') != read('#skF_10','#skE_16') )
| ~ $less('#skE_16',0) ),
inference(negUnitSimplification,[status(thm)],[c_72,c_624613]) ).
tff(c_624858,plain,
read('#skF_10','#skE_16') = '#skE_18',
inference(define,[status(thm),theory(equality)],[c_624617]) ).
tff(c_624857,plain,
read('#skF_9','#skE_16') = '#skE_19',
inference(define,[status(thm),theory(equality)],[c_624617]) ).
tff(c_624856,plain,
( ( read('#skF_9','#skE_16') != read('#skF_10','#skE_16') )
| ~ $less('#skE_16',0) ),
inference(negUnitSimplification,[status(thm)],[c_72,c_624613]) ).
tff(c_624869,plain,
( ( '#skE_19' != '#skE_18' )
| ~ $less('#skE_16',0) ),
inference(demodulation,[status(thm),theory(equality)],[c_624858,c_624857,c_624856]) ).
tff(c_625275,plain,
~ $less('#skE_16',0),
inference(splitLeft,[status(thm)],[c_624869]) ).
tff(c_624584,plain,
'#skF_1'('#skF_10','#skF_11') = '#skE_16',
inference(define,[status(thm),theory(equality)],[c_624442]) ).
tff(c_624583,plain,
$less('#skF_1'('#skF_10','#skF_11'),'#skF_12'),
inference(negUnitSimplification,[status(thm)],[c_72,c_624437]) ).
tff(c_624588,plain,
$less('#skE_16','#skF_12'),
inference(demodulation,[status(thm),theory(equality)],[c_624584,c_624583]) ).
tff(c_624871,plain,
read('#skF_10','#skE_16') = '#skE_18',
inference(define,[status(thm),theory(equality)],[c_624624]) ).
tff(c_91,plain,
! [I_47a: $int] :
( ( read('#skF_9',$sum($uminus(1),$sum($uminus(I_47a),'#skF_12'))) = read('#skF_10',I_47a) )
| $greater(0,I_47a)
| $greatereq(I_47a,'#skF_12') ),
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_96,plain,
! [I_47a: $int] :
( ( read('#skF_9',$sum($uminus(1),$sum('#skF_12',$uminus(I_47a)))) = read('#skF_10',I_47a) )
| $less(I_47a,0)
| ~ $less(I_47a,'#skF_12') ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_91]) ).
tff(c_616032,plain,
! [X_52413: $int,I_52414: $int] :
( ( read('#skF_9',X_52413) = read('#skF_10',I_52414) )
| ( X_52413 != $sum($uminus(1),$sum($uminus(I_52414),'#skF_12')) )
| $less(I_52414,0)
| ~ $less(I_52414,'#skF_12') ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_96]) ).
tff(c_625029,plain,
read('#skF_9','#skE_16') = '#skE_19',
inference(define,[status(thm),theory(equality)],[c_624617]) ).
tff(c_85,plain,
! [I_47a: $int] :
( ( read('#skF_9',$sum($uminus(1),$sum($uminus(I_47a),'#skF_12'))) = read('#skF_10',I_47a) )
| ( read('#skF_9',I_47a) = read('#skF_10',I_47a) ) ),
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_103,plain,
! [I_47a: $int] :
( ( read('#skF_9',$sum($uminus(1),$sum('#skF_12',$uminus(I_47a)))) = read('#skF_10',I_47a) )
| ( read('#skF_9',I_47a) = read('#skF_10',I_47a) ) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_85]) ).
tff(c_616035,plain,
! [X_52417: $int,I_52418: $int] :
( ( read('#skF_9',X_52417) = read('#skF_10',I_52418) )
| ( X_52417 != $sum($uminus(1),$sum($uminus(I_52418),'#skF_12')) )
| ( read('#skF_9',I_52418) = read('#skF_10',I_52418) ) ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_103]) ).
tff(c_625072,plain,
( ( read('#skF_9',$sum($uminus(1),$sum($uminus('#skE_16'),'#skF_12'))) = read('#skF_10','#skE_16') )
| ( read('#skF_10','#skE_16') = '#skE_19' ) ),
inference(superposition,[status(thm),theory(equality)],[c_625029,c_616035]) ).
tff(c_625194,plain,
( ( read('#skF_9',$sum($uminus(1),$sum($uminus('#skE_16'),'#skF_12'))) = '#skE_18' )
| ( '#skE_19' = '#skE_18' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_624871,c_624871,c_625072]) ).
tff(c_630306,plain,
read('#skF_9',$sum($uminus(1),$sum($uminus('#skE_16'),'#skF_12'))) = '#skE_24',
inference(define,[status(thm),theory(equality)],[c_625194]) ).
tff(c_630630,plain,
! [I_52414: $int] :
( ( read('#skF_10',I_52414) = '#skE_24' )
| ( $sum($uminus(1),$sum($uminus(I_52414),'#skF_12')) != $sum($uminus(1),$sum($uminus('#skE_16'),'#skF_12')) )
| $less(I_52414,0)
| ~ $less(I_52414,'#skF_12') ),
inference(superposition,[status(thm),theory(equality)],[c_616032,c_630306]) ).
tff(c_630634,plain,
( ( read('#skF_10','#skE_16') = '#skE_24' )
| $less('#skE_16',0)
| ~ $less('#skE_16','#skF_12') ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_630630]) ).
tff(c_635819,plain,
( ( '#skE_24' = '#skE_18' )
| $less('#skE_16',0) ),
inference(demodulation,[status(thm),theory(equality)],[c_624588,c_624871,c_630634]) ).
tff(c_635821,plain,
'#skE_24' = '#skE_18',
inference(negUnitSimplification,[status(thm)],[c_625275,c_635819]) ).
tff(c_629991,plain,
read('#skF_9',$sum($uminus(1),$sum($uminus('#skE_16'),'#skF_12'))) = '#skE_24',
inference(define,[status(thm),theory(equality)],[c_625194]) ).
tff(c_635831,plain,
read('#skF_9',$sum($uminus(1),$sum($uminus('#skE_16'),'#skF_12'))) = '#skE_18',
inference(demodulation,[status(thm),theory(equality)],[c_635821,c_629991]) ).
tff(c_80,plain,
! [I_48a: $int] :
( ( read('#skF_11',I_48a) = read('#skF_9',$sum($uminus(1),$sum($uminus(I_48a),'#skF_12'))) )
| $greater(0,I_48a)
| $greatereq(I_48a,'#skF_12') ),
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_108,plain,
! [I_48a: $int] :
( ( read('#skF_11',I_48a) = read('#skF_9',$sum($uminus(1),$sum('#skF_12',$uminus(I_48a)))) )
| $less(I_48a,0)
| ~ $less(I_48a,'#skF_12') ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_80]) ).
tff(c_616036,plain,
! [X_52420: $int,I_52419: $int] :
( ( read('#skF_9',X_52420) = read('#skF_11',I_52419) )
| ( X_52420 != $sum($uminus(1),$sum($uminus(I_52419),'#skF_12')) )
| $less(I_52419,0)
| ~ $less(I_52419,'#skF_12') ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_108]) ).
tff(c_624644,plain,
read('#skF_11','#skE_16') = '#skE_17',
inference(define,[status(thm),theory(equality)],[c_624624]) ).
tff(c_624722,plain,
( ( read('#skF_9',$sum($uminus(1),$sum($uminus('#skE_16'),'#skF_12'))) = '#skE_17' )
| $less('#skE_16',0)
| ~ $less('#skE_16','#skF_12') ),
inference(superposition,[status(thm),theory(equality)],[c_616036,c_624644]) ).
tff(c_624842,plain,
( ( read('#skF_9',$sum($uminus(1),$sum($uminus('#skE_16'),'#skF_12'))) = '#skE_17' )
| $less('#skE_16',0) ),
inference(demodulation,[status(thm),theory(equality)],[c_624588,c_624722]) ).
tff(c_645463,plain,
( ( '#skE_18' = '#skE_17' )
| $less('#skE_16',0) ),
inference(demodulation,[status(thm),theory(equality)],[c_635831,c_624842]) ).
tff(c_645464,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_625275,c_624641,c_645463]) ).
tff(c_645468,plain,
$less('#skE_16',0),
inference(splitRight,[status(thm)],[c_624869]) ).
tff(c_625028,plain,
read('#skF_9','#skE_16') = '#skE_19',
inference(define,[status(thm),theory(equality)],[c_624617]) ).
tff(c_624845,plain,
( ( read('#skF_9','#skE_16') = '#skE_17' )
| ~ $less('#skE_16',0) ),
inference(superposition,[status(thm),theory(equality)],[c_616037,c_624644]) ).
tff(c_645473,plain,
'#skE_19' = '#skE_17',
inference(demodulation,[status(thm),theory(equality)],[c_645468,c_625028,c_624845]) ).
tff(c_89,plain,
! [I_47a: $int] :
( ( read('#skF_9',I_47a) = read('#skF_10',I_47a) )
| $greatereq(I_47a,0) ),
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_616033,plain,
! [I_52415: $int] :
( ( read('#skF_9',I_52415) = read('#skF_10',I_52415) )
| ~ $less(I_52415,0) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_89]) ).
tff(c_625097,plain,
( ( read('#skF_10','#skE_16') = '#skE_19' )
| ~ $less('#skE_16',0) ),
inference(superposition,[status(thm),theory(equality)],[c_625029,c_616033]) ).
tff(c_625223,plain,
( ( '#skE_19' = '#skE_18' )
| ~ $less('#skE_16',0) ),
inference(demodulation,[status(thm),theory(equality)],[c_624871,c_625097]) ).
tff(c_645485,plain,
'#skE_18' = '#skE_17',
inference(demodulation,[status(thm),theory(equality)],[c_645468,c_645473,c_625223]) ).
tff(c_645486,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_624641,c_645485]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : DAT072_1 : TPTP v8.1.2. Released v6.1.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.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 13:12:32 EDT 2023
% 0.14/0.36 % CPUTime :
% 155.27/101.51 ***********************************************************************
% 155.27/101.51 After 99.8 sec it's time to try something different, got 99.8 sec left
% 155.27/101.51 ***********************************************************************
% 280.26/201.31 ***********************************************************************
% 280.26/201.31 After 199.6 sec it's time to try something different, got 99.7 sec left
% 280.26/201.31 ***********************************************************************
% 289.54/204.16 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 289.54/204.16
% 289.54/204.16 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 289.54/204.20
% 289.54/204.20 Inference rules
% 289.54/204.20 ----------------------
% 289.54/204.20 #Ref : 112
% 289.54/204.20 #Sup : 123680
% 289.54/204.20 #Fact : 45
% 289.54/204.20 #Define : 28
% 289.54/204.20 #Split : 79
% 289.54/204.20 #Chain : 0
% 289.54/204.20 #Close : 0
% 289.54/204.20
% 289.54/204.20 Ordering : LPO
% 289.54/204.20
% 289.54/204.20 Simplification rules
% 289.54/204.20 ----------------------
% 289.54/204.20 #Subsume : 10339
% 289.54/204.20 #Demod : 2140
% 289.54/204.20 #Tautology : 27188
% 289.54/204.20 #SimpNegUnit : 535
% 289.54/204.20 #BackRed : 23
% 289.54/204.20
% 289.54/204.20 #Partial instantiations: 0
% 289.54/204.20 #Strategies tried : 3
% 289.54/204.20
% 289.54/204.20 Timing (in seconds)
% 289.54/204.20 ----------------------
% 289.54/204.20 Preprocessing : 0.71
% 289.54/204.20 Parsing : 0.33
% 289.54/204.20 CNF conversion : 0.05
% 289.54/204.20 Main loop : 202.42
% 289.54/204.20 Inferencing : 15.75
% 289.54/204.20 Reduction : 19.57
% 289.54/204.20 Demodulation : 12.95
% 289.54/204.20 BG Simplification : 4.93
% 289.54/204.20 Subsumption : 151.42
% 289.54/204.20 Abstraction : 2.28
% 289.54/204.20 MUC search : 0.00
% 289.54/204.20 Cooper : 0.09
% 289.54/204.20 Total : 203.18
% 289.54/204.20 Index Insertion : 0.00
% 289.54/204.20 Index Deletion : 0.00
% 289.54/204.20 Index Matching : 0.00
% 289.54/204.20 BG Taut test : 0.00
%------------------------------------------------------------------------------