TSTP Solution File: SWW678_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWW678_1 : TPTP v8.1.2. Released v6.4.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 : n025.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 11:07:56 EDT 2023
% Result : Theorem 7.99s 2.98s
% Output : CNFRefutation 8.58s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWW678_1 : TPTP v8.1.2. Released v6.4.0.
% 0.00/0.14 % 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.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 19:28:49 EDT 2023
% 0.14/0.36 % CPUTime :
% 7.99/2.98 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.99/3.00
% 7.99/3.00 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.44/3.06 %$ in > searchtree > node:(Int*Tree*Tree)>Tree > #nlpp > val:(Tree)>Int > right:(Tree)>Tree > left:(Tree)>Tree > empty:Tree > #skF_5 > #skF_6 > #skF_2 > #skF_1 > #skF_3
% 8.44/3.06
% 8.44/3.06 %Foreground sorts:
% 8.44/3.06 tff(Tree, type, Tree: $tType ).
% 8.44/3.06
% 8.44/3.06 %Background operators:
% 8.44/3.06 tff('#skE_1', type, '#skE_1': $int).
% 8.44/3.06 tff('#skF_4', type, '#skF_4': $int).
% 8.44/3.06
% 8.44/3.06 %Foreground operators:
% 8.44/3.06 tff('#skF_5', type, '#skF_5': Tree).
% 8.44/3.06 tff(val:(Tree)>Int, type, val:(Tree)>Int: Tree > $int).
% 8.44/3.06 tff(right:(Tree)>Tree, type, right:(Tree)>Tree: Tree > Tree).
% 8.44/3.06 tff(node:(Int*Tree*Tree)>Tree, type, node:(Int*Tree*Tree)>Tree: ($int * Tree * Tree) > Tree).
% 8.44/3.06 tff(in, type, in: ($int * Tree) > $o).
% 8.44/3.06 tff(searchtree, type, searchtree: Tree > $o).
% 8.44/3.06 tff('#skF_6', type, '#skF_6': Tree).
% 8.44/3.06 tff('#skF_2', type, '#skF_2': Tree > $int).
% 8.44/3.06 tff('#skF_1', type, '#skF_1': Tree > $int).
% 8.44/3.06 tff('#skF_3', type, '#skF_3': Tree).
% 8.44/3.06 tff(left:(Tree)>Tree, type, left:(Tree)>Tree: Tree > Tree).
% 8.44/3.06 tff(empty:Tree, type, empty:Tree: Tree).
% 8.44/3.06
% 8.58/3.10 tff(f_129, negated_conjecture, ~(![T:Tree, Va:$int]: (searchtree(T) => ((((T = empty) => $false) & (~(T = empty) => (((Va = val(T)) => $true) & (~(Va = val(T)) => (($less(Va, val(T)) => (?[T_3:Tree]: ((T_3 = left(T)) & in(Va, T_3)))) & (~$less(Va, val(T)) => (?[T_5:Tree]: ((T_5 = right(T)) & in(Va, T_5))))))))) <=> in(Va, T)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', formula_007)).
% 8.58/3.10 tff(f_65, axiom, (![Va:$int, T:Tree]: (in(Va, T) <=> (((T = empty) => $false) & (~(T = empty) => (((Va = val(T)) | in(Va, left(T))) | in(Va, right(T))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', formula_005)).
% 8.58/3.10 tff(f_92, axiom, (![T:Tree]: (searchtree(T) <=> (((T = empty) => $true) & (~(T = empty) => (((searchtree(left(T)) & searchtree(right(T))) & (![Va:$int]: (in(Va, left(T)) => $lesseq(Va, val(T))))) & (![Va:$int]: (in(Va, right(T)) => $greater(Va, val(T))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', formula_006)).
% 8.58/3.10 tff(f_33, axiom, (![X:Tree]: ((X = empty) | (X = node(val(X), left(X), right(X))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', formula)).
% 8.58/3.10 tff(f_46, axiom, (![X_1_0a:$int, X_1_1:Tree, X_1_2:Tree]: ~(empty = node(X_1_0a, X_1_1, X_1_2))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', formula_004)).
% 8.58/3.10 tff(f_36, axiom, (![X_1_0a:$int, X_1_1:Tree, X_1_2:Tree]: (val(node(X_1_0a, X_1_1, X_1_2)) = X_1_0a)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', formula_001)).
% 8.58/3.10 tff(f_39, axiom, (![X_1_0a:$int, X_1_1:Tree, X_1_2:Tree]: (left(node(X_1_0a, X_1_1, X_1_2)) = X_1_1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', formula_002)).
% 8.58/3.10 tff(f_42, axiom, (![X_1_0a:$int, X_1_1:Tree, X_1_2:Tree]: (right(node(X_1_0a, X_1_1, X_1_2)) = X_1_2)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', formula_003)).
% 8.58/3.10 tff(c_152, plain, (empty!='#skF_3' | in('#skF_4', '#skF_3')), inference(cnfTransformation, [status(thm)], [f_129])).
% 8.58/3.10 tff(c_360, plain, (empty!='#skF_3'), inference(splitLeft, [status(thm)], [c_152])).
% 8.58/3.10 tff(c_187, plain, (~in('#skF_4', '#skF_3') | val('#skF_3')!='#skF_4' | empty='#skF_3'), inference(cnfTransformation, [status(thm)], [f_129])).
% 8.58/3.10 tff(c_392, plain, (~in('#skF_4', '#skF_3') | val('#skF_3')!='#skF_4'), inference(negUnitSimplification, [status(thm)], [c_360, c_187])).
% 8.58/3.10 tff(c_398, plain, (val('#skF_3')='#skE_1'), inference(define, [status(thm), theory('equality')], [c_392])).
% 8.58/3.10 tff(c_278, plain, (![T_15:Tree]: (in(val(T_15), T_15) | empty=T_15)), inference(cnfTransformation, [status(thm)], [f_65])).
% 8.58/3.10 tff(c_406, plain, (in('#skE_1', '#skF_3') | empty='#skF_3'), inference(superposition, [status(thm), theory('equality')], [c_398, c_278])).
% 8.58/3.10 tff(c_418, plain, (in('#skE_1', '#skF_3')), inference(negUnitSimplification, [status(thm)], [c_360, c_406])).
% 8.58/3.10 tff(c_394, plain, (val('#skF_3')='#skE_1'), inference(define, [status(thm), theory('equality')], [c_392])).
% 8.58/3.10 tff(c_393, plain, (~in('#skF_4', '#skF_3') | val('#skF_3')!='#skF_4'), inference(negUnitSimplification, [status(thm)], [c_360, c_187])).
% 8.58/3.10 tff(c_401, plain, (~in('#skF_4', '#skF_3') | '#skF_4'!='#skE_1'), inference(demodulation, [status(thm), theory('equality')], [c_394, c_393])).
% 8.58/3.10 tff(c_423, plain, ('#skF_4'!='#skE_1'), inference(splitLeft, [status(thm)], [c_401])).
% 8.58/3.10 tff(c_136, plain, (left('#skF_3')='#skF_5' | ~$less('#skF_4', val('#skF_3')) | val('#skF_3')='#skF_4' | empty='#skF_3' | in('#skF_4', '#skF_3')), inference(cnfTransformation, [status(thm)], [f_129])).
% 8.58/3.10 tff(c_528, plain, (left('#skF_3')='#skF_5' | ~$less('#skF_4', '#skE_1') | '#skF_4'='#skE_1' | empty='#skF_3' | in('#skF_4', '#skF_3')), inference(demodulation, [status(thm), theory('equality')], [c_398, c_398, c_136])).
% 8.58/3.10 tff(c_532, plain, (left('#skF_3')='#skF_5' | ~$less('#skF_4', '#skE_1') | in('#skF_4', '#skF_3')), inference(negUnitSimplification, [status(thm)], [c_360, c_423, c_528])).
% 8.58/3.10 tff(c_535, plain, (~$less('#skF_4', '#skE_1')), inference(splitLeft, [status(thm)], [c_532])).
% 8.58/3.10 tff(c_148, plain, (in('#skF_4', '#skF_6') | $less('#skF_4', val('#skF_3')) | val('#skF_3')='#skF_4' | empty='#skF_3' | in('#skF_4', '#skF_3')), inference(cnfTransformation, [status(thm)], [f_129])).
% 8.58/3.10 tff(c_2204, plain, (in('#skF_4', '#skF_6') | $less('#skF_4', '#skE_1') | '#skF_4'='#skE_1' | empty='#skF_3' | in('#skF_4', '#skF_3')), inference(demodulation, [status(thm), theory('equality')], [c_398, c_398, c_148])).
% 8.58/3.10 tff(c_2208, plain, (in('#skF_4', '#skF_6') | in('#skF_4', '#skF_3')), inference(negUnitSimplification, [status(thm)], [c_360, c_423, c_535, c_2204])).
% 8.58/3.10 tff(c_2215, plain, (in('#skF_4', '#skF_3')), inference(splitLeft, [status(thm)], [c_2208])).
% 8.58/3.10 tff(c_144, plain, (right('#skF_3')='#skF_6' | $less('#skF_4', val('#skF_3')) | val('#skF_3')='#skF_4' | empty='#skF_3' | in('#skF_4', '#skF_3')), inference(cnfTransformation, [status(thm)], [f_129])).
% 8.58/3.10 tff(c_1743, plain, (right('#skF_3')='#skF_6' | $less('#skF_4', '#skE_1') | '#skF_4'='#skE_1' | empty='#skF_3' | in('#skF_4', '#skF_3')), inference(demodulation, [status(thm), theory('equality')], [c_398, c_398, c_144])).
% 8.58/3.10 tff(c_1747, plain, (right('#skF_3')='#skF_6' | in('#skF_4', '#skF_3')), inference(negUnitSimplification, [status(thm)], [c_360, c_423, c_535, c_1743])).
% 8.58/3.10 tff(c_1749, plain, (right('#skF_3')='#skF_6'), inference(splitLeft, [status(thm)], [c_1747])).
% 8.58/3.10 tff(c_1796, plain, (![V_501a:$int, T_502:Tree]: (in(V_501a, right(T_502)) | in(V_501a, left(T_502)) | val(T_502)=V_501a | empty=T_502 | ~in(V_501a, T_502))), inference(cnfTransformation, [status(thm)], [f_65])).
% 8.58/3.10 tff(c_1809, plain, (![V_501a:$int]: (in(V_501a, '#skF_6') | in(V_501a, left('#skF_3')) | val('#skF_3')=V_501a | empty='#skF_3' | ~in(V_501a, '#skF_3'))), inference(superposition, [status(thm), theory('equality')], [c_1749, c_1796])).
% 8.58/3.10 tff(c_1821, plain, (![V_501a:$int]: (in(V_501a, '#skF_6') | in(V_501a, left('#skF_3')) | V_501a='#skE_1' | empty='#skF_3' | ~in(V_501a, '#skF_3'))), inference(demodulation, [status(thm), theory('equality')], [c_398, c_1809])).
% 8.58/3.10 tff(c_1901, plain, (![V_506a:$int]: (in(V_506a, '#skF_6') | in(V_506a, left('#skF_3')) | V_506a='#skE_1' | ~in(V_506a, '#skF_3'))), inference(negUnitSimplification, [status(thm)], [c_360, c_1821])).
% 8.58/3.10 tff(c_1673, plain, (in('#skF_4', '#skF_6') | $less('#skF_4', '#skE_1') | '#skF_4'='#skE_1' | empty='#skF_3' | in('#skF_4', '#skF_3')), inference(demodulation, [status(thm), theory('equality')], [c_398, c_398, c_148])).
% 8.58/3.10 tff(c_1677, plain, (in('#skF_4', '#skF_6') | in('#skF_4', '#skF_3')), inference(negUnitSimplification, [status(thm)], [c_360, c_423, c_535, c_1673])).
% 8.58/3.10 tff(c_1684, plain, (in('#skF_4', '#skF_3')), inference(splitLeft, [status(thm)], [c_1677])).
% 8.58/3.10 tff(c_48, plain, (searchtree('#skF_3')), inference(cnfTransformation, [status(thm)], [f_129])).
% 8.58/3.10 tff(c_1150, plain, (in('#skF_4', '#skF_6') | $less('#skF_4', '#skE_1') | '#skF_4'='#skE_1' | empty='#skF_3' | in('#skF_4', '#skF_3')), inference(demodulation, [status(thm), theory('equality')], [c_398, c_398, c_148])).
% 8.58/3.10 tff(c_1154, plain, (in('#skF_4', '#skF_6') | in('#skF_4', '#skF_3')), inference(negUnitSimplification, [status(thm)], [c_360, c_423, c_535, c_1150])).
% 8.58/3.10 tff(c_1161, plain, (in('#skF_4', '#skF_3')), inference(splitLeft, [status(thm)], [c_1154])).
% 8.58/3.10 tff(c_610, plain, (![V_257a:$int, T_258:Tree]: (in(V_257a, right(T_258)) | in(V_257a, left(T_258)) | val(T_258)=V_257a | empty=T_258 | ~in(V_257a, T_258))), inference(cnfTransformation, [status(thm)], [f_65])).
% 8.58/3.10 tff(c_270, plain, (~in('#skF_4', '#skF_3') | ~in('#skF_4', left('#skF_3')) | ~in('#skF_4', right('#skF_3')) | empty='#skF_3'), inference(cnfTransformation, [status(thm)], [f_129])).
% 8.58/3.10 tff(c_590, plain, (~in('#skF_4', '#skF_3') | ~in('#skF_4', left('#skF_3')) | ~in('#skF_4', right('#skF_3'))), inference(negUnitSimplification, [status(thm)], [c_360, c_270])).
% 8.58/3.10 tff(c_595, plain, (~in('#skF_4', right('#skF_3'))), inference(splitLeft, [status(thm)], [c_590])).
% 8.58/3.10 tff(c_614, plain, (in('#skF_4', left('#skF_3')) | val('#skF_3')='#skF_4' | empty='#skF_3' | ~in('#skF_4', '#skF_3')), inference(resolution, [status(thm)], [c_610, c_595])).
% 8.58/3.10 tff(c_634, plain, (in('#skF_4', left('#skF_3')) | '#skF_4'='#skE_1' | empty='#skF_3' | ~in('#skF_4', '#skF_3')), inference(demodulation, [status(thm), theory('equality')], [c_398, c_614])).
% 8.58/3.10 tff(c_638, plain, (in('#skF_4', left('#skF_3')) | ~in('#skF_4', '#skF_3')), inference(negUnitSimplification, [status(thm)], [c_360, c_423, c_634])).
% 8.58/3.10 tff(c_659, plain, (~in('#skF_4', '#skF_3')), inference(splitLeft, [status(thm)], [c_638])).
% 8.58/3.10 tff(c_1164, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_1161, c_659])).
% 8.58/3.10 tff(c_1170, plain, (in('#skF_4', '#skF_6')), inference(splitRight, [status(thm)], [c_1154])).
% 8.58/3.10 tff(c_789, plain, (right('#skF_3')='#skF_6' | $less('#skF_4', '#skE_1') | '#skF_4'='#skE_1' | empty='#skF_3' | in('#skF_4', '#skF_3')), inference(demodulation, [status(thm), theory('equality')], [c_398, c_398, c_144])).
% 8.58/3.10 tff(c_793, plain, (right('#skF_3')='#skF_6' | in('#skF_4', '#skF_3')), inference(negUnitSimplification, [status(thm)], [c_360, c_423, c_535, c_789])).
% 8.58/3.10 tff(c_795, plain, (right('#skF_3')='#skF_6'), inference(splitLeft, [status(thm)], [c_793])).
% 8.58/3.10 tff(c_817, plain, (~in('#skF_4', '#skF_6')), inference(demodulation, [status(thm), theory('equality')], [c_795, c_595])).
% 8.58/3.10 tff(c_1173, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_1170, c_817])).
% 8.58/3.10 tff(c_1183, plain, (in('#skF_4', '#skF_3')), inference(splitRight, [status(thm)], [c_793])).
% 8.58/3.10 tff(c_1186, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_1183, c_659])).
% 8.58/3.10 tff(c_1193, plain, (in('#skF_4', left('#skF_3'))), inference(splitRight, [status(thm)], [c_638])).
% 8.58/3.10 tff(c_28, plain, (![V_21a:$int, T_16:Tree]: ($lesseq(V_21a, val(T_16)) | ~in(V_21a, left(T_16)) | empty=T_16 | ~searchtree(T_16))), inference(cnfTransformation, [status(thm)], [f_92])).
% 8.58/3.10 tff(c_275, plain, (![T_16:Tree, V_21a:$int]: (~$less(val(T_16), V_21a) | ~in(V_21a, left(T_16)) | empty=T_16 | ~searchtree(T_16))), inference(backgroundSimplification, [status(thm), theory('LRFIA')], [c_28])).
% 8.58/3.10 tff(c_1198, plain, (~$less(val('#skF_3'), '#skF_4') | empty='#skF_3' | ~searchtree('#skF_3')), inference(resolution, [status(thm)], [c_1193, c_275])).
% 8.58/3.10 tff(c_1211, plain, (~$less('#skE_1', '#skF_4') | empty='#skF_3'), inference(demodulation, [status(thm), theory('equality')], [c_48, c_398, c_1198])).
% 8.58/3.10 tff(c_1213, plain, (~$less('#skE_1', '#skF_4')), inference(negUnitSimplification, [status(thm)], [c_360, c_1211])).
% 8.58/3.10 tff(c_1224, plain, $false, inference(close, [status(thm), theory('LIA')], [c_1213, c_535, c_423])).
% 8.58/3.10 tff(c_1228, plain, (~in('#skF_4', left('#skF_3')) | ~in('#skF_4', '#skF_3')), inference(splitRight, [status(thm)], [c_590])).
% 8.58/3.10 tff(c_1234, plain, (~in('#skF_4', '#skF_3')), inference(splitLeft, [status(thm)], [c_1228])).
% 8.58/3.10 tff(c_1687, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_1684, c_1234])).
% 8.58/3.10 tff(c_1694, plain, (in('#skF_4', '#skF_6')), inference(splitRight, [status(thm)], [c_1677])).
% 8.58/3.10 tff(c_1250, plain, (right('#skF_3')='#skF_6' | $less('#skF_4', '#skE_1') | '#skF_4'='#skE_1' | empty='#skF_3' | in('#skF_4', '#skF_3')), inference(demodulation, [status(thm), theory('equality')], [c_398, c_398, c_144])).
% 8.58/3.10 tff(c_1254, plain, (right('#skF_3')='#skF_6' | in('#skF_4', '#skF_3')), inference(negUnitSimplification, [status(thm)], [c_360, c_423, c_535, c_1250])).
% 8.58/3.10 tff(c_1256, plain, (right('#skF_3')='#skF_6'), inference(splitLeft, [status(thm)], [c_1254])).
% 8.58/3.10 tff(c_280, plain, (![V_14a:$int, T_15:Tree]: (~in(V_14a, right(T_15)) | in(V_14a, T_15) | empty=T_15)), inference(cnfTransformation, [status(thm)], [f_65])).
% 8.58/3.10 tff(c_1278, plain, (![V_14a:$int]: (~in(V_14a, '#skF_6') | in(V_14a, '#skF_3') | empty='#skF_3')), inference(superposition, [status(thm), theory('equality')], [c_1256, c_280])).
% 8.58/3.10 tff(c_1295, plain, (![V_14a:$int]: (~in(V_14a, '#skF_6') | in(V_14a, '#skF_3'))), inference(negUnitSimplification, [status(thm)], [c_360, c_1278])).
% 8.58/3.10 tff(c_1715, plain, (in('#skF_4', '#skF_3')), inference(resolution, [status(thm)], [c_1694, c_1295])).
% 8.58/3.10 tff(c_1718, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_1715, c_1234])).
% 8.58/3.10 tff(c_1725, plain, (in('#skF_4', '#skF_3')), inference(splitRight, [status(thm)], [c_1254])).
% 8.58/3.10 tff(c_1728, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_1725, c_1234])).
% 8.58/3.10 tff(c_1732, plain, (~in('#skF_4', left('#skF_3'))), inference(splitRight, [status(thm)], [c_1228])).
% 8.58/3.10 tff(c_1920, plain, (in('#skF_4', '#skF_6') | '#skF_4'='#skE_1' | ~in('#skF_4', '#skF_3')), inference(resolution, [status(thm)], [c_1901, c_1732])).
% 8.58/3.10 tff(c_1959, plain, (in('#skF_4', '#skF_6') | ~in('#skF_4', '#skF_3')), inference(negUnitSimplification, [status(thm)], [c_423, c_1920])).
% 8.58/3.10 tff(c_1964, plain, (~in('#skF_4', '#skF_3')), inference(splitLeft, [status(thm)], [c_1959])).
% 8.58/3.10 tff(c_2218, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_2215, c_1964])).
% 8.58/3.10 tff(c_2225, plain, (in('#skF_4', '#skF_6')), inference(splitRight, [status(thm)], [c_2208])).
% 8.58/3.10 tff(c_1771, plain, (![V_14a:$int]: (~in(V_14a, '#skF_6') | in(V_14a, '#skF_3') | empty='#skF_3')), inference(superposition, [status(thm), theory('equality')], [c_1749, c_280])).
% 8.58/3.10 tff(c_1788, plain, (![V_14a:$int]: (~in(V_14a, '#skF_6') | in(V_14a, '#skF_3'))), inference(negUnitSimplification, [status(thm)], [c_360, c_1771])).
% 8.58/3.10 tff(c_2246, plain, (in('#skF_4', '#skF_3')), inference(resolution, [status(thm)], [c_2225, c_1788])).
% 8.58/3.10 tff(c_2249, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_2246, c_1964])).
% 8.58/3.10 tff(c_2256, plain, (in('#skF_4', '#skF_6')), inference(splitRight, [status(thm)], [c_1959])).
% 8.58/3.10 tff(c_2292, plain, (in('#skF_4', '#skF_3')), inference(resolution, [status(thm)], [c_2256, c_1788])).
% 8.58/3.10 tff(c_2255, plain, (in('#skF_4', '#skF_6')), inference(splitRight, [status(thm)], [c_1959])).
% 8.58/3.10 tff(c_247, plain, (~in('#skF_4', '#skF_3') | $less('#skF_4', val('#skF_3')) | ~in('#skF_4', right('#skF_3')) | empty='#skF_3'), inference(cnfTransformation, [status(thm)], [f_129])).
% 8.58/3.10 tff(c_2278, plain, (~in('#skF_4', '#skF_3') | $less('#skF_4', '#skE_1') | empty='#skF_3'), inference(demodulation, [status(thm), theory('equality')], [c_2255, c_1749, c_398, c_247])).
% 8.58/3.10 tff(c_2282, plain, (~in('#skF_4', '#skF_3')), inference(negUnitSimplification, [status(thm)], [c_360, c_535, c_2278])).
% 8.58/3.10 tff(c_2295, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_2292, c_2282])).
% 8.58/3.10 tff(c_2302, plain, (in('#skF_4', '#skF_3')), inference(splitRight, [status(thm)], [c_1747])).
% 8.58/3.10 tff(c_282, plain, (![V_14a:$int, T_15:Tree]: (in(V_14a, right(T_15)) | in(V_14a, left(T_15)) | val(T_15)=V_14a | empty=T_15 | ~in(V_14a, T_15))), inference(cnfTransformation, [status(thm)], [f_65])).
% 8.58/3.10 tff(c_2478, plain, ($less('#skF_4', '#skE_1') | ~in('#skF_4', right('#skF_3')) | empty='#skF_3'), inference(demodulation, [status(thm), theory('equality')], [c_398, c_2302, c_247])).
% 8.58/3.10 tff(c_2484, plain, (~in('#skF_4', right('#skF_3'))), inference(negUnitSimplification, [status(thm)], [c_360, c_535, c_2478])).
% 8.58/3.10 tff(c_2491, plain, (in('#skF_4', left('#skF_3')) | val('#skF_3')='#skF_4' | empty='#skF_3' | ~in('#skF_4', '#skF_3')), inference(resolution, [status(thm)], [c_282, c_2484])).
% 8.58/3.10 tff(c_2503, plain, (in('#skF_4', left('#skF_3')) | '#skF_4'='#skE_1' | empty='#skF_3'), inference(demodulation, [status(thm), theory('equality')], [c_2302, c_398, c_2491])).
% 8.58/3.10 tff(c_2509, plain, (in('#skF_4', left('#skF_3'))), inference(negUnitSimplification, [status(thm)], [c_360, c_423, c_2503])).
% 8.58/3.10 tff(c_2513, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_2509, c_1732])).
% 8.58/3.10 tff(c_2519, plain, ($less('#skF_4', '#skE_1')), inference(splitRight, [status(thm)], [c_532])).
% 8.58/3.10 tff(c_140, plain, (in('#skF_4', '#skF_5') | ~$less('#skF_4', val('#skF_3')) | val('#skF_3')='#skF_4' | empty='#skF_3' | in('#skF_4', '#skF_3')), inference(cnfTransformation, [status(thm)], [f_129])).
% 8.58/3.10 tff(c_4412, plain, (in('#skF_4', '#skF_5') | '#skF_4'='#skE_1' | empty='#skF_3' | in('#skF_4', '#skF_3')), inference(demodulation, [status(thm), theory('equality')], [c_398, c_2519, c_398, c_140])).
% 8.58/3.10 tff(c_4416, plain, (in('#skF_4', '#skF_5') | in('#skF_4', '#skF_3')), inference(negUnitSimplification, [status(thm)], [c_360, c_423, c_4412])).
% 8.58/3.10 tff(c_4423, plain, (in('#skF_4', '#skF_3')), inference(splitLeft, [status(thm)], [c_4416])).
% 8.58/3.10 tff(c_4046, plain, (in('#skF_4', '#skF_5') | '#skF_4'='#skE_1' | empty='#skF_3' | in('#skF_4', '#skF_3')), inference(demodulation, [status(thm), theory('equality')], [c_398, c_2519, c_398, c_140])).
% 8.58/3.10 tff(c_4050, plain, (in('#skF_4', '#skF_5') | in('#skF_4', '#skF_3')), inference(negUnitSimplification, [status(thm)], [c_360, c_423, c_4046])).
% 8.58/3.10 tff(c_4057, plain, (in('#skF_4', '#skF_3')), inference(splitLeft, [status(thm)], [c_4050])).
% 8.58/3.10 tff(c_2518, plain, (left('#skF_3')='#skF_5' | in('#skF_4', '#skF_3')), inference(splitRight, [status(thm)], [c_532])).
% 8.58/3.10 tff(c_2524, plain, (left('#skF_3')='#skF_5'), inference(splitLeft, [status(thm)], [c_2518])).
% 8.58/3.10 tff(c_425, plain, (![X_212:Tree]: (node(val(X_212), left(X_212), right(X_212))=X_212 | empty=X_212)), inference(cnfTransformation, [status(thm)], [f_33])).
% 8.58/3.10 tff(c_435, plain, (node('#skE_1', left('#skF_3'), right('#skF_3'))='#skF_3' | empty='#skF_3'), inference(superposition, [status(thm), theory('equality')], [c_398, c_425])).
% 8.58/3.10 tff(c_451, plain, (node('#skE_1', left('#skF_3'), right('#skF_3'))='#skF_3'), inference(negUnitSimplification, [status(thm)], [c_360, c_435])).
% 8.58/3.10 tff(c_2536, plain, (node('#skE_1', '#skF_5', right('#skF_3'))='#skF_3'), inference(demodulation, [status(thm), theory('equality')], [c_2524, c_451])).
% 8.58/3.10 tff(c_283, plain, (![X_1_0_11a:$int, X_1_1_12:Tree, X_1_2_13:Tree]: (node(X_1_0_11a, X_1_1_12, X_1_2_13)!=empty)), inference(cnfTransformation, [status(thm)], [f_46])).
% 8.58/3.10 tff(c_286, plain, (![X_1_0_2a:$int, X_1_1_3:Tree, X_1_2_4:Tree]: (val(node(X_1_0_2a, X_1_1_3, X_1_2_4))=X_1_0_2a)), inference(cnfTransformation, [status(thm)], [f_36])).
% 8.58/3.10 tff(c_285, plain, (![X_1_0_5a:$int, X_1_1_6:Tree, X_1_2_7:Tree]: (left(node(X_1_0_5a, X_1_1_6, X_1_2_7))=X_1_1_6)), inference(cnfTransformation, [status(thm)], [f_39])).
% 8.58/3.10 tff(c_284, plain, (![X_1_0_8a:$int, X_1_1_9:Tree, X_1_2_10:Tree]: (right(node(X_1_0_8a, X_1_1_9, X_1_2_10))=X_1_2_10)), inference(cnfTransformation, [status(thm)], [f_42])).
% 8.58/3.10 tff(c_3766, plain, (![V_994a:$int, T_995:Tree]: (in(V_994a, right(T_995)) | in(V_994a, left(T_995)) | val(T_995)=V_994a | empty=T_995 | ~in(V_994a, T_995))), inference(cnfTransformation, [status(thm)], [f_65])).
% 8.58/3.10 tff(c_3783, plain, (![V_994a:$int, X_1_2_10:Tree, X_1_0_8a:$int, X_1_1_9:Tree]: (in(V_994a, X_1_2_10) | in(V_994a, left(node(X_1_0_8a, X_1_1_9, X_1_2_10))) | val(node(X_1_0_8a, X_1_1_9, X_1_2_10))=V_994a | node(X_1_0_8a, X_1_1_9, X_1_2_10)=empty | ~in(V_994a, node(X_1_0_8a, X_1_1_9, X_1_2_10)))), inference(superposition, [status(thm), theory('equality')], [c_284, c_3766])).
% 8.58/3.10 tff(c_3796, plain, (![V_994a:$int, X_1_2_10:Tree, X_1_1_9:Tree, X_1_0_8a:$int]: (in(V_994a, X_1_2_10) | in(V_994a, X_1_1_9) | X_1_0_8a=V_994a | node(X_1_0_8a, X_1_1_9, X_1_2_10)=empty | ~in(V_994a, node(X_1_0_8a, X_1_1_9, X_1_2_10)))), inference(demodulation, [status(thm), theory('equality')], [c_286, c_285, c_3783])).
% 8.58/3.10 tff(c_3799, plain, (![V_996a:$int, X_1_2_997:Tree, X_1_1_998:Tree, X_1_0_999a:$int]: (in(V_996a, X_1_2_997) | in(V_996a, X_1_1_998) | X_1_0_999a=V_996a | ~in(V_996a, node(X_1_0_999a, X_1_1_998, X_1_2_997)))), inference(negUnitSimplification, [status(thm)], [c_283, c_3796])).
% 8.58/3.10 tff(c_3821, plain, (![V_1000a:$int]: (in(V_1000a, right('#skF_3')) | in(V_1000a, '#skF_5') | V_1000a='#skE_1' | ~in(V_1000a, '#skF_3'))), inference(superposition, [status(thm), theory('equality')], [c_2536, c_3799])).
% 8.58/3.10 tff(c_25, plain, (![V_22a:$int, T_16:Tree]: ($greater(V_22a, val(T_16)) | ~in(V_22a, right(T_16)) | empty=T_16 | ~searchtree(T_16))), inference(cnfTransformation, [status(thm)], [f_92])).
% 8.58/3.10 tff(c_276, plain, (![T_16:Tree, V_22a:$int]: ($less(val(T_16), V_22a) | ~in(V_22a, right(T_16)) | empty=T_16 | ~searchtree(T_16))), inference(backgroundSimplification, [status(thm), theory('LRFIA')], [c_25])).
% 8.58/3.10 tff(c_3831, plain, (![V_1000a:$int]: ($less(val('#skF_3'), V_1000a) | empty='#skF_3' | ~searchtree('#skF_3') | in(V_1000a, '#skF_5') | V_1000a='#skE_1' | ~in(V_1000a, '#skF_3'))), inference(resolution, [status(thm)], [c_3821, c_276])).
% 8.58/3.10 tff(c_3843, plain, (![V_1000a:$int]: ($less('#skE_1', V_1000a) | empty='#skF_3' | in(V_1000a, '#skF_5') | V_1000a='#skE_1' | ~in(V_1000a, '#skF_3'))), inference(demodulation, [status(thm), theory('equality')], [c_48, c_398, c_3831])).
% 8.58/3.10 tff(c_3850, plain, (![V_1001a:$int]: ($less('#skE_1', V_1001a) | in(V_1001a, '#skF_5') | V_1001a='#skE_1' | ~in(V_1001a, '#skF_3'))), inference(negUnitSimplification, [status(thm)], [c_360, c_3843])).
% 8.58/3.10 tff(c_226, plain, (~in('#skF_4', '#skF_3') | ~in('#skF_4', left('#skF_3')) | ~$less('#skF_4', val('#skF_3')) | empty='#skF_3'), inference(cnfTransformation, [status(thm)], [f_129])).
% 8.58/3.10 tff(c_3678, plain, (~in('#skF_4', '#skF_3') | ~in('#skF_4', '#skF_5') | empty='#skF_3'), inference(demodulation, [status(thm), theory('equality')], [c_2519, c_398, c_2524, c_226])).
% 8.58/3.10 tff(c_3682, plain, (~in('#skF_4', '#skF_3') | ~in('#skF_4', '#skF_5')), inference(negUnitSimplification, [status(thm)], [c_360, c_3678])).
% 8.58/3.10 tff(c_3687, plain, (~in('#skF_4', '#skF_5')), inference(splitLeft, [status(thm)], [c_3682])).
% 8.58/3.10 tff(c_3872, plain, ($less('#skE_1', '#skF_4') | '#skF_4'='#skE_1' | ~in('#skF_4', '#skF_3')), inference(resolution, [status(thm)], [c_3850, c_3687])).
% 8.58/3.10 tff(c_3884, plain, ($less('#skE_1', '#skF_4') | ~in('#skF_4', '#skF_3')), inference(negUnitSimplification, [status(thm)], [c_423, c_3872])).
% 8.58/3.10 tff(c_3889, plain, (~in('#skF_4', '#skF_3')), inference(splitLeft, [status(thm)], [c_3884])).
% 8.58/3.10 tff(c_4060, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_4057, c_3889])).
% 8.58/3.10 tff(c_4066, plain, (in('#skF_4', '#skF_5')), inference(splitRight, [status(thm)], [c_4050])).
% 8.58/3.10 tff(c_4069, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_4066, c_3687])).
% 8.58/3.10 tff(c_4071, plain, ($less('#skE_1', '#skF_4')), inference(splitRight, [status(thm)], [c_3884])).
% 8.58/3.10 tff(c_4092, plain, $false, inference(close, [status(thm), theory('LIA')], [c_4071, c_2519])).
% 8.58/3.10 tff(c_4096, plain, (~in('#skF_4', '#skF_3')), inference(splitRight, [status(thm)], [c_3682])).
% 8.58/3.10 tff(c_4426, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_4423, c_4096])).
% 8.58/3.10 tff(c_4432, plain, (in('#skF_4', '#skF_5')), inference(splitRight, [status(thm)], [c_4416])).
% 8.58/3.10 tff(c_3626, plain, (in('#skF_4', '#skF_5') | '#skF_4'='#skE_1' | empty='#skF_3' | in('#skF_4', '#skF_3')), inference(demodulation, [status(thm), theory('equality')], [c_398, c_2519, c_398, c_140])).
% 8.58/3.10 tff(c_3630, plain, (in('#skF_4', '#skF_5') | in('#skF_4', '#skF_3')), inference(negUnitSimplification, [status(thm)], [c_360, c_423, c_3626])).
% 8.58/3.10 tff(c_3637, plain, (in('#skF_4', '#skF_3')), inference(splitLeft, [status(thm)], [c_3630])).
% 8.58/3.10 tff(c_2999, plain, (in('#skF_4', '#skF_5') | '#skF_4'='#skE_1' | empty='#skF_3' | in('#skF_4', '#skF_3')), inference(demodulation, [status(thm), theory('equality')], [c_398, c_2519, c_398, c_140])).
% 8.58/3.10 tff(c_3003, plain, (in('#skF_4', '#skF_5') | in('#skF_4', '#skF_3')), inference(negUnitSimplification, [status(thm)], [c_360, c_423, c_2999])).
% 8.58/3.10 tff(c_3010, plain, (in('#skF_4', '#skF_3')), inference(splitLeft, [status(thm)], [c_3003])).
% 8.58/3.10 tff(c_2706, plain, (![V_698a:$int, T_699:Tree]: (in(V_698a, right(T_699)) | in(V_698a, left(T_699)) | val(T_699)=V_698a | empty=T_699 | ~in(V_698a, T_699))), inference(cnfTransformation, [status(thm)], [f_65])).
% 8.58/3.10 tff(c_2564, plain, (~in('#skF_4', '#skF_3') | ~in('#skF_4', '#skF_5') | ~in('#skF_4', right('#skF_3')) | empty='#skF_3'), inference(demodulation, [status(thm), theory('equality')], [c_2524, c_270])).
% 8.58/3.10 tff(c_2568, plain, (~in('#skF_4', '#skF_3') | ~in('#skF_4', '#skF_5') | ~in('#skF_4', right('#skF_3'))), inference(negUnitSimplification, [status(thm)], [c_360, c_2564])).
% 8.58/3.10 tff(c_2573, plain, (~in('#skF_4', right('#skF_3'))), inference(splitLeft, [status(thm)], [c_2568])).
% 8.58/3.10 tff(c_2714, plain, (in('#skF_4', left('#skF_3')) | val('#skF_3')='#skF_4' | empty='#skF_3' | ~in('#skF_4', '#skF_3')), inference(resolution, [status(thm)], [c_2706, c_2573])).
% 8.58/3.10 tff(c_2734, plain, (in('#skF_4', '#skF_5') | '#skF_4'='#skE_1' | empty='#skF_3' | ~in('#skF_4', '#skF_3')), inference(demodulation, [status(thm), theory('equality')], [c_398, c_2524, c_2714])).
% 8.58/3.10 tff(c_2738, plain, (in('#skF_4', '#skF_5') | ~in('#skF_4', '#skF_3')), inference(negUnitSimplification, [status(thm)], [c_360, c_423, c_2734])).
% 8.58/3.10 tff(c_2755, plain, (~in('#skF_4', '#skF_3')), inference(splitLeft, [status(thm)], [c_2738])).
% 8.58/3.10 tff(c_3013, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_3010, c_2755])).
% 8.58/3.10 tff(c_3020, plain, (in('#skF_4', '#skF_5')), inference(splitRight, [status(thm)], [c_3003])).
% 8.58/3.10 tff(c_279, plain, (![V_14a:$int, T_15:Tree]: (~in(V_14a, left(T_15)) | in(V_14a, T_15) | empty=T_15)), inference(cnfTransformation, [status(thm)], [f_65])).
% 8.58/3.10 tff(c_2543, plain, (![V_14a:$int]: (~in(V_14a, '#skF_5') | in(V_14a, '#skF_3') | empty='#skF_3')), inference(superposition, [status(thm), theory('equality')], [c_2524, c_279])).
% 8.58/3.10 tff(c_2556, plain, (![V_14a:$int]: (~in(V_14a, '#skF_5') | in(V_14a, '#skF_3'))), inference(negUnitSimplification, [status(thm)], [c_360, c_2543])).
% 8.58/3.10 tff(c_3044, plain, (in('#skF_4', '#skF_3')), inference(resolution, [status(thm)], [c_3020, c_2556])).
% 8.58/3.10 tff(c_3047, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_3044, c_2755])).
% 8.58/3.10 tff(c_3053, plain, (in('#skF_4', '#skF_5')), inference(splitRight, [status(thm)], [c_2738])).
% 8.58/3.10 tff(c_3054, plain, (in('#skF_4', '#skF_5')), inference(splitRight, [status(thm)], [c_2738])).
% 8.58/3.10 tff(c_3075, plain, (in('#skF_4', '#skF_3')), inference(resolution, [status(thm)], [c_3054, c_2556])).
% 8.58/3.10 tff(c_3214, plain, (empty='#skF_3'), inference(demodulation, [status(thm), theory('equality')], [c_2519, c_398, c_3053, c_2524, c_3075, c_226])).
% 8.58/3.10 tff(c_3215, plain, $false, inference(negUnitSimplification, [status(thm)], [c_360, c_3214])).
% 8.58/3.10 tff(c_3219, plain, (~in('#skF_4', '#skF_5') | ~in('#skF_4', '#skF_3')), inference(splitRight, [status(thm)], [c_2568])).
% 8.58/3.10 tff(c_3283, plain, (~in('#skF_4', '#skF_3')), inference(splitLeft, [status(thm)], [c_3219])).
% 8.58/3.10 tff(c_3640, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_3637, c_3283])).
% 8.58/3.10 tff(c_3647, plain, (in('#skF_4', '#skF_5')), inference(splitRight, [status(thm)], [c_3630])).
% 8.58/3.10 tff(c_3668, plain, (in('#skF_4', '#skF_3')), inference(resolution, [status(thm)], [c_3647, c_2556])).
% 8.58/3.10 tff(c_3671, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_3668, c_3283])).
% 8.58/3.10 tff(c_3675, plain, (~in('#skF_4', '#skF_5')), inference(splitRight, [status(thm)], [c_3219])).
% 8.58/3.10 tff(c_4435, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_4432, c_3675])).
% 8.58/3.10 tff(c_4447, plain, (in('#skF_4', '#skF_3')), inference(splitRight, [status(thm)], [c_2518])).
% 8.58/3.10 tff(c_4530, plain, (![V_1220a:$int, T_1221:Tree]: (in(V_1220a, right(T_1221)) | in(V_1220a, left(T_1221)) | val(T_1221)=V_1220a | empty=T_1221 | ~in(V_1220a, T_1221))), inference(cnfTransformation, [status(thm)], [f_65])).
% 8.58/3.10 tff(c_4547, plain, (![V_1220a:$int, X_1_2_10:Tree, X_1_0_8a:$int, X_1_1_9:Tree]: (in(V_1220a, X_1_2_10) | in(V_1220a, left(node(X_1_0_8a, X_1_1_9, X_1_2_10))) | val(node(X_1_0_8a, X_1_1_9, X_1_2_10))=V_1220a | node(X_1_0_8a, X_1_1_9, X_1_2_10)=empty | ~in(V_1220a, node(X_1_0_8a, X_1_1_9, X_1_2_10)))), inference(superposition, [status(thm), theory('equality')], [c_284, c_4530])).
% 8.58/3.10 tff(c_4560, plain, (![V_1220a:$int, X_1_2_10:Tree, X_1_1_9:Tree, X_1_0_8a:$int]: (in(V_1220a, X_1_2_10) | in(V_1220a, X_1_1_9) | X_1_0_8a=V_1220a | node(X_1_0_8a, X_1_1_9, X_1_2_10)=empty | ~in(V_1220a, node(X_1_0_8a, X_1_1_9, X_1_2_10)))), inference(demodulation, [status(thm), theory('equality')], [c_286, c_285, c_4547])).
% 8.58/3.10 tff(c_4563, plain, (![V_1222a:$int, X_1_2_1223:Tree, X_1_1_1224:Tree, X_1_0_1225a:$int]: (in(V_1222a, X_1_2_1223) | in(V_1222a, X_1_1_1224) | X_1_0_1225a=V_1222a | ~in(V_1222a, node(X_1_0_1225a, X_1_1_1224, X_1_2_1223)))), inference(negUnitSimplification, [status(thm)], [c_283, c_4560])).
% 8.58/3.10 tff(c_4585, plain, (![V_1226a:$int]: (in(V_1226a, right('#skF_3')) | in(V_1226a, left('#skF_3')) | V_1226a='#skE_1' | ~in(V_1226a, '#skF_3'))), inference(superposition, [status(thm), theory('equality')], [c_451, c_4563])).
% 8.58/3.10 tff(c_4595, plain, (![V_1226a:$int]: ($less(val('#skF_3'), V_1226a) | empty='#skF_3' | ~searchtree('#skF_3') | in(V_1226a, left('#skF_3')) | V_1226a='#skE_1' | ~in(V_1226a, '#skF_3'))), inference(resolution, [status(thm)], [c_4585, c_276])).
% 8.58/3.10 tff(c_4607, plain, (![V_1226a:$int]: ($less('#skE_1', V_1226a) | empty='#skF_3' | in(V_1226a, left('#skF_3')) | V_1226a='#skE_1' | ~in(V_1226a, '#skF_3'))), inference(demodulation, [status(thm), theory('equality')], [c_48, c_398, c_4595])).
% 8.58/3.10 tff(c_4614, plain, (![V_1227a:$int]: ($less('#skE_1', V_1227a) | in(V_1227a, left('#skF_3')) | V_1227a='#skE_1' | ~in(V_1227a, '#skF_3'))), inference(negUnitSimplification, [status(thm)], [c_360, c_4607])).
% 8.58/3.10 tff(c_4509, plain, (~in('#skF_4', left('#skF_3')) | empty='#skF_3'), inference(demodulation, [status(thm), theory('equality')], [c_2519, c_398, c_4447, c_226])).
% 8.58/3.10 tff(c_4513, plain, (~in('#skF_4', left('#skF_3'))), inference(negUnitSimplification, [status(thm)], [c_360, c_4509])).
% 8.58/3.10 tff(c_4617, plain, ($less('#skE_1', '#skF_4') | '#skF_4'='#skE_1' | ~in('#skF_4', '#skF_3')), inference(resolution, [status(thm)], [c_4614, c_4513])).
% 8.58/3.10 tff(c_4633, plain, ($less('#skE_1', '#skF_4') | '#skF_4'='#skE_1'), inference(demodulation, [status(thm), theory('equality')], [c_4447, c_4617])).
% 8.58/3.10 tff(c_4635, plain, ($less('#skE_1', '#skF_4')), inference(negUnitSimplification, [status(thm)], [c_423, c_4633])).
% 8.58/3.10 tff(c_4653, plain, $false, inference(close, [status(thm), theory('LIA')], [c_4635, c_2519])).
% 8.58/3.10 tff(c_4659, plain, ('#skF_4'='#skE_1'), inference(splitRight, [status(thm)], [c_401])).
% 8.58/3.10 tff(c_4658, plain, (~in('#skF_4', '#skF_3')), inference(splitRight, [status(thm)], [c_401])).
% 8.58/3.10 tff(c_4662, plain, $false, inference(demodulation, [status(thm), theory('equality')], [c_418, c_4659, c_4658])).
% 8.58/3.10 tff(c_4664, plain, (empty='#skF_3'), inference(splitRight, [status(thm)], [c_152])).
% 8.58/3.10 tff(c_281, plain, (![V_14a:$int]: (~in(V_14a, empty))), inference(cnfTransformation, [status(thm)], [f_65])).
% 8.58/3.10 tff(c_4677, plain, (![V_14a:$int]: (~in(V_14a, '#skF_3'))), inference(demodulation, [status(thm), theory('equality')], [c_4664, c_281])).
% 8.58/3.10 tff(c_4667, plain, (in('#skF_4', '#skF_3')), inference(splitRight, [status(thm)], [c_152])).
% 8.58/3.10 tff(c_4687, plain, $false, inference(negUnitSimplification, [status(thm)], [c_4677, c_4667])).
% 8.58/3.10 % SZS output end CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.58/3.10
% 8.58/3.10 Inference rules
% 8.58/3.10 ----------------------
% 8.58/3.10 #Ref : 0
% 8.58/3.10 #Sup : 641
% 8.58/3.10 #Fact : 0
% 8.58/3.10 #Define : 1
% 8.58/3.10 #Split : 23
% 8.58/3.10 #Chain : 0
% 8.58/3.10 #Close : 3
% 8.58/3.10
% 8.58/3.10 Ordering : LPO
% 8.58/3.10
% 8.58/3.10 Simplification rules
% 8.58/3.10 ----------------------
% 8.58/3.10 #Subsume : 112
% 8.58/3.10 #Demod : 621
% 8.58/3.10 #Tautology : 292
% 8.58/3.10 #SimpNegUnit : 172
% 8.58/3.10 #BackRed : 37
% 8.58/3.10
% 8.58/3.10 #Partial instantiations: 0
% 8.58/3.10 #Strategies tried : 1
% 8.58/3.10
% 8.58/3.10 Timing (in seconds)
% 8.58/3.10 ----------------------
% 8.58/3.10 Preprocessing : 0.71
% 8.58/3.10 Parsing : 0.33
% 8.58/3.10 CNF conversion : 0.04
% 8.58/3.10 Main loop : 1.24
% 8.58/3.10 Inferencing : 0.42
% 8.58/3.10 Reduction : 0.30
% 8.58/3.10 Demodulation : 0.20
% 8.58/3.10 BG Simplification : 0.14
% 8.58/3.10 Subsumption : 0.29
% 8.58/3.10 Abstraction : 0.06
% 8.58/3.10 MUC search : 0.00
% 8.58/3.10 Cooper : 0.04
% 8.58/3.10 Total : 2.08
% 8.58/3.10 Index Insertion : 0.00
% 8.58/3.10 Index Deletion : 0.00
% 8.58/3.10 Index Matching : 0.00
% 8.58/3.10 BG Taut test : 0.00
%------------------------------------------------------------------------------